/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-e106359-m [2022-04-15 17:50:03,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 17:50:03,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 17:50:04,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 17:50:04,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 17:50:04,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 17:50:04,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 17:50:04,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 17:50:04,017 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 17:50:04,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 17:50:04,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 17:50:04,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 17:50:04,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 17:50:04,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 17:50:04,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 17:50:04,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 17:50:04,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 17:50:04,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 17:50:04,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 17:50:04,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 17:50:04,024 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 17:50:04,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 17:50:04,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 17:50:04,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 17:50:04,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 17:50:04,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 17:50:04,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 17:50:04,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 17:50:04,031 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 17:50:04,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 17:50:04,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 17:50:04,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 17:50:04,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 17:50:04,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 17:50:04,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 17:50:04,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 17:50:04,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 17:50:04,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 17:50:04,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 17:50:04,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 17:50:04,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 17:50:04,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 17:50:04,038 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 17:50:04,047 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 17:50:04,048 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 17:50:04,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 17:50:04,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 17:50:04,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 17:50:04,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 17:50:04,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 17:50:04,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 17:50:04,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 17:50:04,050 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 17:50:04,050 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 17:50:04,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 17:50:04,050 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 17:50:04,050 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 17:50:04,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 17:50:04,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:50:04,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 17:50:04,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 17:50:04,050 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 17:50:04,051 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 17:50:04,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 17:50:04,051 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 17:50:04,051 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 17:50:04,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 17:50:04,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 17:50:04,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 17:50:04,256 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 17:50:04,257 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 17:50:04,258 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c [2022-04-15 17:50:04,313 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/823641b21/a67a77bb7828492980165c9db7eea5fb/FLAGe26122500 [2022-04-15 17:50:04,692 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 17:50:04,693 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c [2022-04-15 17:50:04,698 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/823641b21/a67a77bb7828492980165c9db7eea5fb/FLAGe26122500 [2022-04-15 17:50:04,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/823641b21/a67a77bb7828492980165c9db7eea5fb [2022-04-15 17:50:04,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 17:50:04,715 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 17:50:04,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 17:50:04,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 17:50:04,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 17:50:04,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:50:04" (1/1) ... [2022-04-15 17:50:04,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60188056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:04, skipping insertion in model container [2022-04-15 17:50:04,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:50:04" (1/1) ... [2022-04-15 17:50:04,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 17:50:04,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 17:50:04,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c[14184,14197] [2022-04-15 17:50:04,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:50:04,952 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 17:50:04,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c[14184,14197] [2022-04-15 17:50:04,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:50:04,995 INFO L208 MainTranslator]: Completed translation [2022-04-15 17:50:04,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:04 WrapperNode [2022-04-15 17:50:04,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 17:50:04,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 17:50:04,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 17:50:04,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 17:50:05,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:04" (1/1) ... [2022-04-15 17:50:05,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:04" (1/1) ... [2022-04-15 17:50:05,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:04" (1/1) ... [2022-04-15 17:50:05,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:04" (1/1) ... [2022-04-15 17:50:05,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:04" (1/1) ... [2022-04-15 17:50:05,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:04" (1/1) ... [2022-04-15 17:50:05,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:04" (1/1) ... [2022-04-15 17:50:05,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 17:50:05,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 17:50:05,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 17:50:05,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 17:50:05,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:04" (1/1) ... [2022-04-15 17:50:05,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:50:05,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:50:05,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 17:50:05,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 17:50:05,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 17:50:05,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 17:50:05,098 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 17:50:05,098 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 17:50:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 17:50:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 17:50:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 17:50:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 17:50:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 17:50:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 17:50:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 17:50:05,100 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 17:50:05,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 17:50:05,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 17:50:05,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 17:50:05,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 17:50:05,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 17:50:05,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 17:50:05,147 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 17:50:05,148 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 17:50:05,331 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 17:50:05,336 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 17:50:05,336 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 17:50:05,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:50:05 BoogieIcfgContainer [2022-04-15 17:50:05,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 17:50:05,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 17:50:05,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 17:50:05,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 17:50:05,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:50:04" (1/3) ... [2022-04-15 17:50:05,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6765aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:50:05, skipping insertion in model container [2022-04-15 17:50:05,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:50:04" (2/3) ... [2022-04-15 17:50:05,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6765aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:50:05, skipping insertion in model container [2022-04-15 17:50:05,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:50:05" (3/3) ... [2022-04-15 17:50:05,342 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2022-04-15 17:50:05,345 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 17:50:05,345 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 17:50:05,370 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 17:50:05,374 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 17:50:05,374 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 17:50:05,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 46 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 17:50:05,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 17:50:05,392 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:50:05,393 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:50:05,393 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:50:05,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:50:05,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1713790110, now seen corresponding path program 1 times [2022-04-15 17:50:05,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:05,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1974974579] [2022-04-15 17:50:05,408 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:50:05,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1713790110, now seen corresponding path program 2 times [2022-04-15 17:50:05,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:50:05,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329766707] [2022-04-15 17:50:05,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:50:05,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:50:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:05,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:50:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:05,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {54#true} is VALID [2022-04-15 17:50:05,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-15 17:50:05,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} #200#return; {54#true} is VALID [2022-04-15 17:50:05,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:50:05,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {54#true} is VALID [2022-04-15 17:50:05,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-15 17:50:05,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #200#return; {54#true} is VALID [2022-04-15 17:50:05,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret9 := main(); {54#true} is VALID [2022-04-15 17:50:05,573 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-15 17:50:05,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {59#(= main_~blastFlag~0 0)} assume !false; {59#(= main_~blastFlag~0 0)} is VALID [2022-04-15 17:50:05,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {59#(= main_~blastFlag~0 0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {55#false} is VALID [2022-04-15 17:50:05,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {55#false} assume !false; {55#false} is VALID [2022-04-15 17:50:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:50:05,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:50:05,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329766707] [2022-04-15 17:50:05,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329766707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:05,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:05,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:50:05,578 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:50:05,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1974974579] [2022-04-15 17:50:05,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1974974579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:05,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:05,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:50:05,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069896319] [2022-04-15 17:50:05,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:50:05,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 17:50:05,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:50:05,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:05,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:50:05,597 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:50:05,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:05,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:50:05,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:50:05,616 INFO L87 Difference]: Start difference. First operand has 51 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 46 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:05,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:05,958 INFO L93 Difference]: Finished difference Result 136 states and 224 transitions. [2022-04-15 17:50:05,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:50:05,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 17:50:05,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:50:05,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2022-04-15 17:50:05,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2022-04-15 17:50:05,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 224 transitions. [2022-04-15 17:50:06,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:50:06,173 INFO L225 Difference]: With dead ends: 136 [2022-04-15 17:50:06,173 INFO L226 Difference]: Without dead ends: 83 [2022-04-15 17:50:06,175 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:50:06,177 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 187 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:50:06,177 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 79 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:50:06,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-15 17:50:06,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-15 17:50:06,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:50:06,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:06,201 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:06,201 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:06,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:06,205 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2022-04-15 17:50:06,205 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-15 17:50:06,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:06,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:06,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-15 17:50:06,206 INFO L87 Difference]: Start difference. First operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-15 17:50:06,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:06,209 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2022-04-15 17:50:06,210 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-15 17:50:06,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:06,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:06,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:50:06,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:50:06,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2022-04-15 17:50:06,214 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 9 [2022-04-15 17:50:06,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:50:06,214 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2022-04-15 17:50:06,214 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:06,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 125 transitions. [2022-04-15 17:50:06,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:50:06,308 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-15 17:50:06,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 17:50:06,309 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:50:06,309 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:50:06,309 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 17:50:06,309 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:50:06,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:50:06,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1144534844, now seen corresponding path program 1 times [2022-04-15 17:50:06,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:06,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [469315582] [2022-04-15 17:50:07,159 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 17:50:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1581959862, now seen corresponding path program 1 times [2022-04-15 17:50:07,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:50:07,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500421389] [2022-04-15 17:50:07,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:50:07,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:50:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 17:50:07,181 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 17:50:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 17:50:07,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 17:50:07,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1144534844, now seen corresponding path program 2 times [2022-04-15 17:50:07,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:50:07,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119142267] [2022-04-15 17:50:07,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:50:07,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:50:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:07,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:50:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:07,246 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-15 17:50:07,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {669#true} assume true; {669#true} is VALID [2022-04-15 17:50:07,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {669#true} {669#true} #200#return; {669#true} is VALID [2022-04-15 17:50:07,247 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-15 17:50:07,247 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-15 17:50:07,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {669#true} assume true; {669#true} is VALID [2022-04-15 17:50:07,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {669#true} {669#true} #200#return; {669#true} is VALID [2022-04-15 17:50:07,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {669#true} call #t~ret9 := main(); {669#true} is VALID [2022-04-15 17:50:07,248 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-15 17:50:07,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {669#true} assume !false; {669#true} is VALID [2022-04-15 17:50:07,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {669#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {669#true} is VALID [2022-04-15 17:50:07,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {669#true} assume 8466 == ~s__state~0; {669#true} is VALID [2022-04-15 17:50:07,249 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-15 17:50:07,250 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-15 17:50:07,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {674#(= (+ (- 1) main_~blastFlag~0) 0)} assume !false; {674#(= (+ (- 1) main_~blastFlag~0) 0)} is VALID [2022-04-15 17:50:07,250 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-15 17:50:07,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {670#false} assume !false; {670#false} is VALID [2022-04-15 17:50:07,251 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-15 17:50:07,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:50:07,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119142267] [2022-04-15 17:50:07,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119142267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:07,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:07,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:50:07,252 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:50:07,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [469315582] [2022-04-15 17:50:07,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [469315582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:07,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:07,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:50:07,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926235192] [2022-04-15 17:50:07,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:50:07,253 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-15 17:50:07,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:50:07,253 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-15 17:50:07,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:50:07,263 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:50:07,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:07,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:50:07,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:50:07,264 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-15 17:50:07,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:07,460 INFO L93 Difference]: Finished difference Result 160 states and 250 transitions. [2022-04-15 17:50:07,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:50:07,461 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-15 17:50:07,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:50:07,461 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-15 17:50:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-15 17:50:07,463 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-15 17:50:07,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-15 17:50:07,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 195 transitions. [2022-04-15 17:50:07,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:50:07,596 INFO L225 Difference]: With dead ends: 160 [2022-04-15 17:50:07,597 INFO L226 Difference]: Without dead ends: 120 [2022-04-15 17:50:07,597 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:50:07,598 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:50:07,598 INFO L914 BasicCegarLoop]: 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-15 17:50:07,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-15 17:50:07,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-15 17:50:07,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:50:07,609 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-15 17:50:07,609 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-15 17:50:07,609 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-15 17:50:07,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:07,612 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions. [2022-04-15 17:50:07,612 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2022-04-15 17:50:07,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:07,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:07,614 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-15 17:50:07,614 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-15 17:50:07,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:07,621 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions. [2022-04-15 17:50:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2022-04-15 17:50:07,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:07,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:07,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:50:07,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:50:07,627 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-15 17:50:07,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 179 transitions. [2022-04-15 17:50:07,632 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 179 transitions. Word has length 14 [2022-04-15 17:50:07,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:50:07,633 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 179 transitions. [2022-04-15 17:50:07,633 INFO L479 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-15 17:50:07,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 179 transitions. [2022-04-15 17:50:07,777 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-15 17:50:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2022-04-15 17:50:07,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 17:50:07,777 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:50:07,777 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:50:07,778 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2022-04-15 17:50:07,778 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:50:07,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:50:07,778 INFO L85 PathProgramCache]: Analyzing trace with hash -974235404, now seen corresponding path program 1 times [2022-04-15 17:50:07,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:07,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1237423804] [2022-04-15 17:50:07,985 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException [2022-04-15 17:50:07,985 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 17:50:07,985 INFO L85 PathProgramCache]: Analyzing trace with hash -974235404, now seen corresponding path program 2 times [2022-04-15 17:50:07,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:50:07,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445057848] [2022-04-15 17:50:07,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:50:07,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:50:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:08,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:50:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:08,021 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-15 17:50:08,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {1481#true} assume true; {1481#true} is VALID [2022-04-15 17:50:08,021 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1481#true} {1481#true} #200#return; {1481#true} is VALID [2022-04-15 17:50:08,022 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-15 17:50:08,022 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-15 17:50:08,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {1481#true} assume true; {1481#true} is VALID [2022-04-15 17:50:08,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1481#true} {1481#true} #200#return; {1481#true} is VALID [2022-04-15 17:50:08,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {1481#true} call #t~ret9 := main(); {1481#true} is VALID [2022-04-15 17:50:08,022 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-15 17:50:08,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {1481#true} assume !false; {1481#true} is VALID [2022-04-15 17:50:08,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {1481#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1481#true} is VALID [2022-04-15 17:50:08,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {1481#true} assume 8466 == ~s__state~0; {1481#true} is VALID [2022-04-15 17:50:08,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {1481#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {1481#true} is VALID [2022-04-15 17:50:08,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {1481#true} ~s__state~0 := 8496; {1481#true} is VALID [2022-04-15 17:50:08,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {1481#true} assume !false; {1481#true} is VALID [2022-04-15 17:50:08,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {1481#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1481#true} is VALID [2022-04-15 17:50:08,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {1481#true} assume !(8466 == ~s__state~0); {1481#true} is VALID [2022-04-15 17:50:08,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {1481#true} assume 8496 == ~s__state~0; {1481#true} is VALID [2022-04-15 17:50:08,024 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-15 17:50:08,024 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-15 17:50:08,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {1486#(= (+ (- 2) main_~blastFlag~0) 0)} assume !false; {1486#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-15 17:50:08,025 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-15 17:50:08,025 INFO L290 TraceCheckUtils]: 19: Hoare triple {1482#false} assume !false; {1482#false} is VALID [2022-04-15 17:50:08,025 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-15 17:50:08,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:50:08,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445057848] [2022-04-15 17:50:08,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445057848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:08,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:08,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:50:08,026 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:50:08,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1237423804] [2022-04-15 17:50:08,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1237423804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:08,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:08,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:50:08,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358112486] [2022-04-15 17:50:08,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:50:08,027 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-15 17:50:08,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:50:08,027 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-15 17:50:08,050 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-15 17:50:08,050 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:50:08,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:08,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:50:08,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:50:08,051 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-15 17:50:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:08,208 INFO L93 Difference]: Finished difference Result 234 states and 359 transitions. [2022-04-15 17:50:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:50:08,209 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-15 17:50:08,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:50:08,209 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-15 17:50:08,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-15 17:50:08,211 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-15 17:50:08,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-15 17:50:08,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 196 transitions. [2022-04-15 17:50:08,329 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-15 17:50:08,332 INFO L225 Difference]: With dead ends: 234 [2022-04-15 17:50:08,332 INFO L226 Difference]: Without dead ends: 157 [2022-04-15 17:50:08,333 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:50:08,335 INFO L913 BasicCegarLoop]: 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-15 17:50:08,343 INFO L914 BasicCegarLoop]: 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-15 17:50:08,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-15 17:50:08,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-04-15 17:50:08,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:50:08,356 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-15 17:50:08,356 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-15 17:50:08,356 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-15 17:50:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:08,360 INFO L93 Difference]: Finished difference Result 157 states and 234 transitions. [2022-04-15 17:50:08,360 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 234 transitions. [2022-04-15 17:50:08,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:08,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:08,361 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-15 17:50:08,361 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-15 17:50:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:08,364 INFO L93 Difference]: Finished difference Result 157 states and 234 transitions. [2022-04-15 17:50:08,364 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 234 transitions. [2022-04-15 17:50:08,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:08,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:08,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:50:08,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:50:08,365 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-15 17:50:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 234 transitions. [2022-04-15 17:50:08,368 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 234 transitions. Word has length 20 [2022-04-15 17:50:08,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:50:08,369 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 234 transitions. [2022-04-15 17:50:08,369 INFO L479 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-15 17:50:08,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 234 transitions. [2022-04-15 17:50:08,544 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-15 17:50:08,544 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 234 transitions. [2022-04-15 17:50:08,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 17:50:08,545 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:50:08,545 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:50:08,545 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 17:50:08,545 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:50:08,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:50:08,545 INFO L85 PathProgramCache]: Analyzing trace with hash -674137767, now seen corresponding path program 1 times [2022-04-15 17:50:08,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:08,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [431041607] [2022-04-15 17:50:09,092 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException [2022-04-15 17:50:09,092 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 17:50:09,092 INFO L85 PathProgramCache]: Analyzing trace with hash -674137767, now seen corresponding path program 2 times [2022-04-15 17:50:09,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:50:09,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910414228] [2022-04-15 17:50:09,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:50:09,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:50:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:09,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:50:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:09,155 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-15 17:50:09,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-15 17:50:09,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2589#true} {2589#true} #200#return; {2589#true} is VALID [2022-04-15 17:50:09,156 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-15 17:50:09,156 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-15 17:50:09,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-15 17:50:09,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2589#true} {2589#true} #200#return; {2589#true} is VALID [2022-04-15 17:50:09,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {2589#true} call #t~ret9 := main(); {2589#true} is VALID [2022-04-15 17:50:09,156 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-15 17:50:09,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {2589#true} assume !false; {2589#true} is VALID [2022-04-15 17:50:09,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {2589#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2589#true} is VALID [2022-04-15 17:50:09,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {2589#true} assume 8466 == ~s__state~0; {2589#true} is VALID [2022-04-15 17:50:09,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {2589#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2589#true} is VALID [2022-04-15 17:50:09,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {2589#true} ~s__state~0 := 8496; {2589#true} is VALID [2022-04-15 17:50:09,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {2589#true} assume !false; {2589#true} is VALID [2022-04-15 17:50:09,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {2589#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2589#true} is VALID [2022-04-15 17:50:09,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {2589#true} assume !(8466 == ~s__state~0); {2589#true} is VALID [2022-04-15 17:50:09,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {2589#true} assume 8496 == ~s__state~0; {2589#true} is VALID [2022-04-15 17:50:09,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {2589#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {2589#true} is VALID [2022-04-15 17:50:09,158 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-15 17:50:09,164 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-15 17:50:09,165 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-15 17:50:09,165 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-15 17:50:09,165 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-15 17:50:09,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {2594#(= (+ (- 8512) main_~s__state~0) 0)} assume !(8512 == ~s__state~0); {2590#false} is VALID [2022-04-15 17:50:09,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {2590#false} assume !(8528 == ~s__state~0); {2590#false} is VALID [2022-04-15 17:50:09,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {2590#false} assume !(8544 == ~s__state~0); {2590#false} is VALID [2022-04-15 17:50:09,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {2590#false} assume !(8560 == ~s__state~0); {2590#false} is VALID [2022-04-15 17:50:09,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {2590#false} assume !(8576 == ~s__state~0); {2590#false} is VALID [2022-04-15 17:50:09,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {2590#false} assume !(8592 == ~s__state~0); {2590#false} is VALID [2022-04-15 17:50:09,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {2590#false} assume !(8608 == ~s__state~0); {2590#false} is VALID [2022-04-15 17:50:09,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {2590#false} assume !(8640 == ~s__state~0); {2590#false} is VALID [2022-04-15 17:50:09,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {2590#false} assume 8656 == ~s__state~0; {2590#false} is VALID [2022-04-15 17:50:09,167 INFO L290 TraceCheckUtils]: 30: Hoare triple {2590#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {2590#false} is VALID [2022-04-15 17:50:09,167 INFO L290 TraceCheckUtils]: 31: Hoare triple {2590#false} ~s__state~0 := 8672; {2590#false} is VALID [2022-04-15 17:50:09,167 INFO L290 TraceCheckUtils]: 32: Hoare triple {2590#false} assume !false; {2590#false} is VALID [2022-04-15 17:50:09,167 INFO L290 TraceCheckUtils]: 33: Hoare triple {2590#false} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {2590#false} is VALID [2022-04-15 17:50:09,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {2590#false} assume !false; {2590#false} is VALID [2022-04-15 17:50:09,168 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-15 17:50:09,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:50:09,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910414228] [2022-04-15 17:50:09,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910414228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:09,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:09,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:50:09,168 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:50:09,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [431041607] [2022-04-15 17:50:09,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [431041607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:09,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:09,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:50:09,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355888311] [2022-04-15 17:50:09,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:50:09,169 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-15 17:50:09,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:50:09,169 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-15 17:50:09,187 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-15 17:50:09,187 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:50:09,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:09,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:50:09,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:50:09,188 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-15 17:50:09,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:09,361 INFO L93 Difference]: Finished difference Result 325 states and 488 transitions. [2022-04-15 17:50:09,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:50:09,362 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-15 17:50:09,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:50:09,362 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-15 17:50:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-15 17:50:09,363 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-15 17:50:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-15 17:50:09,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 144 transitions. [2022-04-15 17:50:09,452 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-15 17:50:09,456 INFO L225 Difference]: With dead ends: 325 [2022-04-15 17:50:09,456 INFO L226 Difference]: Without dead ends: 174 [2022-04-15 17:50:09,457 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:50:09,457 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:50:09,458 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 79 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:50:09,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-15 17:50:09,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2022-04-15 17:50:09,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:50:09,470 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-15 17:50:09,470 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-15 17:50:09,471 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-15 17:50:09,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:09,474 INFO L93 Difference]: Finished difference Result 174 states and 251 transitions. [2022-04-15 17:50:09,474 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 251 transitions. [2022-04-15 17:50:09,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:09,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:09,475 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-15 17:50:09,475 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-15 17:50:09,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:09,479 INFO L93 Difference]: Finished difference Result 174 states and 251 transitions. [2022-04-15 17:50:09,479 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 251 transitions. [2022-04-15 17:50:09,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:09,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:09,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:50:09,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:50:09,480 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-15 17:50:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 250 transitions. [2022-04-15 17:50:09,484 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 250 transitions. Word has length 35 [2022-04-15 17:50:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:50:09,484 INFO L478 AbstractCegarLoop]: Abstraction has 172 states and 250 transitions. [2022-04-15 17:50:09,484 INFO L479 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-15 17:50:09,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 172 states and 250 transitions. [2022-04-15 17:50:09,663 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-15 17:50:09,664 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 250 transitions. [2022-04-15 17:50:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 17:50:09,664 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:50:09,664 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:50:09,664 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 17:50:09,665 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:50:09,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:50:09,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1014805975, now seen corresponding path program 1 times [2022-04-15 17:50:09,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:09,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1762481397] [2022-04-15 17:50:09,815 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException [2022-04-15 17:50:09,815 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 17:50:09,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1014805975, now seen corresponding path program 2 times [2022-04-15 17:50:09,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:50:09,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028757323] [2022-04-15 17:50:09,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:50:09,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:50:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:09,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:50:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:09,867 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-15 17:50:09,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {3943#true} assume true; {3943#true} is VALID [2022-04-15 17:50:09,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3943#true} {3943#true} #200#return; {3943#true} is VALID [2022-04-15 17:50:09,868 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-15 17:50:09,868 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-15 17:50:09,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {3943#true} assume true; {3943#true} is VALID [2022-04-15 17:50:09,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3943#true} {3943#true} #200#return; {3943#true} is VALID [2022-04-15 17:50:09,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {3943#true} call #t~ret9 := main(); {3943#true} is VALID [2022-04-15 17:50:09,869 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-15 17:50:09,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {3943#true} assume !false; {3943#true} is VALID [2022-04-15 17:50:09,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {3943#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3943#true} is VALID [2022-04-15 17:50:09,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {3943#true} assume 8466 == ~s__state~0; {3943#true} is VALID [2022-04-15 17:50:09,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {3943#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {3943#true} is VALID [2022-04-15 17:50:09,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {3943#true} ~s__state~0 := 8496; {3943#true} is VALID [2022-04-15 17:50:09,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {3943#true} assume !false; {3943#true} is VALID [2022-04-15 17:50:09,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {3943#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3943#true} is VALID [2022-04-15 17:50:09,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {3943#true} assume !(8466 == ~s__state~0); {3943#true} is VALID [2022-04-15 17:50:09,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {3943#true} assume 8496 == ~s__state~0; {3943#true} is VALID [2022-04-15 17:50:09,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {3943#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {3943#true} is VALID [2022-04-15 17:50:09,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {3943#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {3943#true} is VALID [2022-04-15 17:50:09,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {3943#true} assume !false; {3943#true} is VALID [2022-04-15 17:50:09,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {3943#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3943#true} is VALID [2022-04-15 17:50:09,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {3943#true} assume !(8466 == ~s__state~0); {3943#true} is VALID [2022-04-15 17:50:09,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {3943#true} assume !(8496 == ~s__state~0); {3943#true} is VALID [2022-04-15 17:50:09,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {3943#true} assume !(8512 == ~s__state~0); {3943#true} is VALID [2022-04-15 17:50:09,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {3943#true} assume !(8528 == ~s__state~0); {3943#true} is VALID [2022-04-15 17:50:09,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {3943#true} assume !(8544 == ~s__state~0); {3943#true} is VALID [2022-04-15 17:50:09,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {3943#true} assume !(8560 == ~s__state~0); {3943#true} is VALID [2022-04-15 17:50:09,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {3943#true} assume !(8576 == ~s__state~0); {3943#true} is VALID [2022-04-15 17:50:09,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {3943#true} assume !(8592 == ~s__state~0); {3943#true} is VALID [2022-04-15 17:50:09,880 INFO L290 TraceCheckUtils]: 27: Hoare triple {3943#true} assume !(8608 == ~s__state~0); {3943#true} is VALID [2022-04-15 17:50:09,880 INFO L290 TraceCheckUtils]: 28: Hoare triple {3943#true} assume !(8640 == ~s__state~0); {3943#true} is VALID [2022-04-15 17:50:09,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {3943#true} assume 8656 == ~s__state~0; {3943#true} is VALID [2022-04-15 17:50:09,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {3943#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {3943#true} is VALID [2022-04-15 17:50:09,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {3943#true} ~s__state~0 := 8672; {3948#(<= 8672 main_~s__state~0)} is VALID [2022-04-15 17:50:09,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {3948#(<= 8672 main_~s__state~0)} assume !false; {3948#(<= 8672 main_~s__state~0)} is VALID [2022-04-15 17:50:09,893 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-15 17:50:09,893 INFO L290 TraceCheckUtils]: 34: Hoare triple {3944#false} assume !false; {3944#false} is VALID [2022-04-15 17:50:09,894 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-15 17:50:09,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:50:09,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028757323] [2022-04-15 17:50:09,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028757323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:09,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:09,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:50:09,894 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:50:09,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1762481397] [2022-04-15 17:50:09,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1762481397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:09,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:09,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:50:09,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626550647] [2022-04-15 17:50:09,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:50:09,895 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-15 17:50:09,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:50:09,895 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-15 17:50:09,913 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-15 17:50:09,913 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:50:09,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:09,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:50:09,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:50:09,914 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-15 17:50:10,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:10,141 INFO L93 Difference]: Finished difference Result 382 states and 571 transitions. [2022-04-15 17:50:10,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:50:10,142 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-15 17:50:10,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:50:10,142 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-15 17:50:10,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2022-04-15 17:50:10,144 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-15 17:50:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2022-04-15 17:50:10,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 161 transitions. [2022-04-15 17:50:10,254 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-15 17:50:10,258 INFO L225 Difference]: With dead ends: 382 [2022-04-15 17:50:10,258 INFO L226 Difference]: Without dead ends: 216 [2022-04-15 17:50:10,259 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:50:10,259 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 83 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:50:10,260 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 78 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:50:10,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-04-15 17:50:10,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2022-04-15 17:50:10,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:50:10,314 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-15 17:50:10,314 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-15 17:50:10,315 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-15 17:50:10,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:10,319 INFO L93 Difference]: Finished difference Result 216 states and 293 transitions. [2022-04-15 17:50:10,319 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 293 transitions. [2022-04-15 17:50:10,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:10,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:10,320 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-15 17:50:10,321 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-15 17:50:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:10,325 INFO L93 Difference]: Finished difference Result 216 states and 293 transitions. [2022-04-15 17:50:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 293 transitions. [2022-04-15 17:50:10,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:10,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:10,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:50:10,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:50:10,326 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-15 17:50:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 289 transitions. [2022-04-15 17:50:10,331 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 289 transitions. Word has length 35 [2022-04-15 17:50:10,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:50:10,331 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 289 transitions. [2022-04-15 17:50:10,331 INFO L479 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-15 17:50:10,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 289 transitions. [2022-04-15 17:50:10,543 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-15 17:50:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 289 transitions. [2022-04-15 17:50:10,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 17:50:10,544 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:50:10,544 INFO L499 BasicCegarLoop]: 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-15 17:50:10,544 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 17:50:10,545 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:50:10,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:50:10,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1542489334, now seen corresponding path program 1 times [2022-04-15 17:50:10,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:10,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [244806210] [2022-04-15 17:50:10,790 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException [2022-04-15 17:50:10,790 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 17:50:10,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1542489334, now seen corresponding path program 2 times [2022-04-15 17:50:10,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:50:10,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706279013] [2022-04-15 17:50:10,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:50:10,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:50:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:10,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:50:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:10,883 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-15 17:50:10,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {5573#true} assume true; {5573#true} is VALID [2022-04-15 17:50:10,883 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5573#true} {5573#true} #200#return; {5573#true} is VALID [2022-04-15 17:50:10,884 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-15 17:50:10,885 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-15 17:50:10,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {5573#true} assume true; {5573#true} is VALID [2022-04-15 17:50:10,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5573#true} {5573#true} #200#return; {5573#true} is VALID [2022-04-15 17:50:10,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {5573#true} call #t~ret9 := main(); {5573#true} is VALID [2022-04-15 17:50:10,885 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-15 17:50:10,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {5573#true} assume !false; {5573#true} is VALID [2022-04-15 17:50:10,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {5573#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {5573#true} is VALID [2022-04-15 17:50:10,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {5573#true} assume 8466 == ~s__state~0; {5573#true} is VALID [2022-04-15 17:50:10,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {5573#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {5573#true} is VALID [2022-04-15 17:50:10,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {5573#true} ~s__state~0 := 8496; {5573#true} is VALID [2022-04-15 17:50:10,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {5573#true} assume !false; {5573#true} is VALID [2022-04-15 17:50:10,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {5573#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {5573#true} is VALID [2022-04-15 17:50:10,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {5573#true} assume !(8466 == ~s__state~0); {5573#true} is VALID [2022-04-15 17:50:10,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {5573#true} assume 8496 == ~s__state~0; {5573#true} is VALID [2022-04-15 17:50:10,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {5573#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {5573#true} is VALID [2022-04-15 17:50:10,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {5573#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {5573#true} is VALID [2022-04-15 17:50:10,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {5573#true} assume !false; {5573#true} is VALID [2022-04-15 17:50:10,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {5573#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {5573#true} is VALID [2022-04-15 17:50:10,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {5573#true} assume !(8466 == ~s__state~0); {5573#true} is VALID [2022-04-15 17:50:10,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {5573#true} assume !(8496 == ~s__state~0); {5573#true} is VALID [2022-04-15 17:50:10,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {5573#true} assume !(8512 == ~s__state~0); {5573#true} is VALID [2022-04-15 17:50:10,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {5573#true} assume !(8528 == ~s__state~0); {5573#true} is VALID [2022-04-15 17:50:10,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {5573#true} assume !(8544 == ~s__state~0); {5573#true} is VALID [2022-04-15 17:50:10,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {5573#true} assume !(8560 == ~s__state~0); {5573#true} is VALID [2022-04-15 17:50:10,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {5573#true} assume !(8576 == ~s__state~0); {5573#true} is VALID [2022-04-15 17:50:10,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {5573#true} assume !(8592 == ~s__state~0); {5573#true} is VALID [2022-04-15 17:50:10,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {5573#true} assume !(8608 == ~s__state~0); {5573#true} is VALID [2022-04-15 17:50:10,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {5573#true} assume !(8640 == ~s__state~0); {5573#true} is VALID [2022-04-15 17:50:10,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {5573#true} assume 8656 == ~s__state~0; {5573#true} is VALID [2022-04-15 17:50:10,891 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-15 17:50:10,891 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-15 17:50:10,892 INFO L290 TraceCheckUtils]: 32: Hoare triple {5578#(= (+ (- 3) main_~blastFlag~0) 0)} assume !false; {5578#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-15 17:50:10,892 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-15 17:50:10,892 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-15 17:50:10,892 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-15 17:50:10,893 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-15 17:50:10,893 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-15 17:50:10,893 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-15 17:50:10,894 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-15 17:50:10,894 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-15 17:50:10,895 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-15 17:50:10,895 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-15 17:50:10,895 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-15 17:50:10,896 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-15 17:50:10,896 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-15 17:50:10,896 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-15 17:50:10,897 INFO L290 TraceCheckUtils]: 47: Hoare triple {5578#(= (+ (- 3) main_~blastFlag~0) 0)} assume 5 == ~blastFlag~0; {5574#false} is VALID [2022-04-15 17:50:10,897 INFO L290 TraceCheckUtils]: 48: Hoare triple {5574#false} assume !false; {5574#false} is VALID [2022-04-15 17:50:10,898 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-15 17:50:10,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:50:10,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706279013] [2022-04-15 17:50:10,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706279013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:10,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:10,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:50:10,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:50:10,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [244806210] [2022-04-15 17:50:10,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [244806210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:10,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:10,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:50:10,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598107509] [2022-04-15 17:50:10,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:50:10,900 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-15 17:50:10,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:50:10,901 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-15 17:50:10,935 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-15 17:50:10,936 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:50:10,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:10,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:50:10,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:50:10,937 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-15 17:50:11,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:11,195 INFO L93 Difference]: Finished difference Result 418 states and 581 transitions. [2022-04-15 17:50:11,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:50:11,195 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-15 17:50:11,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:50:11,195 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-15 17:50:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2022-04-15 17:50:11,197 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-15 17:50:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2022-04-15 17:50:11,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 197 transitions. [2022-04-15 17:50:11,323 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-15 17:50:11,328 INFO L225 Difference]: With dead ends: 418 [2022-04-15 17:50:11,328 INFO L226 Difference]: Without dead ends: 268 [2022-04-15 17:50:11,329 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:50:11,330 INFO L913 BasicCegarLoop]: 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:50:11,330 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 123 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:50:11,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-04-15 17:50:11,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2022-04-15 17:50:11,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:50:11,389 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-15 17:50:11,389 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-15 17:50:11,390 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-15 17:50:11,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:11,395 INFO L93 Difference]: Finished difference Result 268 states and 365 transitions. [2022-04-15 17:50:11,395 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 365 transitions. [2022-04-15 17:50:11,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:11,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:11,396 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-15 17:50:11,397 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-15 17:50:11,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:11,402 INFO L93 Difference]: Finished difference Result 268 states and 365 transitions. [2022-04-15 17:50:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 365 transitions. [2022-04-15 17:50:11,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:11,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:11,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:50:11,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:50:11,403 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-15 17:50:11,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 364 transitions. [2022-04-15 17:50:11,409 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 364 transitions. Word has length 49 [2022-04-15 17:50:11,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:50:11,410 INFO L478 AbstractCegarLoop]: Abstraction has 266 states and 364 transitions. [2022-04-15 17:50:11,410 INFO L479 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-15 17:50:11,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 266 states and 364 transitions. [2022-04-15 17:50:11,678 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-15 17:50:11,678 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 364 transitions. [2022-04-15 17:50:11,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 17:50:11,679 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:50:11,679 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:50:11,679 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 17:50:11,679 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:50:11,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:50:11,680 INFO L85 PathProgramCache]: Analyzing trace with hash 446239409, now seen corresponding path program 1 times [2022-04-15 17:50:11,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:11,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1959689478] [2022-04-15 17:50:11,871 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:431) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.pushout(QvasrAbstractionJoin.java:181) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.join(QvasrAbstractionJoin.java:116) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrSummarizer.summarizeLoop(QvasrSummarizer.java:130) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrLoopSummarization.getQvasrAcceleration(QvasrLoopSummarization.java:87) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorQvasr.accelerateLoop(AcceleratorQvasr.java:91) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:246) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 17:50:11,875 INFO L158 Benchmark]: Toolchain (without parser) took 7159.34ms. Allocated memory was 211.8MB in the beginning and 389.0MB in the end (delta: 177.2MB). Free memory was 152.6MB in the beginning and 237.3MB in the end (delta: -84.7MB). Peak memory consumption was 92.5MB. Max. memory is 8.0GB. [2022-04-15 17:50:11,875 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 211.8MB. Free memory is still 169.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 17:50:11,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.19ms. Allocated memory was 211.8MB in the beginning and 324.0MB in the end (delta: 112.2MB). Free memory was 152.3MB in the beginning and 296.9MB in the end (delta: -144.5MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2022-04-15 17:50:11,875 INFO L158 Benchmark]: Boogie Preprocessor took 45.72ms. Allocated memory is still 324.0MB. Free memory was 296.9MB in the beginning and 295.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 17:50:11,875 INFO L158 Benchmark]: RCFGBuilder took 294.81ms. Allocated memory is still 324.0MB. Free memory was 295.2MB in the beginning and 281.0MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 17:50:11,876 INFO L158 Benchmark]: TraceAbstraction took 6534.81ms. Allocated memory was 324.0MB in the beginning and 389.0MB in the end (delta: 65.0MB). Free memory was 280.5MB in the beginning and 237.3MB in the end (delta: 43.2MB). Peak memory consumption was 107.5MB. Max. memory is 8.0GB. [2022-04-15 17:50:11,877 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.15ms. Allocated memory is still 211.8MB. Free memory is still 169.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 280.19ms. Allocated memory was 211.8MB in the beginning and 324.0MB in the end (delta: 112.2MB). Free memory was 152.3MB in the beginning and 296.9MB in the end (delta: -144.5MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.72ms. Allocated memory is still 324.0MB. Free memory was 296.9MB in the beginning and 295.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 294.81ms. Allocated memory is still 324.0MB. Free memory was 295.2MB in the beginning and 281.0MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6534.81ms. Allocated memory was 324.0MB in the beginning and 389.0MB in the end (delta: 65.0MB). Free memory was 280.5MB in the beginning and 237.3MB in the end (delta: 43.2MB). Peak memory consumption was 107.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0: de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:431) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 17:50:11,903 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...