/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 14:54:59,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:54:59,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:54:59,923 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:54:59,924 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:54:59,925 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:54:59,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:54:59,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:54:59,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:54:59,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:54:59,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:54:59,941 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:54:59,941 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:54:59,942 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:54:59,943 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:54:59,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:54:59,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:54:59,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:54:59,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:54:59,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:54:59,954 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:54:59,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:54:59,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:54:59,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:54:59,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:54:59,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:54:59,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:54:59,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:54:59,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:54:59,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:54:59,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:54:59,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:54:59,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:54:59,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:54:59,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:54:59,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:54:59,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:54:59,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:54:59,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:54:59,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:54:59,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:54:59,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:54:59,971 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:54:59,982 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:54:59,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:54:59,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:54:59,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:54:59,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:54:59,984 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:54:59,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:54:59,985 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:54:59,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:54:59,986 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:54:59,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:54:59,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:54:59,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:54:59,986 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:54:59,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:54:59,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:54:59,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:54:59,987 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:54:59,987 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:54:59,987 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:54:59,987 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:54:59,987 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:54:59,987 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 14:55:00,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:55:00,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:55:00,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:55:00,233 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:55:00,234 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:55:00,235 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-28 14:55:00,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c969a248/cfa68db69d8e4e759aeb52286b725c24/FLAG5a5e91b47 [2022-04-28 14:55:00,674 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:55:00,675 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c [2022-04-28 14:55:00,683 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c969a248/cfa68db69d8e4e759aeb52286b725c24/FLAG5a5e91b47 [2022-04-28 14:55:00,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c969a248/cfa68db69d8e4e759aeb52286b725c24 [2022-04-28 14:55:00,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:55:00,699 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:55:00,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:55:00,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:55:00,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:55:00,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:55:00" (1/1) ... [2022-04-28 14:55:00,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f718895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:55:00, skipping insertion in model container [2022-04-28 14:55:00,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:55:00" (1/1) ... [2022-04-28 14:55:00,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:55:00,735 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:55:00,886 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-28 14:55:00,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:55:00,895 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:55:00,914 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-28 14:55:00,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:55:00,925 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:55:00,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:55:00 WrapperNode [2022-04-28 14:55:00,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:55:00,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:55:00,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:55:00,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:55:00,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:55:00" (1/1) ... [2022-04-28 14:55:00,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:55:00" (1/1) ... [2022-04-28 14:55:00,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:55:00" (1/1) ... [2022-04-28 14:55:00,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:55:00" (1/1) ... [2022-04-28 14:55:00,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:55:00" (1/1) ... [2022-04-28 14:55:00,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:55:00" (1/1) ... [2022-04-28 14:55:00,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:55:00" (1/1) ... [2022-04-28 14:55:00,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:55:00,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:55:00,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:55:00,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:55:00,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:55:00" (1/1) ... [2022-04-28 14:55:00,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:55:00,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:55:00,997 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-28 14:55:01,011 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-28 14:55:01,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:55:01,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:55:01,028 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:55:01,028 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:55:01,028 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:55:01,028 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:55:01,028 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:55:01,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:55:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 14:55:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 14:55:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 14:55:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:55:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:55:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:55:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:55:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:55:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:55:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:55:01,079 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:55:01,081 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:55:01,305 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:55:01,311 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:55:01,311 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:55:01,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:55:01 BoogieIcfgContainer [2022-04-28 14:55:01,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:55:01,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:55:01,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:55:01,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:55:01,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:55:00" (1/3) ... [2022-04-28 14:55:01,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281194c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:55:01, skipping insertion in model container [2022-04-28 14:55:01,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:55:00" (2/3) ... [2022-04-28 14:55:01,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281194c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:55:01, skipping insertion in model container [2022-04-28 14:55:01,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:55:01" (3/3) ... [2022-04-28 14:55:01,327 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2022-04-28 14:55:01,339 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:55:01,339 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:55:01,389 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:55:01,398 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7bcf2f48, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ffe4d80 [2022-04-28 14:55:01,398 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:55:01,416 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-28 14:55:01,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-28 14:55:01,424 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:55:01,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:55:01,426 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:55:01,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:55:01,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1713790110, now seen corresponding path program 1 times [2022-04-28 14:55:01,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:55:01,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1943362200] [2022-04-28 14:55:01,451 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:55:01,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1713790110, now seen corresponding path program 2 times [2022-04-28 14:55:01,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:55:01,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300917566] [2022-04-28 14:55:01,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:55:01,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:55:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:55:01,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:55:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:55:01,685 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-28 14:55:01,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-28 14:55:01,686 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} #200#return; {54#true} is VALID [2022-04-28 14:55:01,690 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-28 14:55:01,691 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-28 14:55:01,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-28 14:55:01,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #200#return; {54#true} is VALID [2022-04-28 14:55:01,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret9 := main(); {54#true} is VALID [2022-04-28 14:55:01,692 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 -9223372036854775808 <= #t~nondet7 && #t~nondet7 <= 9223372036854775807;~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-28 14:55:01,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {59#(= main_~blastFlag~0 0)} assume !false; {59#(= main_~blastFlag~0 0)} is VALID [2022-04-28 14:55:01,694 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-28 14:55:01,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {55#false} assume !false; {55#false} is VALID [2022-04-28 14:55:01,695 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-28 14:55:01,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:55:01,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300917566] [2022-04-28 14:55:01,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300917566] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:55:01,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:55:01,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:55:01,699 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:55:01,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1943362200] [2022-04-28 14:55:01,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1943362200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:55:01,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:55:01,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:55:01,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875993369] [2022-04-28 14:55:01,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:55:01,707 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-28 14:55:01,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:55:01,711 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-28 14:55:01,733 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-28 14:55:01,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:55:01,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:55:01,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:55:01,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:55:01,759 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-28 14:55:02,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:02,129 INFO L93 Difference]: Finished difference Result 136 states and 224 transitions. [2022-04-28 14:55:02,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:55:02,129 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-28 14:55:02,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:55:02,131 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-28 14:55:02,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2022-04-28 14:55:02,151 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-28 14:55:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2022-04-28 14:55:02,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 224 transitions. [2022-04-28 14:55:02,348 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-28 14:55:02,357 INFO L225 Difference]: With dead ends: 136 [2022-04-28 14:55:02,357 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 14:55:02,359 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-28 14:55:02,367 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-28 14:55:02,368 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-28 14:55:02,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 14:55:02,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-28 14:55:02,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:55:02,406 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-28 14:55:02,408 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-28 14:55:02,409 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-28 14:55:02,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:02,415 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2022-04-28 14:55:02,415 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-28 14:55:02,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:55:02,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:55:02,417 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-28 14:55:02,417 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-28 14:55:02,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:02,422 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2022-04-28 14:55:02,423 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-28 14:55:02,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:55:02,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:55:02,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:55:02,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:55:02,424 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-28 14:55:02,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2022-04-28 14:55:02,428 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 9 [2022-04-28 14:55:02,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:55:02,429 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2022-04-28 14:55:02,429 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-28 14:55:02,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 125 transitions. [2022-04-28 14:55:02,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:55:02,554 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-28 14:55:02,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 14:55:02,554 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:55:02,554 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:55:02,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:55:02,555 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:55:02,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:55:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1144534844, now seen corresponding path program 1 times [2022-04-28 14:55:02,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:55:02,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2040406926] [2022-04-28 14:55:02,589 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:55:02,589 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:55:02,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1144534844, now seen corresponding path program 2 times [2022-04-28 14:55:02,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:55:02,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135408096] [2022-04-28 14:55:02,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:55:02,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:55:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:55:02,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:55:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:55:02,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {675#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {669#true} is VALID [2022-04-28 14:55:02,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {669#true} assume true; {669#true} is VALID [2022-04-28 14:55:02,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {669#true} {669#true} #200#return; {669#true} is VALID [2022-04-28 14:55:02,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {669#true} call ULTIMATE.init(); {675#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:55:02,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {669#true} is VALID [2022-04-28 14:55:02,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {669#true} assume true; {669#true} is VALID [2022-04-28 14:55:02,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {669#true} {669#true} #200#return; {669#true} is VALID [2022-04-28 14:55:02,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {669#true} call #t~ret9 := main(); {669#true} is VALID [2022-04-28 14:55:02,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {669#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -9223372036854775808 <= #t~nondet7 && #t~nondet7 <= 9223372036854775807;~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; {669#true} is VALID [2022-04-28 14:55:02,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {669#true} assume !false; {669#true} is VALID [2022-04-28 14:55:02,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {669#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {669#true} is VALID [2022-04-28 14:55:02,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {669#true} assume 8466 == ~s__state~0; {669#true} is VALID [2022-04-28 14:55:02,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {669#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {674#(= (+ (- 1) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:02,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {674#(= (+ (- 1) main_~blastFlag~0) 0)} ~s__state~0 := 8496; {674#(= (+ (- 1) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:02,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {674#(= (+ (- 1) main_~blastFlag~0) 0)} assume !false; {674#(= (+ (- 1) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:02,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {674#(= (+ (- 1) main_~blastFlag~0) 0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {670#false} is VALID [2022-04-28 14:55:02,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {670#false} assume !false; {670#false} is VALID [2022-04-28 14:55:02,678 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-28 14:55:02,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:55:02,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135408096] [2022-04-28 14:55:02,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135408096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:55:02,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:55:02,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:55:02,679 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:55:02,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2040406926] [2022-04-28 14:55:02,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2040406926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:55:02,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:55:02,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:55:02,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414308293] [2022-04-28 14:55:02,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:55:02,680 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-28 14:55:02,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:55:02,681 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-28 14:55:02,691 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-28 14:55:02,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:55:02,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:55:02,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:55:02,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:55:02,693 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-28 14:55:02,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:02,979 INFO L93 Difference]: Finished difference Result 160 states and 250 transitions. [2022-04-28 14:55:02,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:55:02,979 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-28 14:55:02,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:55:02,979 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-28 14:55:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-28 14:55:02,982 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-28 14:55:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-28 14:55:02,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 195 transitions. [2022-04-28 14:55:03,128 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-28 14:55:03,131 INFO L225 Difference]: With dead ends: 160 [2022-04-28 14:55:03,131 INFO L226 Difference]: Without dead ends: 120 [2022-04-28 14:55:03,131 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-28 14:55:03,132 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:55:03,132 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.1s Time] [2022-04-28 14:55:03,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-28 14:55:03,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-28 14:55:03,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:55:03,144 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-28 14:55:03,144 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-28 14:55:03,145 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-28 14:55:03,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:03,152 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions. [2022-04-28 14:55:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2022-04-28 14:55:03,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:55:03,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:55:03,158 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-28 14:55:03,158 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-28 14:55:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:03,164 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions. [2022-04-28 14:55:03,165 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2022-04-28 14:55:03,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:55:03,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:55:03,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:55:03,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:55:03,165 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-28 14:55:03,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 179 transitions. [2022-04-28 14:55:03,168 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 179 transitions. Word has length 14 [2022-04-28 14:55:03,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:55:03,169 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 179 transitions. [2022-04-28 14:55:03,169 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-28 14:55:03,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 179 transitions. [2022-04-28 14:55:03,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:55:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2022-04-28 14:55:03,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 14:55:03,292 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:55:03,292 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:55:03,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 14:55:03,293 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:55:03,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:55:03,293 INFO L85 PathProgramCache]: Analyzing trace with hash -974235404, now seen corresponding path program 1 times [2022-04-28 14:55:03,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:55:03,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [564711787] [2022-04-28 14:55:03,300 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:55:03,301 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:55:03,301 INFO L85 PathProgramCache]: Analyzing trace with hash -974235404, now seen corresponding path program 2 times [2022-04-28 14:55:03,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:55:03,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462283323] [2022-04-28 14:55:03,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:55:03,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:55:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:55:03,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:55:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:55:03,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {1487#(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); {1481#true} is VALID [2022-04-28 14:55:03,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {1481#true} assume true; {1481#true} is VALID [2022-04-28 14:55:03,347 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1481#true} {1481#true} #200#return; {1481#true} is VALID [2022-04-28 14:55:03,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {1481#true} call ULTIMATE.init(); {1487#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:55:03,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {1487#(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); {1481#true} is VALID [2022-04-28 14:55:03,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {1481#true} assume true; {1481#true} is VALID [2022-04-28 14:55:03,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1481#true} {1481#true} #200#return; {1481#true} is VALID [2022-04-28 14:55:03,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {1481#true} call #t~ret9 := main(); {1481#true} is VALID [2022-04-28 14:55:03,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {1481#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 -9223372036854775808 <= #t~nondet7 && #t~nondet7 <= 9223372036854775807;~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; {1481#true} is VALID [2022-04-28 14:55:03,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {1481#true} assume !false; {1481#true} is VALID [2022-04-28 14:55:03,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {1481#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1481#true} is VALID [2022-04-28 14:55:03,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {1481#true} assume 8466 == ~s__state~0; {1481#true} is VALID [2022-04-28 14:55:03,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {1481#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {1481#true} is VALID [2022-04-28 14:55:03,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {1481#true} ~s__state~0 := 8496; {1481#true} is VALID [2022-04-28 14:55:03,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {1481#true} assume !false; {1481#true} is VALID [2022-04-28 14:55:03,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {1481#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1481#true} is VALID [2022-04-28 14:55:03,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {1481#true} assume !(8466 == ~s__state~0); {1481#true} is VALID [2022-04-28 14:55:03,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {1481#true} assume 8496 == ~s__state~0; {1481#true} is VALID [2022-04-28 14:55:03,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {1481#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {1486#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:03,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {1486#(= (+ (- 2) main_~blastFlag~0) 0)} assume !(0 != ~s__hit~0);~s__state~0 := 8512; {1486#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:03,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {1486#(= (+ (- 2) main_~blastFlag~0) 0)} assume !false; {1486#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:03,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {1486#(= (+ (- 2) main_~blastFlag~0) 0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {1482#false} is VALID [2022-04-28 14:55:03,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {1482#false} assume !false; {1482#false} is VALID [2022-04-28 14:55:03,357 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-28 14:55:03,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:55:03,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462283323] [2022-04-28 14:55:03,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462283323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:55:03,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:55:03,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:55:03,358 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:55:03,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [564711787] [2022-04-28 14:55:03,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [564711787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:55:03,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:55:03,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:55:03,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354093291] [2022-04-28 14:55:03,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:55:03,358 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-28 14:55:03,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:55:03,359 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-28 14:55:03,368 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-28 14:55:03,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:55:03,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:55:03,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:55:03,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:55:03,369 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-28 14:55:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:03,555 INFO L93 Difference]: Finished difference Result 234 states and 359 transitions. [2022-04-28 14:55:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:55:03,555 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-28 14:55:03,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:55:03,555 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-28 14:55:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-28 14:55:03,557 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-28 14:55:03,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-28 14:55:03,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 196 transitions. [2022-04-28 14:55:03,678 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-28 14:55:03,681 INFO L225 Difference]: With dead ends: 234 [2022-04-28 14:55:03,681 INFO L226 Difference]: Without dead ends: 157 [2022-04-28 14:55:03,682 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-28 14:55:03,685 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-28 14:55:03,687 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-28 14:55:03,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-28 14:55:03,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-04-28 14:55:03,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:55:03,708 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-28 14:55:03,709 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-28 14:55:03,709 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-28 14:55:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:03,734 INFO L93 Difference]: Finished difference Result 157 states and 234 transitions. [2022-04-28 14:55:03,734 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 234 transitions. [2022-04-28 14:55:03,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:55:03,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:55:03,736 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-28 14:55:03,736 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-28 14:55:03,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:03,743 INFO L93 Difference]: Finished difference Result 157 states and 234 transitions. [2022-04-28 14:55:03,743 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 234 transitions. [2022-04-28 14:55:03,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:55:03,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:55:03,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:55:03,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:55:03,745 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-28 14:55:03,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 234 transitions. [2022-04-28 14:55:03,751 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 234 transitions. Word has length 20 [2022-04-28 14:55:03,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:55:03,751 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 234 transitions. [2022-04-28 14:55:03,751 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-28 14:55:03,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 234 transitions. [2022-04-28 14:55:03,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:55:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 234 transitions. [2022-04-28 14:55:03,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 14:55:03,915 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:55:03,916 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-28 14:55:03,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 14:55:03,916 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:55:03,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:55:03,916 INFO L85 PathProgramCache]: Analyzing trace with hash -674137767, now seen corresponding path program 1 times [2022-04-28 14:55:03,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:55:03,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1054803036] [2022-04-28 14:55:03,927 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:55:03,927 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:55:03,928 INFO L85 PathProgramCache]: Analyzing trace with hash -674137767, now seen corresponding path program 2 times [2022-04-28 14:55:03,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:55:03,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707406758] [2022-04-28 14:55:03,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:55:03,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:55:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:55:03,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:55:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:55:03,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {2595#(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); {2589#true} is VALID [2022-04-28 14:55:03,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-28 14:55:03,976 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2589#true} {2589#true} #200#return; {2589#true} is VALID [2022-04-28 14:55:03,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {2589#true} call ULTIMATE.init(); {2595#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:55:03,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {2595#(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); {2589#true} is VALID [2022-04-28 14:55:03,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-28 14:55:03,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2589#true} {2589#true} #200#return; {2589#true} is VALID [2022-04-28 14:55:03,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {2589#true} call #t~ret9 := main(); {2589#true} is VALID [2022-04-28 14:55:03,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {2589#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 -9223372036854775808 <= #t~nondet7 && #t~nondet7 <= 9223372036854775807;~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; {2589#true} is VALID [2022-04-28 14:55:03,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {2589#true} assume !false; {2589#true} is VALID [2022-04-28 14:55:03,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {2589#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2589#true} is VALID [2022-04-28 14:55:03,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {2589#true} assume 8466 == ~s__state~0; {2589#true} is VALID [2022-04-28 14:55:03,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {2589#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2589#true} is VALID [2022-04-28 14:55:03,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {2589#true} ~s__state~0 := 8496; {2589#true} is VALID [2022-04-28 14:55:03,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {2589#true} assume !false; {2589#true} is VALID [2022-04-28 14:55:03,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {2589#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2589#true} is VALID [2022-04-28 14:55:03,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {2589#true} assume !(8466 == ~s__state~0); {2589#true} is VALID [2022-04-28 14:55:03,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {2589#true} assume 8496 == ~s__state~0; {2589#true} is VALID [2022-04-28 14:55:03,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {2589#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {2589#true} is VALID [2022-04-28 14:55:03,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {2589#true} assume !(0 != ~s__hit~0);~s__state~0 := 8512; {2594#(= (+ (- 8512) main_~s__state~0) 0)} is VALID [2022-04-28 14:55:03,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {2594#(= (+ (- 8512) main_~s__state~0) 0)} assume !false; {2594#(= (+ (- 8512) main_~s__state~0) 0)} is VALID [2022-04-28 14:55:03,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {2594#(= (+ (- 8512) main_~s__state~0) 0)} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2594#(= (+ (- 8512) main_~s__state~0) 0)} is VALID [2022-04-28 14:55:03,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {2594#(= (+ (- 8512) main_~s__state~0) 0)} assume !(8466 == ~s__state~0); {2594#(= (+ (- 8512) main_~s__state~0) 0)} is VALID [2022-04-28 14:55:03,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {2594#(= (+ (- 8512) main_~s__state~0) 0)} assume !(8496 == ~s__state~0); {2594#(= (+ (- 8512) main_~s__state~0) 0)} is VALID [2022-04-28 14:55:03,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {2594#(= (+ (- 8512) main_~s__state~0) 0)} assume !(8512 == ~s__state~0); {2590#false} is VALID [2022-04-28 14:55:03,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {2590#false} assume !(8528 == ~s__state~0); {2590#false} is VALID [2022-04-28 14:55:03,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {2590#false} assume !(8544 == ~s__state~0); {2590#false} is VALID [2022-04-28 14:55:03,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {2590#false} assume !(8560 == ~s__state~0); {2590#false} is VALID [2022-04-28 14:55:03,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {2590#false} assume !(8576 == ~s__state~0); {2590#false} is VALID [2022-04-28 14:55:03,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {2590#false} assume !(8592 == ~s__state~0); {2590#false} is VALID [2022-04-28 14:55:03,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {2590#false} assume !(8608 == ~s__state~0); {2590#false} is VALID [2022-04-28 14:55:03,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {2590#false} assume !(8640 == ~s__state~0); {2590#false} is VALID [2022-04-28 14:55:03,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {2590#false} assume 8656 == ~s__state~0; {2590#false} is VALID [2022-04-28 14:55:03,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {2590#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {2590#false} is VALID [2022-04-28 14:55:03,983 INFO L290 TraceCheckUtils]: 31: Hoare triple {2590#false} ~s__state~0 := 8672; {2590#false} is VALID [2022-04-28 14:55:03,983 INFO L290 TraceCheckUtils]: 32: Hoare triple {2590#false} assume !false; {2590#false} is VALID [2022-04-28 14:55:03,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {2590#false} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {2590#false} is VALID [2022-04-28 14:55:03,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {2590#false} assume !false; {2590#false} is VALID [2022-04-28 14:55:03,984 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-28 14:55:03,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:55:03,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707406758] [2022-04-28 14:55:03,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707406758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:55:03,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:55:03,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:55:03,985 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:55:03,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1054803036] [2022-04-28 14:55:03,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1054803036] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:55:03,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:55:03,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:55:03,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694394091] [2022-04-28 14:55:03,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:55:03,985 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-28 14:55:03,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:55:03,986 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-28 14:55:04,016 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-28 14:55:04,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:55:04,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:55:04,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:55:04,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:55:04,018 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-28 14:55:04,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:04,156 INFO L93 Difference]: Finished difference Result 325 states and 488 transitions. [2022-04-28 14:55:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:55:04,157 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-28 14:55:04,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:55:04,157 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-28 14:55:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-28 14:55:04,158 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-28 14:55:04,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-28 14:55:04,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 144 transitions. [2022-04-28 14:55:04,243 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-28 14:55:04,245 INFO L225 Difference]: With dead ends: 325 [2022-04-28 14:55:04,245 INFO L226 Difference]: Without dead ends: 174 [2022-04-28 14:55:04,246 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-28 14:55:04,246 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-28 14:55:04,246 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-28 14:55:04,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-28 14:55:04,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2022-04-28 14:55:04,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:55:04,257 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-28 14:55:04,258 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-28 14:55:04,258 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-28 14:55:04,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:04,262 INFO L93 Difference]: Finished difference Result 174 states and 251 transitions. [2022-04-28 14:55:04,262 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 251 transitions. [2022-04-28 14:55:04,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:55:04,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:55:04,262 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-28 14:55:04,263 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-28 14:55:04,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:04,266 INFO L93 Difference]: Finished difference Result 174 states and 251 transitions. [2022-04-28 14:55:04,266 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 251 transitions. [2022-04-28 14:55:04,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:55:04,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:55:04,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:55:04,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:55:04,267 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-28 14:55:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 250 transitions. [2022-04-28 14:55:04,271 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 250 transitions. Word has length 35 [2022-04-28 14:55:04,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:55:04,271 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 250 transitions. [2022-04-28 14:55:04,271 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-28 14:55:04,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 172 states and 250 transitions. [2022-04-28 14:55:04,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:55:04,444 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 250 transitions. [2022-04-28 14:55:04,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 14:55:04,445 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:55:04,446 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-28 14:55:04,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 14:55:04,446 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:55:04,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:55:04,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1014805975, now seen corresponding path program 1 times [2022-04-28 14:55:04,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:55:04,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [889407322] [2022-04-28 14:55:04,464 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:55:04,464 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:55:04,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1014805975, now seen corresponding path program 2 times [2022-04-28 14:55:04,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:55:04,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454737183] [2022-04-28 14:55:04,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:55:04,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:55:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:55:04,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:55:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:55:04,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {3949#(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); {3943#true} is VALID [2022-04-28 14:55:04,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {3943#true} assume true; {3943#true} is VALID [2022-04-28 14:55:04,521 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3943#true} {3943#true} #200#return; {3943#true} is VALID [2022-04-28 14:55:04,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {3943#true} call ULTIMATE.init(); {3949#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:55:04,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {3949#(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); {3943#true} is VALID [2022-04-28 14:55:04,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {3943#true} assume true; {3943#true} is VALID [2022-04-28 14:55:04,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3943#true} {3943#true} #200#return; {3943#true} is VALID [2022-04-28 14:55:04,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {3943#true} call #t~ret9 := main(); {3943#true} is VALID [2022-04-28 14:55:04,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {3943#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 -9223372036854775808 <= #t~nondet7 && #t~nondet7 <= 9223372036854775807;~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; {3943#true} is VALID [2022-04-28 14:55:04,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {3943#true} assume !false; {3943#true} is VALID [2022-04-28 14:55:04,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {3943#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3943#true} is VALID [2022-04-28 14:55:04,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {3943#true} assume 8466 == ~s__state~0; {3943#true} is VALID [2022-04-28 14:55:04,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {3943#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {3943#true} is VALID [2022-04-28 14:55:04,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {3943#true} ~s__state~0 := 8496; {3943#true} is VALID [2022-04-28 14:55:04,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {3943#true} assume !false; {3943#true} is VALID [2022-04-28 14:55:04,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {3943#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3943#true} is VALID [2022-04-28 14:55:04,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {3943#true} assume !(8466 == ~s__state~0); {3943#true} is VALID [2022-04-28 14:55:04,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {3943#true} assume 8496 == ~s__state~0; {3943#true} is VALID [2022-04-28 14:55:04,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {3943#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {3943#true} is VALID [2022-04-28 14:55:04,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {3943#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {3943#true} is VALID [2022-04-28 14:55:04,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {3943#true} assume !false; {3943#true} is VALID [2022-04-28 14:55:04,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {3943#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3943#true} is VALID [2022-04-28 14:55:04,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {3943#true} assume !(8466 == ~s__state~0); {3943#true} is VALID [2022-04-28 14:55:04,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {3943#true} assume !(8496 == ~s__state~0); {3943#true} is VALID [2022-04-28 14:55:04,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {3943#true} assume !(8512 == ~s__state~0); {3943#true} is VALID [2022-04-28 14:55:04,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {3943#true} assume !(8528 == ~s__state~0); {3943#true} is VALID [2022-04-28 14:55:04,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {3943#true} assume !(8544 == ~s__state~0); {3943#true} is VALID [2022-04-28 14:55:04,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {3943#true} assume !(8560 == ~s__state~0); {3943#true} is VALID [2022-04-28 14:55:04,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {3943#true} assume !(8576 == ~s__state~0); {3943#true} is VALID [2022-04-28 14:55:04,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {3943#true} assume !(8592 == ~s__state~0); {3943#true} is VALID [2022-04-28 14:55:04,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {3943#true} assume !(8608 == ~s__state~0); {3943#true} is VALID [2022-04-28 14:55:04,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {3943#true} assume !(8640 == ~s__state~0); {3943#true} is VALID [2022-04-28 14:55:04,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {3943#true} assume 8656 == ~s__state~0; {3943#true} is VALID [2022-04-28 14:55:04,525 INFO L290 TraceCheckUtils]: 30: Hoare triple {3943#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {3943#true} is VALID [2022-04-28 14:55:04,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {3943#true} ~s__state~0 := 8672; {3948#(<= 8672 main_~s__state~0)} is VALID [2022-04-28 14:55:04,526 INFO L290 TraceCheckUtils]: 32: Hoare triple {3948#(<= 8672 main_~s__state~0)} assume !false; {3948#(<= 8672 main_~s__state~0)} is VALID [2022-04-28 14:55:04,526 INFO L290 TraceCheckUtils]: 33: Hoare triple {3948#(<= 8672 main_~s__state~0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {3944#false} is VALID [2022-04-28 14:55:04,526 INFO L290 TraceCheckUtils]: 34: Hoare triple {3944#false} assume !false; {3944#false} is VALID [2022-04-28 14:55:04,526 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-28 14:55:04,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:55:04,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454737183] [2022-04-28 14:55:04,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454737183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:55:04,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:55:04,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:55:04,527 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:55:04,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [889407322] [2022-04-28 14:55:04,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [889407322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:55:04,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:55:04,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:55:04,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373257303] [2022-04-28 14:55:04,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:55:04,528 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-28 14:55:04,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:55:04,528 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-28 14:55:04,543 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-28 14:55:04,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:55:04,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:55:04,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:55:04,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:55:04,544 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-28 14:55:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:04,739 INFO L93 Difference]: Finished difference Result 382 states and 571 transitions. [2022-04-28 14:55:04,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:55:04,740 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-28 14:55:04,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:55:04,741 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-28 14:55:04,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2022-04-28 14:55:04,743 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-28 14:55:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2022-04-28 14:55:04,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 161 transitions. [2022-04-28 14:55:04,838 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-28 14:55:04,842 INFO L225 Difference]: With dead ends: 382 [2022-04-28 14:55:04,842 INFO L226 Difference]: Without dead ends: 216 [2022-04-28 14:55:04,843 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-28 14:55:04,844 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 83 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:55:04,844 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.0s Time] [2022-04-28 14:55:04,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-04-28 14:55:04,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2022-04-28 14:55:04,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:55:04,893 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-28 14:55:04,893 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-28 14:55:04,894 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-28 14:55:04,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:04,898 INFO L93 Difference]: Finished difference Result 216 states and 293 transitions. [2022-04-28 14:55:04,898 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 293 transitions. [2022-04-28 14:55:04,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:55:04,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:55:04,899 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-28 14:55:04,899 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-28 14:55:04,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:04,904 INFO L93 Difference]: Finished difference Result 216 states and 293 transitions. [2022-04-28 14:55:04,904 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 293 transitions. [2022-04-28 14:55:04,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:55:04,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:55:04,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:55:04,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:55:04,905 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-28 14:55:04,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 289 transitions. [2022-04-28 14:55:04,919 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 289 transitions. Word has length 35 [2022-04-28 14:55:04,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:55:04,919 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 289 transitions. [2022-04-28 14:55:04,919 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-28 14:55:04,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 289 transitions. [2022-04-28 14:55:05,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 289 edges. 289 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:55:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 289 transitions. [2022-04-28 14:55:05,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 14:55:05,122 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:55:05,122 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-28 14:55:05,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 14:55:05,123 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:55:05,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:55:05,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1542489334, now seen corresponding path program 1 times [2022-04-28 14:55:05,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:55:05,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1256090540] [2022-04-28 14:55:05,132 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:55:05,132 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:55:05,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1542489334, now seen corresponding path program 2 times [2022-04-28 14:55:05,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:55:05,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590669211] [2022-04-28 14:55:05,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:55:05,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:55:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:55:05,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:55:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:55:05,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {5579#(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); {5573#true} is VALID [2022-04-28 14:55:05,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {5573#true} assume true; {5573#true} is VALID [2022-04-28 14:55:05,193 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5573#true} {5573#true} #200#return; {5573#true} is VALID [2022-04-28 14:55:05,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {5573#true} call ULTIMATE.init(); {5579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:55:05,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {5579#(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); {5573#true} is VALID [2022-04-28 14:55:05,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {5573#true} assume true; {5573#true} is VALID [2022-04-28 14:55:05,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5573#true} {5573#true} #200#return; {5573#true} is VALID [2022-04-28 14:55:05,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {5573#true} call #t~ret9 := main(); {5573#true} is VALID [2022-04-28 14:55:05,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {5573#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 -9223372036854775808 <= #t~nondet7 && #t~nondet7 <= 9223372036854775807;~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; {5573#true} is VALID [2022-04-28 14:55:05,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {5573#true} assume !false; {5573#true} is VALID [2022-04-28 14:55:05,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {5573#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {5573#true} is VALID [2022-04-28 14:55:05,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {5573#true} assume 8466 == ~s__state~0; {5573#true} is VALID [2022-04-28 14:55:05,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {5573#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {5573#true} is VALID [2022-04-28 14:55:05,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {5573#true} ~s__state~0 := 8496; {5573#true} is VALID [2022-04-28 14:55:05,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {5573#true} assume !false; {5573#true} is VALID [2022-04-28 14:55:05,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {5573#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {5573#true} is VALID [2022-04-28 14:55:05,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {5573#true} assume !(8466 == ~s__state~0); {5573#true} is VALID [2022-04-28 14:55:05,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {5573#true} assume 8496 == ~s__state~0; {5573#true} is VALID [2022-04-28 14:55:05,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {5573#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {5573#true} is VALID [2022-04-28 14:55:05,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {5573#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {5573#true} is VALID [2022-04-28 14:55:05,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {5573#true} assume !false; {5573#true} is VALID [2022-04-28 14:55:05,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {5573#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {5573#true} is VALID [2022-04-28 14:55:05,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {5573#true} assume !(8466 == ~s__state~0); {5573#true} is VALID [2022-04-28 14:55:05,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {5573#true} assume !(8496 == ~s__state~0); {5573#true} is VALID [2022-04-28 14:55:05,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {5573#true} assume !(8512 == ~s__state~0); {5573#true} is VALID [2022-04-28 14:55:05,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {5573#true} assume !(8528 == ~s__state~0); {5573#true} is VALID [2022-04-28 14:55:05,196 INFO L290 TraceCheckUtils]: 23: Hoare triple {5573#true} assume !(8544 == ~s__state~0); {5573#true} is VALID [2022-04-28 14:55:05,196 INFO L290 TraceCheckUtils]: 24: Hoare triple {5573#true} assume !(8560 == ~s__state~0); {5573#true} is VALID [2022-04-28 14:55:05,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {5573#true} assume !(8576 == ~s__state~0); {5573#true} is VALID [2022-04-28 14:55:05,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {5573#true} assume !(8592 == ~s__state~0); {5573#true} is VALID [2022-04-28 14:55:05,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {5573#true} assume !(8608 == ~s__state~0); {5573#true} is VALID [2022-04-28 14:55:05,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {5573#true} assume !(8640 == ~s__state~0); {5573#true} is VALID [2022-04-28 14:55:05,197 INFO L290 TraceCheckUtils]: 29: Hoare triple {5573#true} assume 8656 == ~s__state~0; {5573#true} is VALID [2022-04-28 14:55:05,197 INFO L290 TraceCheckUtils]: 30: Hoare triple {5573#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {5578#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:05,197 INFO L290 TraceCheckUtils]: 31: Hoare triple {5578#(= (+ (- 3) main_~blastFlag~0) 0)} ~s__state~0 := 8672; {5578#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:05,198 INFO L290 TraceCheckUtils]: 32: Hoare triple {5578#(= (+ (- 3) main_~blastFlag~0) 0)} assume !false; {5578#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:05,198 INFO L290 TraceCheckUtils]: 33: Hoare triple {5578#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {5578#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:05,198 INFO L290 TraceCheckUtils]: 34: Hoare triple {5578#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8466 == ~s__state~0); {5578#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:05,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {5578#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8496 == ~s__state~0); {5578#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:05,199 INFO L290 TraceCheckUtils]: 36: Hoare triple {5578#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8512 == ~s__state~0); {5578#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:05,199 INFO L290 TraceCheckUtils]: 37: Hoare triple {5578#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8528 == ~s__state~0); {5578#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:05,200 INFO L290 TraceCheckUtils]: 38: Hoare triple {5578#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8544 == ~s__state~0); {5578#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:05,200 INFO L290 TraceCheckUtils]: 39: Hoare triple {5578#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8560 == ~s__state~0); {5578#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:05,200 INFO L290 TraceCheckUtils]: 40: Hoare triple {5578#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8576 == ~s__state~0); {5578#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:05,201 INFO L290 TraceCheckUtils]: 41: Hoare triple {5578#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8592 == ~s__state~0); {5578#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:05,201 INFO L290 TraceCheckUtils]: 42: Hoare triple {5578#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8608 == ~s__state~0); {5578#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:05,201 INFO L290 TraceCheckUtils]: 43: Hoare triple {5578#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8640 == ~s__state~0); {5578#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:05,202 INFO L290 TraceCheckUtils]: 44: Hoare triple {5578#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8656 == ~s__state~0); {5578#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:05,202 INFO L290 TraceCheckUtils]: 45: Hoare triple {5578#(= (+ (- 3) main_~blastFlag~0) 0)} assume 8672 == ~s__state~0; {5578#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:05,202 INFO L290 TraceCheckUtils]: 46: Hoare triple {5578#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(4 == ~blastFlag~0); {5578#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-28 14:55:05,203 INFO L290 TraceCheckUtils]: 47: Hoare triple {5578#(= (+ (- 3) main_~blastFlag~0) 0)} assume 5 == ~blastFlag~0; {5574#false} is VALID [2022-04-28 14:55:05,203 INFO L290 TraceCheckUtils]: 48: Hoare triple {5574#false} assume !false; {5574#false} is VALID [2022-04-28 14:55:05,203 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-28 14:55:05,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:55:05,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590669211] [2022-04-28 14:55:05,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590669211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:55:05,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:55:05,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:55:05,204 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:55:05,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1256090540] [2022-04-28 14:55:05,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1256090540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:55:05,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:55:05,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:55:05,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878585716] [2022-04-28 14:55:05,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:55:05,204 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-28 14:55:05,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:55:05,205 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-28 14:55:05,241 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-28 14:55:05,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:55:05,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:55:05,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:55:05,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:55:05,242 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-28 14:55:05,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:05,465 INFO L93 Difference]: Finished difference Result 418 states and 581 transitions. [2022-04-28 14:55:05,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:55:05,465 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-28 14:55:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:55:05,465 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-28 14:55:05,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2022-04-28 14:55:05,467 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-28 14:55:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2022-04-28 14:55:05,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 197 transitions. [2022-04-28 14:55:05,597 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-28 14:55:05,602 INFO L225 Difference]: With dead ends: 418 [2022-04-28 14:55:05,603 INFO L226 Difference]: Without dead ends: 268 [2022-04-28 14:55:05,603 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-28 14:55:05,604 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-28 14:55:05,604 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-28 14:55:05,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-04-28 14:55:05,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2022-04-28 14:55:05,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:55:05,648 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-28 14:55:05,649 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-28 14:55:05,649 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-28 14:55:05,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:05,653 INFO L93 Difference]: Finished difference Result 268 states and 365 transitions. [2022-04-28 14:55:05,654 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 365 transitions. [2022-04-28 14:55:05,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:55:05,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:55:05,654 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-28 14:55:05,655 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-28 14:55:05,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:05,659 INFO L93 Difference]: Finished difference Result 268 states and 365 transitions. [2022-04-28 14:55:05,659 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 365 transitions. [2022-04-28 14:55:05,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:55:05,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:55:05,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:55:05,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:55:05,660 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-28 14:55:05,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 364 transitions. [2022-04-28 14:55:05,664 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 364 transitions. Word has length 49 [2022-04-28 14:55:05,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:55:05,665 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 364 transitions. [2022-04-28 14:55:05,665 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-28 14:55:05,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 266 states and 364 transitions. [2022-04-28 14:55:05,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 364 edges. 364 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:55:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 364 transitions. [2022-04-28 14:55:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 14:55:05,913 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:55:05,913 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-28 14:55:05,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 14:55:05,913 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:55:05,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:55:05,914 INFO L85 PathProgramCache]: Analyzing trace with hash 446239409, now seen corresponding path program 1 times [2022-04-28 14:55:05,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:55:05,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [691995779] [2022-04-28 14:55:05,929 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:55:05,929 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:55:05,929 INFO L85 PathProgramCache]: Analyzing trace with hash 446239409, now seen corresponding path program 2 times [2022-04-28 14:55:05,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:55:05,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508584345] [2022-04-28 14:55:05,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:55:05,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:55:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:55:05,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:55:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:55:05,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {7495#(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); {7489#true} is VALID [2022-04-28 14:55:05,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-28 14:55:05,984 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7489#true} {7489#true} #200#return; {7489#true} is VALID [2022-04-28 14:55:05,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {7489#true} call ULTIMATE.init(); {7495#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:55:05,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {7495#(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); {7489#true} is VALID [2022-04-28 14:55:05,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-28 14:55:05,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7489#true} {7489#true} #200#return; {7489#true} is VALID [2022-04-28 14:55:05,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {7489#true} call #t~ret9 := main(); {7489#true} is VALID [2022-04-28 14:55:05,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {7489#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 -9223372036854775808 <= #t~nondet7 && #t~nondet7 <= 9223372036854775807;~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; {7489#true} is VALID [2022-04-28 14:55:05,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {7489#true} assume !false; {7489#true} is VALID [2022-04-28 14:55:05,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {7489#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {7489#true} is VALID [2022-04-28 14:55:05,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {7489#true} assume 8466 == ~s__state~0; {7489#true} is VALID [2022-04-28 14:55:05,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {7489#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7489#true} is VALID [2022-04-28 14:55:05,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {7489#true} ~s__state~0 := 8496; {7489#true} is VALID [2022-04-28 14:55:05,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {7489#true} assume !false; {7489#true} is VALID [2022-04-28 14:55:05,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {7489#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {7489#true} is VALID [2022-04-28 14:55:05,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {7489#true} assume !(8466 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:05,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {7489#true} assume 8496 == ~s__state~0; {7489#true} is VALID [2022-04-28 14:55:05,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {7489#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {7489#true} is VALID [2022-04-28 14:55:05,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {7489#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {7489#true} is VALID [2022-04-28 14:55:05,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {7489#true} assume !false; {7489#true} is VALID [2022-04-28 14:55:05,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {7489#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {7489#true} is VALID [2022-04-28 14:55:06,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {7489#true} assume !(8466 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:06,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {7489#true} assume !(8496 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:06,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {7489#true} assume !(8512 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:06,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {7489#true} assume !(8528 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:06,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {7489#true} assume !(8544 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:06,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {7489#true} assume !(8560 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:06,000 INFO L290 TraceCheckUtils]: 25: Hoare triple {7489#true} assume !(8576 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:06,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {7489#true} assume !(8592 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:06,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {7489#true} assume !(8608 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:06,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {7489#true} assume !(8640 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:06,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {7489#true} assume 8656 == ~s__state~0; {7489#true} is VALID [2022-04-28 14:55:06,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {7489#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {7489#true} is VALID [2022-04-28 14:55:06,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {7489#true} ~s__state~0 := 8672; {7489#true} is VALID [2022-04-28 14:55:06,001 INFO L290 TraceCheckUtils]: 32: Hoare triple {7489#true} assume !false; {7489#true} is VALID [2022-04-28 14:55:06,001 INFO L290 TraceCheckUtils]: 33: Hoare triple {7489#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {7489#true} is VALID [2022-04-28 14:55:06,001 INFO L290 TraceCheckUtils]: 34: Hoare triple {7489#true} assume !(8466 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:06,001 INFO L290 TraceCheckUtils]: 35: Hoare triple {7489#true} assume !(8496 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:06,001 INFO L290 TraceCheckUtils]: 36: Hoare triple {7489#true} assume !(8512 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:06,001 INFO L290 TraceCheckUtils]: 37: Hoare triple {7489#true} assume !(8528 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:06,001 INFO L290 TraceCheckUtils]: 38: Hoare triple {7489#true} assume !(8544 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:06,002 INFO L290 TraceCheckUtils]: 39: Hoare triple {7489#true} assume !(8560 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:06,002 INFO L290 TraceCheckUtils]: 40: Hoare triple {7489#true} assume !(8576 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:06,002 INFO L290 TraceCheckUtils]: 41: Hoare triple {7489#true} assume !(8592 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:06,002 INFO L290 TraceCheckUtils]: 42: Hoare triple {7489#true} assume !(8608 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:06,002 INFO L290 TraceCheckUtils]: 43: Hoare triple {7489#true} assume !(8640 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:06,002 INFO L290 TraceCheckUtils]: 44: Hoare triple {7489#true} assume !(8656 == ~s__state~0); {7489#true} is VALID [2022-04-28 14:55:06,002 INFO L290 TraceCheckUtils]: 45: Hoare triple {7489#true} assume 8672 == ~s__state~0; {7489#true} is VALID [2022-04-28 14:55:06,002 INFO L290 TraceCheckUtils]: 46: Hoare triple {7489#true} assume !(4 == ~blastFlag~0); {7489#true} is VALID [2022-04-28 14:55:06,002 INFO L290 TraceCheckUtils]: 47: Hoare triple {7489#true} assume !(5 == ~blastFlag~0); {7489#true} is VALID [2022-04-28 14:55:06,003 INFO L290 TraceCheckUtils]: 48: Hoare triple {7489#true} assume 0 != ~s__hit~0;~s__state~0 := 8640; {7494#(<= 8640 main_~s__state~0)} is VALID [2022-04-28 14:55:06,003 INFO L290 TraceCheckUtils]: 49: Hoare triple {7494#(<= 8640 main_~s__state~0)} assume !false; {7494#(<= 8640 main_~s__state~0)} is VALID [2022-04-28 14:55:06,004 INFO L290 TraceCheckUtils]: 50: Hoare triple {7494#(<= 8640 main_~s__state~0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {7490#false} is VALID [2022-04-28 14:55:06,004 INFO L290 TraceCheckUtils]: 51: Hoare triple {7490#false} assume !false; {7490#false} is VALID [2022-04-28 14:55:06,004 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-28 14:55:06,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:55:06,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508584345] [2022-04-28 14:55:06,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508584345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:55:06,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:55:06,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:55:06,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:55:06,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [691995779] [2022-04-28 14:55:06,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [691995779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:55:06,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:55:06,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:55:06,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675713839] [2022-04-28 14:55:06,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:55:06,005 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-28 14:55:06,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:55:06,005 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-28 14:55:06,021 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-28 14:55:06,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:55:06,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:55:06,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:55:06,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:55:06,022 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-28 14:55:06,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:06,277 INFO L93 Difference]: Finished difference Result 524 states and 735 transitions. [2022-04-28 14:55:06,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:55:06,278 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-28 14:55:06,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:55:06,279 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-28 14:55:06,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-28 14:55:06,281 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-28 14:55:06,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-28 14:55:06,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-28 14:55:06,374 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-28 14:55:06,376 INFO L225 Difference]: With dead ends: 524 [2022-04-28 14:55:06,376 INFO L226 Difference]: Without dead ends: 186 [2022-04-28 14:55:06,377 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-28 14:55:06,377 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-28 14:55:06,377 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-28 14:55:06,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-28 14:55:06,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2022-04-28 14:55:06,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:55:06,459 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-28 14:55:06,459 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-28 14:55:06,459 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-28 14:55:06,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:06,462 INFO L93 Difference]: Finished difference Result 186 states and 239 transitions. [2022-04-28 14:55:06,462 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 239 transitions. [2022-04-28 14:55:06,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:55:06,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:55:06,463 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-28 14:55:06,463 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-28 14:55:06,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:06,465 INFO L93 Difference]: Finished difference Result 186 states and 239 transitions. [2022-04-28 14:55:06,465 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 239 transitions. [2022-04-28 14:55:06,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:55:06,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:55:06,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:55:06,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:55:06,466 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-28 14:55:06,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 234 transitions. [2022-04-28 14:55:06,468 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 234 transitions. Word has length 52 [2022-04-28 14:55:06,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:55:06,469 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 234 transitions. [2022-04-28 14:55:06,469 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-28 14:55:06,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 234 transitions. [2022-04-28 14:55:06,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:55:06,638 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 234 transitions. [2022-04-28 14:55:06,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 14:55:06,639 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:55:06,639 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-28 14:55:06,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 14:55:06,639 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:55:06,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:55:06,639 INFO L85 PathProgramCache]: Analyzing trace with hash -209652788, now seen corresponding path program 1 times [2022-04-28 14:55:06,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:55:06,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [751412067] [2022-04-28 14:55:06,664 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:55:06,664 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:55:06,664 INFO L85 PathProgramCache]: Analyzing trace with hash -209652788, now seen corresponding path program 2 times [2022-04-28 14:55:06,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:55:06,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456667022] [2022-04-28 14:55:06,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:55:06,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:55:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:55:06,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:55:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:55:06,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {9293#(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); {9287#true} is VALID [2022-04-28 14:55:06,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {9287#true} assume true; {9287#true} is VALID [2022-04-28 14:55:06,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9287#true} {9287#true} #200#return; {9287#true} is VALID [2022-04-28 14:55:06,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {9287#true} call ULTIMATE.init(); {9293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:55:06,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {9293#(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); {9287#true} is VALID [2022-04-28 14:55:06,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {9287#true} assume true; {9287#true} is VALID [2022-04-28 14:55:06,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9287#true} {9287#true} #200#return; {9287#true} is VALID [2022-04-28 14:55:06,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {9287#true} call #t~ret9 := main(); {9287#true} is VALID [2022-04-28 14:55:06,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {9287#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 -9223372036854775808 <= #t~nondet7 && #t~nondet7 <= 9223372036854775807;~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; {9287#true} is VALID [2022-04-28 14:55:06,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {9287#true} assume !false; {9287#true} is VALID [2022-04-28 14:55:06,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {9287#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {9287#true} is VALID [2022-04-28 14:55:06,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {9287#true} assume 8466 == ~s__state~0; {9287#true} is VALID [2022-04-28 14:55:06,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {9287#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9287#true} is VALID [2022-04-28 14:55:06,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {9287#true} ~s__state~0 := 8496; {9287#true} is VALID [2022-04-28 14:55:06,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {9287#true} assume !false; {9287#true} is VALID [2022-04-28 14:55:06,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {9287#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {9287#true} is VALID [2022-04-28 14:55:06,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {9287#true} assume !(8466 == ~s__state~0); {9287#true} is VALID [2022-04-28 14:55:06,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {9287#true} assume 8496 == ~s__state~0; {9287#true} is VALID [2022-04-28 14:55:06,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {9287#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {9287#true} is VALID [2022-04-28 14:55:06,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {9287#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !false; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8466 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8496 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8512 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8528 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8544 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8560 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8576 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8592 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8608 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8640 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume 8656 == ~s__state~0; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,763 INFO L290 TraceCheckUtils]: 31: Hoare triple {9292#(not (= main_~s__hit~0 0))} ~s__state~0 := 8672; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,763 INFO L290 TraceCheckUtils]: 32: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !false; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,763 INFO L290 TraceCheckUtils]: 34: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8466 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8496 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,764 INFO L290 TraceCheckUtils]: 36: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8512 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,764 INFO L290 TraceCheckUtils]: 37: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8528 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,764 INFO L290 TraceCheckUtils]: 38: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8544 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8560 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8576 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8592 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,765 INFO L290 TraceCheckUtils]: 42: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8608 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,766 INFO L290 TraceCheckUtils]: 43: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8640 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,766 INFO L290 TraceCheckUtils]: 44: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8656 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,766 INFO L290 TraceCheckUtils]: 45: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume 8672 == ~s__state~0; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,767 INFO L290 TraceCheckUtils]: 46: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(4 == ~blastFlag~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,767 INFO L290 TraceCheckUtils]: 47: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(5 == ~blastFlag~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,767 INFO L290 TraceCheckUtils]: 48: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume 0 != ~s__hit~0;~s__state~0 := 8640; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !false; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,768 INFO L290 TraceCheckUtils]: 50: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,768 INFO L290 TraceCheckUtils]: 51: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8466 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8496 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,768 INFO L290 TraceCheckUtils]: 53: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8512 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,769 INFO L290 TraceCheckUtils]: 54: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8528 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,769 INFO L290 TraceCheckUtils]: 55: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8544 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,769 INFO L290 TraceCheckUtils]: 56: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8560 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,769 INFO L290 TraceCheckUtils]: 57: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8576 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,770 INFO L290 TraceCheckUtils]: 58: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8592 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,770 INFO L290 TraceCheckUtils]: 59: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8608 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,770 INFO L290 TraceCheckUtils]: 60: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume 8640 == ~s__state~0; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,771 INFO L290 TraceCheckUtils]: 61: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 14:55:06,771 INFO L290 TraceCheckUtils]: 62: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(0 != ~s__hit~0);~s__state~0 := 8656; {9288#false} is VALID [2022-04-28 14:55:06,771 INFO L290 TraceCheckUtils]: 63: Hoare triple {9288#false} assume !false; {9288#false} is VALID [2022-04-28 14:55:06,771 INFO L290 TraceCheckUtils]: 64: Hoare triple {9288#false} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {9288#false} is VALID [2022-04-28 14:55:06,771 INFO L290 TraceCheckUtils]: 65: Hoare triple {9288#false} assume !(8466 == ~s__state~0); {9288#false} is VALID [2022-04-28 14:55:06,771 INFO L290 TraceCheckUtils]: 66: Hoare triple {9288#false} assume !(8496 == ~s__state~0); {9288#false} is VALID [2022-04-28 14:55:06,771 INFO L290 TraceCheckUtils]: 67: Hoare triple {9288#false} assume !(8512 == ~s__state~0); {9288#false} is VALID [2022-04-28 14:55:06,771 INFO L290 TraceCheckUtils]: 68: Hoare triple {9288#false} assume !(8528 == ~s__state~0); {9288#false} is VALID [2022-04-28 14:55:06,771 INFO L290 TraceCheckUtils]: 69: Hoare triple {9288#false} assume !(8544 == ~s__state~0); {9288#false} is VALID [2022-04-28 14:55:06,771 INFO L290 TraceCheckUtils]: 70: Hoare triple {9288#false} assume !(8560 == ~s__state~0); {9288#false} is VALID [2022-04-28 14:55:06,772 INFO L290 TraceCheckUtils]: 71: Hoare triple {9288#false} assume !(8576 == ~s__state~0); {9288#false} is VALID [2022-04-28 14:55:06,772 INFO L290 TraceCheckUtils]: 72: Hoare triple {9288#false} assume !(8592 == ~s__state~0); {9288#false} is VALID [2022-04-28 14:55:06,772 INFO L290 TraceCheckUtils]: 73: Hoare triple {9288#false} assume !(8608 == ~s__state~0); {9288#false} is VALID [2022-04-28 14:55:06,772 INFO L290 TraceCheckUtils]: 74: Hoare triple {9288#false} assume !(8640 == ~s__state~0); {9288#false} is VALID [2022-04-28 14:55:06,772 INFO L290 TraceCheckUtils]: 75: Hoare triple {9288#false} assume !(8656 == ~s__state~0); {9288#false} is VALID [2022-04-28 14:55:06,772 INFO L290 TraceCheckUtils]: 76: Hoare triple {9288#false} assume 8672 == ~s__state~0; {9288#false} is VALID [2022-04-28 14:55:06,772 INFO L290 TraceCheckUtils]: 77: Hoare triple {9288#false} assume !(4 == ~blastFlag~0); {9288#false} is VALID [2022-04-28 14:55:06,772 INFO L290 TraceCheckUtils]: 78: Hoare triple {9288#false} assume 5 == ~blastFlag~0; {9288#false} is VALID [2022-04-28 14:55:06,772 INFO L290 TraceCheckUtils]: 79: Hoare triple {9288#false} assume !false; {9288#false} is VALID [2022-04-28 14:55:06,773 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-28 14:55:06,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:55:06,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456667022] [2022-04-28 14:55:06,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456667022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:55:06,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:55:06,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:55:06,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:55:06,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [751412067] [2022-04-28 14:55:06,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [751412067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:55:06,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:55:06,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:55:06,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705351472] [2022-04-28 14:55:06,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:55:06,774 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-28 14:55:06,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:55:06,774 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-28 14:55:06,799 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-28 14:55:06,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:55:06,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:55:06,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:55:06,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:55:06,800 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-28 14:55:06,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:06,976 INFO L93 Difference]: Finished difference Result 275 states and 332 transitions. [2022-04-28 14:55:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:55:06,977 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-28 14:55:06,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:55:06,977 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-28 14:55:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2022-04-28 14:55:06,978 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-28 14:55:06,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2022-04-28 14:55:06,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 117 transitions. [2022-04-28 14:55:07,047 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-28 14:55:07,048 INFO L225 Difference]: With dead ends: 275 [2022-04-28 14:55:07,048 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 14:55:07,048 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-28 14:55:07,049 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-28 14:55:07,049 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-28 14:55:07,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 14:55:07,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 14:55:07,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:55:07,050 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-28 14:55:07,050 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-28 14:55:07,050 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-28 14:55:07,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:07,050 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:55:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:55:07,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:55:07,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:55:07,050 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-28 14:55:07,050 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-28 14:55:07,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:55:07,050 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:55:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:55:07,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:55:07,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:55:07,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:55:07,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:55:07,051 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-28 14:55:07,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 14:55:07,051 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2022-04-28 14:55:07,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:55:07,051 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 14:55:07,051 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-28 14:55:07,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 14:55:07,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:55:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:55:07,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:55:07,053 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 14:55:07,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 14:55:07,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 14:55:08,101 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-28 14:55:08,101 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-28 14:55:08,101 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-28 14:55:08,102 INFO L902 garLoopResultBuilder]: At program point L225(lines 20 229) the Hoare annotation is: true [2022-04-28 14:55:08,102 INFO L895 garLoopResultBuilder]: At program point L126(lines 126 130) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-28 14:55:08,102 INFO L895 garLoopResultBuilder]: At program point L60(lines 60 207) 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-28 14:55:08,102 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 20 229) the Hoare annotation is: true [2022-04-28 14:55:08,102 INFO L895 garLoopResultBuilder]: At program point L184(lines 184 186) 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-28 14:55:08,102 INFO L895 garLoopResultBuilder]: At program point L118(lines 118 122) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-28 14:55:08,102 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-28 14:55:08,102 INFO L895 garLoopResultBuilder]: At program point L52(lines 52 211) 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-28 14:55:08,102 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-28 14:55:08,102 INFO L895 garLoopResultBuilder]: At program point L44(lines 44 215) 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-28 14:55:08,103 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-28 14:55:08,103 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-28 14:55:08,103 INFO L895 garLoopResultBuilder]: At program point L185(lines 20 229) the Hoare annotation is: false [2022-04-28 14:55:08,103 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-28 14:55:08,103 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-28 14:55:08,103 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 20 229) the Hoare annotation is: true [2022-04-28 14:55:08,103 INFO L895 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 227) the Hoare annotation is: false [2022-04-28 14:55:08,103 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 229) the Hoare annotation is: true [2022-04-28 14:55:08,104 INFO L895 garLoopResultBuilder]: At program point L80(lines 80 197) 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-28 14:55:08,104 INFO L895 garLoopResultBuilder]: At program point L72(lines 72 201) 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-28 14:55:08,104 INFO L895 garLoopResultBuilder]: At program point L163-1(lines 86 195) 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 (= main_~blastFlag~0 0) .cse0) (and (not (= main_~s__hit~0 0)) .cse0))) [2022-04-28 14:55:08,104 INFO L895 garLoopResultBuilder]: At program point L64(lines 64 205) 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-28 14:55:08,104 INFO L895 garLoopResultBuilder]: At program point L97-1(lines 86 195) the Hoare annotation is: (or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-28 14:55:08,104 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-28 14:55:08,104 INFO L895 garLoopResultBuilder]: At program point L56(lines 56 209) 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-28 14:55:08,104 INFO L895 garLoopResultBuilder]: At program point L147(lines 147 151) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-28 14:55:08,104 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-28 14:55:08,105 INFO L895 garLoopResultBuilder]: At program point L48(lines 48 213) 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-28 14:55:08,105 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-28 14:55:08,105 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-28 14:55:08,105 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-28 14:55:08,105 INFO L895 garLoopResultBuilder]: At program point L90-1(lines 90 92) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0)) [2022-04-28 14:55:08,105 INFO L895 garLoopResultBuilder]: At program point L181-1(lines 86 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-28 14:55:08,105 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-28 14:55:08,105 INFO L895 garLoopResultBuilder]: At program point L41(lines 41 216) 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-28 14:55:08,105 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-28 14:55:08,105 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-28 14:55:08,105 INFO L895 garLoopResultBuilder]: At program point L174-1(lines 174 176) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and (= main_~blastFlag~0 1) .cse0) (and (= main_~blastFlag~0 0) .cse0) (and (= 3 main_~blastFlag~0) .cse0))) [2022-04-28 14:55:08,105 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-28 14:55:08,105 INFO L895 garLoopResultBuilder]: At program point L117(lines 117 135) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-28 14:55:08,105 INFO L895 garLoopResultBuilder]: At program point L84(lines 84 195) the Hoare annotation is: (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and (= 3 main_~blastFlag~0) (<= 8640 main_~s__state~0)) (= 2 main_~blastFlag~0)) [2022-04-28 14:55:08,106 INFO L895 garLoopResultBuilder]: At program point L76(lines 76 199) 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-28 14:55:08,106 INFO L895 garLoopResultBuilder]: At program point L68(lines 68 203) 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-28 14:55:08,106 INFO L895 garLoopResultBuilder]: At program point L35(line 35) 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-28 14:55:08,106 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:55:08,106 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-28 14:55:08,106 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:55:08,106 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:55:08,106 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 14:55:08,106 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 14:55:08,106 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:55:08,108 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 14:55:08,109 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 14:55:08,113 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 14:55:08,128 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 14:55:08,171 INFO L163 areAnnotationChecker]: CFG has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 14:55:08,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:55:08 BoogieIcfgContainer [2022-04-28 14:55:08,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 14:55:08,188 INFO L158 Benchmark]: Toolchain (without parser) took 7488.98ms. Allocated memory was 195.0MB in the beginning and 355.5MB in the end (delta: 160.4MB). Free memory was 138.9MB in the beginning and 192.6MB in the end (delta: -53.7MB). Peak memory consumption was 131.6MB. Max. memory is 8.0GB. [2022-04-28 14:55:08,188 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 195.0MB. Free memory is still 155.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 14:55:08,188 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.47ms. Allocated memory was 195.0MB in the beginning and 275.8MB in the end (delta: 80.7MB). Free memory was 138.7MB in the beginning and 244.9MB in the end (delta: -106.3MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. [2022-04-28 14:55:08,188 INFO L158 Benchmark]: Boogie Preprocessor took 27.05ms. Allocated memory is still 275.8MB. Free memory was 244.9MB in the beginning and 243.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 14:55:08,189 INFO L158 Benchmark]: RCFGBuilder took 357.63ms. Allocated memory is still 275.8MB. Free memory was 242.8MB in the beginning and 228.8MB in the end (delta: 14.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-28 14:55:08,189 INFO L158 Benchmark]: TraceAbstraction took 6872.90ms. Allocated memory was 275.8MB in the beginning and 355.5MB in the end (delta: 79.7MB). Free memory was 228.2MB in the beginning and 192.6MB in the end (delta: 35.6MB). Peak memory consumption was 141.2MB. Max. memory is 8.0GB. [2022-04-28 14:55:08,190 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.16ms. Allocated memory is still 195.0MB. Free memory is still 155.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.47ms. Allocated memory was 195.0MB in the beginning and 275.8MB in the end (delta: 80.7MB). Free memory was 138.7MB in the beginning and 244.9MB in the end (delta: -106.3MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.05ms. Allocated memory is still 275.8MB. Free memory was 244.9MB in the beginning and 243.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 357.63ms. Allocated memory is still 275.8MB. Free memory was 242.8MB in the beginning and 228.8MB in the end (delta: 14.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6872.90ms. Allocated memory was 275.8MB in the beginning and 355.5MB in the end (delta: 79.7MB). Free memory was 228.2MB in the beginning and 192.6MB in the end (delta: 35.6MB). Peak memory consumption was 141.2MB. 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: 6.7s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, 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.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 51 LocationsWithAnnotation, 51 PreInvPairs, 317 NumberOfFragments, 853 HoareAnnotationTreeSize, 51 FomulaSimplifications, 508 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 51 FomulaSimplificationsInter, 1057 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 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 - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 14:55:08,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...