/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-34549b5 [2022-04-08 14:51:35,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:51:35,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:51:35,727 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:51:35,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:51:35,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:51:35,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:51:35,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:51:35,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:51:35,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:51:35,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:51:35,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:51:35,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:51:35,744 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:51:35,745 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:51:35,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:51:35,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:51:35,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:51:35,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:51:35,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:51:35,757 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:51:35,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:51:35,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:51:35,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:51:35,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:51:35,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:51:35,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:51:35,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:51:35,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:51:35,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:51:35,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:51:35,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:51:35,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:51:35,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:51:35,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:51:35,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:51:35,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:51:35,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:51:35,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:51:35,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:51:35,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:51:35,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:51:35,776 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:51:35,786 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:51:35,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:51:35,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:51:35,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:51:35,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:51:35,788 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:51:35,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:51:35,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:51:35,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:51:35,789 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:51:35,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:51:35,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:51:35,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:51:35,790 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:51:35,790 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:51:35,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:51:35,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:51:35,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:51:35,790 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:51:35,791 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:51:35,791 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:51:35,791 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:51:35,791 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-08 14:51:36,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:51:36,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:51:36,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:51:36,053 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:51:36,054 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:51:36,055 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-08 14:51:36,111 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de295010/1c4bc66c922c4afcb01f0daeb8e98be3/FLAGf8a9f21cd [2022-04-08 14:51:36,546 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:51:36,546 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c [2022-04-08 14:51:36,555 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de295010/1c4bc66c922c4afcb01f0daeb8e98be3/FLAGf8a9f21cd [2022-04-08 14:51:36,573 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de295010/1c4bc66c922c4afcb01f0daeb8e98be3 [2022-04-08 14:51:36,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:51:36,576 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:51:36,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:51:36,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:51:36,582 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:51:36,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:51:36" (1/1) ... [2022-04-08 14:51:36,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f52e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:36, skipping insertion in model container [2022-04-08 14:51:36,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:51:36" (1/1) ... [2022-04-08 14:51:36,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:51:36,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:51:36,824 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-08 14:51:36,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:51:36,843 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:51:36,880 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-08 14:51:36,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:51:36,894 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:51:36,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:36 WrapperNode [2022-04-08 14:51:36,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:51:36,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:51:36,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:51:36,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:51:36,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:36" (1/1) ... [2022-04-08 14:51:36,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:36" (1/1) ... [2022-04-08 14:51:36,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:36" (1/1) ... [2022-04-08 14:51:36,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:36" (1/1) ... [2022-04-08 14:51:36,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:36" (1/1) ... [2022-04-08 14:51:36,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:36" (1/1) ... [2022-04-08 14:51:36,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:36" (1/1) ... [2022-04-08 14:51:36,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:51:36,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:51:36,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:51:36,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:51:36,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:36" (1/1) ... [2022-04-08 14:51:36,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:51:36,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:51:36,964 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-08 14:51:36,979 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-08 14:51:37,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:51:37,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:51:37,012 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:51:37,012 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:51:37,012 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:51:37,013 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:51:37,013 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:51:37,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:51:37,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 14:51:37,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 14:51:37,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 14:51:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:51:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:51:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:51:37,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:51:37,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:51:37,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:51:37,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:51:37,069 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:51:37,070 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:51:37,292 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:51:37,298 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:51:37,298 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:51:37,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:51:37 BoogieIcfgContainer [2022-04-08 14:51:37,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:51:37,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:51:37,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:51:37,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:51:37,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:51:36" (1/3) ... [2022-04-08 14:51:37,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634d104c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:51:37, skipping insertion in model container [2022-04-08 14:51:37,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:36" (2/3) ... [2022-04-08 14:51:37,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634d104c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:51:37, skipping insertion in model container [2022-04-08 14:51:37,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:51:37" (3/3) ... [2022-04-08 14:51:37,316 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2022-04-08 14:51:37,320 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:51:37,320 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:51:37,365 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:51:37,372 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-08 14:51:37,372 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:51:37,396 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-08 14:51:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-08 14:51:37,401 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:51:37,401 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:51:37,402 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:51:37,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:51:37,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1713790110, now seen corresponding path program 1 times [2022-04-08 14:51:37,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:37,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [661936135] [2022-04-08 14:51:37,422 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:51:37,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1713790110, now seen corresponding path program 2 times [2022-04-08 14:51:37,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:51:37,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778467147] [2022-04-08 14:51:37,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:51:37,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:51:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:37,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:51:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:37,660 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-08 14:51:37,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-08 14:51:37,661 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} #200#return; {54#true} is VALID [2022-04-08 14:51:37,664 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-08 14:51:37,664 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-08 14:51:37,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-08 14:51:37,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #200#return; {54#true} is VALID [2022-04-08 14:51:37,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret9 := main(); {54#true} is VALID [2022-04-08 14:51:37,665 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-08 14:51:37,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {59#(= main_~blastFlag~0 0)} assume !false; {59#(= main_~blastFlag~0 0)} is VALID [2022-04-08 14:51:37,667 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-08 14:51:37,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {55#false} assume !false; {55#false} is VALID [2022-04-08 14:51:37,667 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-08 14:51:37,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:51:37,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778467147] [2022-04-08 14:51:37,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778467147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:37,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:37,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:37,671 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:51:37,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [661936135] [2022-04-08 14:51:37,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [661936135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:37,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:37,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:37,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450146423] [2022-04-08 14:51:37,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:51:37,677 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-08 14:51:37,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:51:37,681 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-08 14:51:37,706 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-08 14:51:37,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:51:37,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:37,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:51:37,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:51:37,726 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-08 14:51:38,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:38,165 INFO L93 Difference]: Finished difference Result 136 states and 224 transitions. [2022-04-08 14:51:38,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:51:38,166 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-08 14:51:38,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:51:38,167 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-08 14:51:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2022-04-08 14:51:38,183 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-08 14:51:38,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2022-04-08 14:51:38,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 224 transitions. [2022-04-08 14:51:38,407 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-08 14:51:38,419 INFO L225 Difference]: With dead ends: 136 [2022-04-08 14:51:38,419 INFO L226 Difference]: Without dead ends: 83 [2022-04-08 14:51:38,423 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-08 14:51:38,428 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-08 14:51:38,430 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-08 14:51:38,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-08 14:51:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-08 14:51:38,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:51:38,474 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-08 14:51:38,475 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-08 14:51:38,476 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-08 14:51:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:38,481 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2022-04-08 14:51:38,481 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-08 14:51:38,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:38,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:38,483 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-08 14:51:38,484 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-08 14:51:38,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:38,489 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2022-04-08 14:51:38,489 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-08 14:51:38,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:38,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:38,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:51:38,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:51:38,491 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-08 14:51:38,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2022-04-08 14:51:38,496 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 9 [2022-04-08 14:51:38,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:51:38,497 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2022-04-08 14:51:38,497 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-08 14:51:38,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 125 transitions. [2022-04-08 14:51:38,631 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-08 14:51:38,631 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-08 14:51:38,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 14:51:38,633 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:51:38,634 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:51:38,634 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:51:38,634 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:51:38,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:51:38,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1144534844, now seen corresponding path program 1 times [2022-04-08 14:51:38,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:38,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1304337430] [2022-04-08 14:51:38,654 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:51:38,654 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:51:38,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1144534844, now seen corresponding path program 2 times [2022-04-08 14:51:38,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:51:38,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263284361] [2022-04-08 14:51:38,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:51:38,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:51:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:38,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:51:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:38,768 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-08 14:51:38,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {669#true} assume true; {669#true} is VALID [2022-04-08 14:51:38,768 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {669#true} {669#true} #200#return; {669#true} is VALID [2022-04-08 14:51:38,769 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-08 14:51:38,769 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-08 14:51:38,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {669#true} assume true; {669#true} is VALID [2022-04-08 14:51:38,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {669#true} {669#true} #200#return; {669#true} is VALID [2022-04-08 14:51:38,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {669#true} call #t~ret9 := main(); {669#true} is VALID [2022-04-08 14:51:38,770 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-08 14:51:38,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {669#true} assume !false; {669#true} is VALID [2022-04-08 14:51:38,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {669#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {669#true} is VALID [2022-04-08 14:51:38,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {669#true} assume 8466 == ~s__state~0; {669#true} is VALID [2022-04-08 14:51:38,771 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-08 14:51:38,771 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-08 14:51:38,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {674#(= (+ (- 1) main_~blastFlag~0) 0)} assume !false; {674#(= (+ (- 1) main_~blastFlag~0) 0)} is VALID [2022-04-08 14:51:38,808 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-08 14:51:38,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {670#false} assume !false; {670#false} is VALID [2022-04-08 14:51:38,808 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-08 14:51:38,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:51:38,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263284361] [2022-04-08 14:51:38,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263284361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:38,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:38,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:38,809 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:51:38,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1304337430] [2022-04-08 14:51:38,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1304337430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:38,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:38,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:38,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881900838] [2022-04-08 14:51:38,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:51:38,811 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-08 14:51:38,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:51:38,811 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-08 14:51:38,824 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-08 14:51:38,824 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:51:38,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:38,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:51:38,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:51:38,825 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-08 14:51:39,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:39,120 INFO L93 Difference]: Finished difference Result 160 states and 250 transitions. [2022-04-08 14:51:39,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:51:39,120 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-08 14:51:39,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:51:39,121 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-08 14:51:39,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-08 14:51:39,128 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-08 14:51:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-08 14:51:39,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 195 transitions. [2022-04-08 14:51:39,276 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-08 14:51:39,282 INFO L225 Difference]: With dead ends: 160 [2022-04-08 14:51:39,282 INFO L226 Difference]: Without dead ends: 120 [2022-04-08 14:51:39,283 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:51:39,286 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:51:39,287 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-08 14:51:39,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-08 14:51:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-08 14:51:39,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:51:39,312 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-08 14:51:39,312 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-08 14:51:39,313 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-08 14:51:39,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:39,323 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions. [2022-04-08 14:51:39,323 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2022-04-08 14:51:39,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:39,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:39,325 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-08 14:51:39,325 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-08 14:51:39,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:39,329 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions. [2022-04-08 14:51:39,329 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2022-04-08 14:51:39,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:39,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:39,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:51:39,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:51:39,337 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-08 14:51:39,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 179 transitions. [2022-04-08 14:51:39,349 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 179 transitions. Word has length 14 [2022-04-08 14:51:39,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:51:39,349 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 179 transitions. [2022-04-08 14:51:39,350 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-08 14:51:39,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 179 transitions. [2022-04-08 14:51:39,498 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-08 14:51:39,498 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2022-04-08 14:51:39,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 14:51:39,503 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:51:39,503 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:51:39,504 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 14:51:39,504 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:51:39,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:51:39,505 INFO L85 PathProgramCache]: Analyzing trace with hash -974235404, now seen corresponding path program 1 times [2022-04-08 14:51:39,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:39,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1175301997] [2022-04-08 14:51:39,517 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:51:39,517 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:51:39,517 INFO L85 PathProgramCache]: Analyzing trace with hash -974235404, now seen corresponding path program 2 times [2022-04-08 14:51:39,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:51:39,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800958568] [2022-04-08 14:51:39,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:51:39,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:51:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:39,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:51:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:39,599 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-08 14:51:39,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {1481#true} assume true; {1481#true} is VALID [2022-04-08 14:51:39,599 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1481#true} {1481#true} #200#return; {1481#true} is VALID [2022-04-08 14:51:39,600 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-08 14:51:39,600 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-08 14:51:39,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {1481#true} assume true; {1481#true} is VALID [2022-04-08 14:51:39,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1481#true} {1481#true} #200#return; {1481#true} is VALID [2022-04-08 14:51:39,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {1481#true} call #t~ret9 := main(); {1481#true} is VALID [2022-04-08 14:51:39,601 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-08 14:51:39,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {1481#true} assume !false; {1481#true} is VALID [2022-04-08 14:51:39,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {1481#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1481#true} is VALID [2022-04-08 14:51:39,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {1481#true} assume 8466 == ~s__state~0; {1481#true} is VALID [2022-04-08 14:51:39,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {1481#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {1481#true} is VALID [2022-04-08 14:51:39,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {1481#true} ~s__state~0 := 8496; {1481#true} is VALID [2022-04-08 14:51:39,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {1481#true} assume !false; {1481#true} is VALID [2022-04-08 14:51:39,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {1481#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1481#true} is VALID [2022-04-08 14:51:39,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {1481#true} assume !(8466 == ~s__state~0); {1481#true} is VALID [2022-04-08 14:51:39,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {1481#true} assume 8496 == ~s__state~0; {1481#true} is VALID [2022-04-08 14:51:39,603 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-08 14:51:39,604 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-08 14:51:39,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {1486#(= (+ (- 2) main_~blastFlag~0) 0)} assume !false; {1486#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-08 14:51:39,604 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-08 14:51:39,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {1482#false} assume !false; {1482#false} is VALID [2022-04-08 14:51:39,605 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-08 14:51:39,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:51:39,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800958568] [2022-04-08 14:51:39,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800958568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:39,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:39,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:39,606 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:51:39,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1175301997] [2022-04-08 14:51:39,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1175301997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:39,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:39,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:39,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682294228] [2022-04-08 14:51:39,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:51:39,607 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-08 14:51:39,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:51:39,608 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-08 14:51:39,619 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-08 14:51:39,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:51:39,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:39,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:51:39,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:51:39,620 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-08 14:51:39,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:39,856 INFO L93 Difference]: Finished difference Result 234 states and 359 transitions. [2022-04-08 14:51:39,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:51:39,856 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-08 14:51:39,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:51:39,857 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-08 14:51:39,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-08 14:51:39,861 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-08 14:51:39,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-08 14:51:39,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 196 transitions. [2022-04-08 14:51:40,044 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-08 14:51:40,047 INFO L225 Difference]: With dead ends: 234 [2022-04-08 14:51:40,047 INFO L226 Difference]: Without dead ends: 157 [2022-04-08 14:51:40,048 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:51:40,049 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 117 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:51:40,049 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.1s Time] [2022-04-08 14:51:40,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-08 14:51:40,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-04-08 14:51:40,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:51:40,070 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-08 14:51:40,071 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-08 14:51:40,071 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-08 14:51:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:40,079 INFO L93 Difference]: Finished difference Result 157 states and 234 transitions. [2022-04-08 14:51:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 234 transitions. [2022-04-08 14:51:40,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:40,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:40,081 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-08 14:51:40,082 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-08 14:51:40,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:40,089 INFO L93 Difference]: Finished difference Result 157 states and 234 transitions. [2022-04-08 14:51:40,090 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 234 transitions. [2022-04-08 14:51:40,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:40,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:40,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:51:40,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:51:40,091 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-08 14:51:40,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 234 transitions. [2022-04-08 14:51:40,100 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 234 transitions. Word has length 20 [2022-04-08 14:51:40,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:51:40,101 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 234 transitions. [2022-04-08 14:51:40,101 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-08 14:51:40,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 234 transitions. [2022-04-08 14:51:40,302 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-08 14:51:40,303 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 234 transitions. [2022-04-08 14:51:40,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 14:51:40,303 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:51:40,304 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-08 14:51:40,304 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 14:51:40,306 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:51:40,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:51:40,307 INFO L85 PathProgramCache]: Analyzing trace with hash -674137767, now seen corresponding path program 1 times [2022-04-08 14:51:40,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:40,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1367164181] [2022-04-08 14:51:40,323 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:51:40,323 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:51:40,323 INFO L85 PathProgramCache]: Analyzing trace with hash -674137767, now seen corresponding path program 2 times [2022-04-08 14:51:40,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:51:40,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321794948] [2022-04-08 14:51:40,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:51:40,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:51:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:40,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:51:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:40,373 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-08 14:51:40,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-08 14:51:40,374 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2589#true} {2589#true} #200#return; {2589#true} is VALID [2022-04-08 14:51:40,374 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-08 14:51:40,375 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-08 14:51:40,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-08 14:51:40,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2589#true} {2589#true} #200#return; {2589#true} is VALID [2022-04-08 14:51:40,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {2589#true} call #t~ret9 := main(); {2589#true} is VALID [2022-04-08 14:51:40,375 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-08 14:51:40,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {2589#true} assume !false; {2589#true} is VALID [2022-04-08 14:51:40,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {2589#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2589#true} is VALID [2022-04-08 14:51:40,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {2589#true} assume 8466 == ~s__state~0; {2589#true} is VALID [2022-04-08 14:51:40,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {2589#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2589#true} is VALID [2022-04-08 14:51:40,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {2589#true} ~s__state~0 := 8496; {2589#true} is VALID [2022-04-08 14:51:40,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {2589#true} assume !false; {2589#true} is VALID [2022-04-08 14:51:40,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {2589#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2589#true} is VALID [2022-04-08 14:51:40,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {2589#true} assume !(8466 == ~s__state~0); {2589#true} is VALID [2022-04-08 14:51:40,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {2589#true} assume 8496 == ~s__state~0; {2589#true} is VALID [2022-04-08 14:51:40,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {2589#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {2589#true} is VALID [2022-04-08 14:51:40,378 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-08 14:51:40,379 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-08 14:51:40,379 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-08 14:51:40,379 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-08 14:51:40,380 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-08 14:51:40,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {2594#(= (+ (- 8512) main_~s__state~0) 0)} assume !(8512 == ~s__state~0); {2590#false} is VALID [2022-04-08 14:51:40,381 INFO L290 TraceCheckUtils]: 22: Hoare triple {2590#false} assume !(8528 == ~s__state~0); {2590#false} is VALID [2022-04-08 14:51:40,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {2590#false} assume !(8544 == ~s__state~0); {2590#false} is VALID [2022-04-08 14:51:40,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {2590#false} assume !(8560 == ~s__state~0); {2590#false} is VALID [2022-04-08 14:51:40,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {2590#false} assume !(8576 == ~s__state~0); {2590#false} is VALID [2022-04-08 14:51:40,382 INFO L290 TraceCheckUtils]: 26: Hoare triple {2590#false} assume !(8592 == ~s__state~0); {2590#false} is VALID [2022-04-08 14:51:40,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {2590#false} assume !(8608 == ~s__state~0); {2590#false} is VALID [2022-04-08 14:51:40,382 INFO L290 TraceCheckUtils]: 28: Hoare triple {2590#false} assume !(8640 == ~s__state~0); {2590#false} is VALID [2022-04-08 14:51:40,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {2590#false} assume 8656 == ~s__state~0; {2590#false} is VALID [2022-04-08 14:51:40,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {2590#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {2590#false} is VALID [2022-04-08 14:51:40,383 INFO L290 TraceCheckUtils]: 31: Hoare triple {2590#false} ~s__state~0 := 8672; {2590#false} is VALID [2022-04-08 14:51:40,383 INFO L290 TraceCheckUtils]: 32: Hoare triple {2590#false} assume !false; {2590#false} is VALID [2022-04-08 14:51:40,383 INFO L290 TraceCheckUtils]: 33: Hoare triple {2590#false} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {2590#false} is VALID [2022-04-08 14:51:40,384 INFO L290 TraceCheckUtils]: 34: Hoare triple {2590#false} assume !false; {2590#false} is VALID [2022-04-08 14:51:40,384 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-08 14:51:40,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:51:40,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321794948] [2022-04-08 14:51:40,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321794948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:40,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:40,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:40,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:51:40,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1367164181] [2022-04-08 14:51:40,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1367164181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:40,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:40,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:40,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599062495] [2022-04-08 14:51:40,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:51:40,386 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-08 14:51:40,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:51:40,387 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-08 14:51:40,408 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-08 14:51:40,409 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:51:40,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:40,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:51:40,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:51:40,410 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-08 14:51:40,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:40,604 INFO L93 Difference]: Finished difference Result 325 states and 488 transitions. [2022-04-08 14:51:40,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:51:40,604 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-08 14:51:40,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:51:40,605 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-08 14:51:40,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-08 14:51:40,607 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-08 14:51:40,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-08 14:51:40,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 144 transitions. [2022-04-08 14:51:40,733 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-08 14:51:40,737 INFO L225 Difference]: With dead ends: 325 [2022-04-08 14:51:40,737 INFO L226 Difference]: Without dead ends: 174 [2022-04-08 14:51:40,740 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-08 14:51:40,742 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-08 14:51:40,744 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-08 14:51:40,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-08 14:51:40,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2022-04-08 14:51:40,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:51:40,774 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-08 14:51:40,774 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-08 14:51:40,775 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-08 14:51:40,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:40,779 INFO L93 Difference]: Finished difference Result 174 states and 251 transitions. [2022-04-08 14:51:40,780 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 251 transitions. [2022-04-08 14:51:40,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:40,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:40,781 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-08 14:51:40,782 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-08 14:51:40,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:40,787 INFO L93 Difference]: Finished difference Result 174 states and 251 transitions. [2022-04-08 14:51:40,787 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 251 transitions. [2022-04-08 14:51:40,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:40,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:40,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:51:40,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:51:40,788 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-08 14:51:40,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 250 transitions. [2022-04-08 14:51:40,794 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 250 transitions. Word has length 35 [2022-04-08 14:51:40,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:51:40,794 INFO L478 AbstractCegarLoop]: Abstraction has 172 states and 250 transitions. [2022-04-08 14:51:40,794 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-08 14:51:40,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 172 states and 250 transitions. [2022-04-08 14:51:41,034 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-08 14:51:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 250 transitions. [2022-04-08 14:51:41,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 14:51:41,036 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:51:41,037 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-08 14:51:41,037 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 14:51:41,037 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:51:41,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:51:41,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1014805975, now seen corresponding path program 1 times [2022-04-08 14:51:41,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:41,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1175164702] [2022-04-08 14:51:41,060 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:51:41,060 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:51:41,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1014805975, now seen corresponding path program 2 times [2022-04-08 14:51:41,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:51:41,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109069857] [2022-04-08 14:51:41,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:51:41,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:51:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:41,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:51:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:41,111 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-08 14:51:41,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {3943#true} assume true; {3943#true} is VALID [2022-04-08 14:51:41,112 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3943#true} {3943#true} #200#return; {3943#true} is VALID [2022-04-08 14:51:41,112 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-08 14:51:41,113 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-08 14:51:41,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {3943#true} assume true; {3943#true} is VALID [2022-04-08 14:51:41,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3943#true} {3943#true} #200#return; {3943#true} is VALID [2022-04-08 14:51:41,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {3943#true} call #t~ret9 := main(); {3943#true} is VALID [2022-04-08 14:51:41,113 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-08 14:51:41,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {3943#true} assume !false; {3943#true} is VALID [2022-04-08 14:51:41,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {3943#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3943#true} is VALID [2022-04-08 14:51:41,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {3943#true} assume 8466 == ~s__state~0; {3943#true} is VALID [2022-04-08 14:51:41,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {3943#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {3943#true} is VALID [2022-04-08 14:51:41,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {3943#true} ~s__state~0 := 8496; {3943#true} is VALID [2022-04-08 14:51:41,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {3943#true} assume !false; {3943#true} is VALID [2022-04-08 14:51:41,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {3943#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3943#true} is VALID [2022-04-08 14:51:41,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {3943#true} assume !(8466 == ~s__state~0); {3943#true} is VALID [2022-04-08 14:51:41,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {3943#true} assume 8496 == ~s__state~0; {3943#true} is VALID [2022-04-08 14:51:41,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {3943#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {3943#true} is VALID [2022-04-08 14:51:41,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {3943#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {3943#true} is VALID [2022-04-08 14:51:41,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {3943#true} assume !false; {3943#true} is VALID [2022-04-08 14:51:41,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {3943#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3943#true} is VALID [2022-04-08 14:51:41,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {3943#true} assume !(8466 == ~s__state~0); {3943#true} is VALID [2022-04-08 14:51:41,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {3943#true} assume !(8496 == ~s__state~0); {3943#true} is VALID [2022-04-08 14:51:41,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {3943#true} assume !(8512 == ~s__state~0); {3943#true} is VALID [2022-04-08 14:51:41,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {3943#true} assume !(8528 == ~s__state~0); {3943#true} is VALID [2022-04-08 14:51:41,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {3943#true} assume !(8544 == ~s__state~0); {3943#true} is VALID [2022-04-08 14:51:41,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {3943#true} assume !(8560 == ~s__state~0); {3943#true} is VALID [2022-04-08 14:51:41,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {3943#true} assume !(8576 == ~s__state~0); {3943#true} is VALID [2022-04-08 14:51:41,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {3943#true} assume !(8592 == ~s__state~0); {3943#true} is VALID [2022-04-08 14:51:41,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {3943#true} assume !(8608 == ~s__state~0); {3943#true} is VALID [2022-04-08 14:51:41,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {3943#true} assume !(8640 == ~s__state~0); {3943#true} is VALID [2022-04-08 14:51:41,118 INFO L290 TraceCheckUtils]: 29: Hoare triple {3943#true} assume 8656 == ~s__state~0; {3943#true} is VALID [2022-04-08 14:51:41,118 INFO L290 TraceCheckUtils]: 30: Hoare triple {3943#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {3943#true} is VALID [2022-04-08 14:51:41,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {3943#true} ~s__state~0 := 8672; {3948#(<= 8672 main_~s__state~0)} is VALID [2022-04-08 14:51:41,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {3948#(<= 8672 main_~s__state~0)} assume !false; {3948#(<= 8672 main_~s__state~0)} is VALID [2022-04-08 14:51:41,120 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-08 14:51:41,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {3944#false} assume !false; {3944#false} is VALID [2022-04-08 14:51:41,120 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-08 14:51:41,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:51:41,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109069857] [2022-04-08 14:51:41,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109069857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:41,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:41,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:41,121 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:51:41,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1175164702] [2022-04-08 14:51:41,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1175164702] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:41,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:41,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:41,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952454801] [2022-04-08 14:51:41,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:51:41,122 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-08 14:51:41,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:51:41,122 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-08 14:51:41,149 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-08 14:51:41,149 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:51:41,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:41,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:51:41,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:51:41,150 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-08 14:51:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:41,411 INFO L93 Difference]: Finished difference Result 382 states and 571 transitions. [2022-04-08 14:51:41,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:51:41,411 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-08 14:51:41,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:51:41,413 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-08 14:51:41,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2022-04-08 14:51:41,415 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-08 14:51:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2022-04-08 14:51:41,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 161 transitions. [2022-04-08 14:51:41,531 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-08 14:51:41,536 INFO L225 Difference]: With dead ends: 382 [2022-04-08 14:51:41,536 INFO L226 Difference]: Without dead ends: 216 [2022-04-08 14:51:41,536 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-08 14:51:41,537 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-08 14:51:41,537 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-08 14:51:41,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-04-08 14:51:41,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2022-04-08 14:51:41,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:51:41,586 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-08 14:51:41,587 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-08 14:51:41,587 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-08 14:51:41,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:41,593 INFO L93 Difference]: Finished difference Result 216 states and 293 transitions. [2022-04-08 14:51:41,593 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 293 transitions. [2022-04-08 14:51:41,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:41,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:41,594 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-08 14:51:41,595 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-08 14:51:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:41,601 INFO L93 Difference]: Finished difference Result 216 states and 293 transitions. [2022-04-08 14:51:41,601 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 293 transitions. [2022-04-08 14:51:41,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:41,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:41,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:51:41,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:51:41,602 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-08 14:51:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 289 transitions. [2022-04-08 14:51:41,609 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 289 transitions. Word has length 35 [2022-04-08 14:51:41,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:51:41,609 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 289 transitions. [2022-04-08 14:51:41,609 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-08 14:51:41,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 289 transitions. [2022-04-08 14:51:41,861 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-08 14:51:41,861 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 289 transitions. [2022-04-08 14:51:41,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 14:51:41,862 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:51:41,862 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-08 14:51:41,862 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 14:51:41,863 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:51:41,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:51:41,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1542489334, now seen corresponding path program 1 times [2022-04-08 14:51:41,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:41,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1168796099] [2022-04-08 14:51:41,884 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:51:41,884 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:51:41,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1542489334, now seen corresponding path program 2 times [2022-04-08 14:51:41,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:51:41,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028272097] [2022-04-08 14:51:41,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:51:41,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:51:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:41,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:51:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:41,948 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-08 14:51:41,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {5573#true} assume true; {5573#true} is VALID [2022-04-08 14:51:41,949 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5573#true} {5573#true} #200#return; {5573#true} is VALID [2022-04-08 14:51:41,949 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-08 14:51:41,949 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-08 14:51:41,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {5573#true} assume true; {5573#true} is VALID [2022-04-08 14:51:41,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5573#true} {5573#true} #200#return; {5573#true} is VALID [2022-04-08 14:51:41,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {5573#true} call #t~ret9 := main(); {5573#true} is VALID [2022-04-08 14:51:41,950 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-08 14:51:41,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {5573#true} assume !false; {5573#true} is VALID [2022-04-08 14:51:41,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {5573#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {5573#true} is VALID [2022-04-08 14:51:41,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {5573#true} assume 8466 == ~s__state~0; {5573#true} is VALID [2022-04-08 14:51:41,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {5573#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {5573#true} is VALID [2022-04-08 14:51:41,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {5573#true} ~s__state~0 := 8496; {5573#true} is VALID [2022-04-08 14:51:41,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {5573#true} assume !false; {5573#true} is VALID [2022-04-08 14:51:41,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {5573#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {5573#true} is VALID [2022-04-08 14:51:41,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {5573#true} assume !(8466 == ~s__state~0); {5573#true} is VALID [2022-04-08 14:51:41,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {5573#true} assume 8496 == ~s__state~0; {5573#true} is VALID [2022-04-08 14:51:41,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {5573#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {5573#true} is VALID [2022-04-08 14:51:41,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {5573#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {5573#true} is VALID [2022-04-08 14:51:41,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {5573#true} assume !false; {5573#true} is VALID [2022-04-08 14:51:41,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {5573#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {5573#true} is VALID [2022-04-08 14:51:41,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {5573#true} assume !(8466 == ~s__state~0); {5573#true} is VALID [2022-04-08 14:51:41,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {5573#true} assume !(8496 == ~s__state~0); {5573#true} is VALID [2022-04-08 14:51:41,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {5573#true} assume !(8512 == ~s__state~0); {5573#true} is VALID [2022-04-08 14:51:41,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {5573#true} assume !(8528 == ~s__state~0); {5573#true} is VALID [2022-04-08 14:51:41,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {5573#true} assume !(8544 == ~s__state~0); {5573#true} is VALID [2022-04-08 14:51:41,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {5573#true} assume !(8560 == ~s__state~0); {5573#true} is VALID [2022-04-08 14:51:41,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {5573#true} assume !(8576 == ~s__state~0); {5573#true} is VALID [2022-04-08 14:51:41,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {5573#true} assume !(8592 == ~s__state~0); {5573#true} is VALID [2022-04-08 14:51:41,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {5573#true} assume !(8608 == ~s__state~0); {5573#true} is VALID [2022-04-08 14:51:41,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {5573#true} assume !(8640 == ~s__state~0); {5573#true} is VALID [2022-04-08 14:51:41,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {5573#true} assume 8656 == ~s__state~0; {5573#true} is VALID [2022-04-08 14:51:41,955 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-08 14:51:41,955 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-08 14:51:41,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {5578#(= (+ (- 3) main_~blastFlag~0) 0)} assume !false; {5578#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-08 14:51:41,956 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-08 14:51:41,956 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-08 14:51:41,956 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-08 14:51:41,957 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-08 14:51:41,957 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-08 14:51:41,958 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-08 14:51:41,958 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-08 14:51:41,958 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-08 14:51:41,959 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-08 14:51:41,959 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-08 14:51:41,959 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-08 14:51:41,960 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-08 14:51:41,960 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-08 14:51:41,961 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-08 14:51:41,961 INFO L290 TraceCheckUtils]: 47: Hoare triple {5578#(= (+ (- 3) main_~blastFlag~0) 0)} assume 5 == ~blastFlag~0; {5574#false} is VALID [2022-04-08 14:51:41,961 INFO L290 TraceCheckUtils]: 48: Hoare triple {5574#false} assume !false; {5574#false} is VALID [2022-04-08 14:51:41,962 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-08 14:51:41,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:51:41,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028272097] [2022-04-08 14:51:41,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028272097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:41,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:41,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:41,962 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:51:41,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1168796099] [2022-04-08 14:51:41,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1168796099] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:41,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:41,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:41,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87625500] [2022-04-08 14:51:41,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:51:41,963 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-08 14:51:41,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:51:41,964 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-08 14:51:41,990 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-08 14:51:41,991 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:51:41,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:41,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:51:41,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:51:41,991 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-08 14:51:42,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:42,251 INFO L93 Difference]: Finished difference Result 418 states and 581 transitions. [2022-04-08 14:51:42,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:51:42,252 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-08 14:51:42,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:51:42,252 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-08 14:51:42,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2022-04-08 14:51:42,255 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-08 14:51:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2022-04-08 14:51:42,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 197 transitions. [2022-04-08 14:51:42,405 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-08 14:51:42,411 INFO L225 Difference]: With dead ends: 418 [2022-04-08 14:51:42,411 INFO L226 Difference]: Without dead ends: 268 [2022-04-08 14:51:42,411 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-08 14:51:42,413 INFO L913 BasicCegarLoop]: 116 mSDtfsCounter, 107 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-08 14:51:42,413 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-08 14:51:42,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-04-08 14:51:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2022-04-08 14:51:42,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:51:42,471 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-08 14:51:42,472 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-08 14:51:42,472 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-08 14:51:42,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:42,480 INFO L93 Difference]: Finished difference Result 268 states and 365 transitions. [2022-04-08 14:51:42,480 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 365 transitions. [2022-04-08 14:51:42,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:42,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:42,482 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-08 14:51:42,482 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-08 14:51:42,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:42,490 INFO L93 Difference]: Finished difference Result 268 states and 365 transitions. [2022-04-08 14:51:42,490 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 365 transitions. [2022-04-08 14:51:42,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:42,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:42,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:51:42,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:51:42,512 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-08 14:51:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 364 transitions. [2022-04-08 14:51:42,520 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 364 transitions. Word has length 49 [2022-04-08 14:51:42,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:51:42,520 INFO L478 AbstractCegarLoop]: Abstraction has 266 states and 364 transitions. [2022-04-08 14:51:42,520 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-08 14:51:42,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 266 states and 364 transitions. [2022-04-08 14:51:42,830 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-08 14:51:42,831 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 364 transitions. [2022-04-08 14:51:42,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 14:51:42,831 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:51:42,831 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-08 14:51:42,832 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 14:51:42,832 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:51:42,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:51:42,832 INFO L85 PathProgramCache]: Analyzing trace with hash 446239409, now seen corresponding path program 1 times [2022-04-08 14:51:42,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:42,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1100198254] [2022-04-08 14:51:42,843 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:51:42,843 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:51:42,843 INFO L85 PathProgramCache]: Analyzing trace with hash 446239409, now seen corresponding path program 2 times [2022-04-08 14:51:42,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:51:42,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473585531] [2022-04-08 14:51:42,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:51:42,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:51:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:42,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:51:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:42,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {7495#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7489#true} is VALID [2022-04-08 14:51:42,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-08 14:51:42,886 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7489#true} {7489#true} #200#return; {7489#true} is VALID [2022-04-08 14:51:42,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {7489#true} call ULTIMATE.init(); {7495#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:51:42,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {7495#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7489#true} is VALID [2022-04-08 14:51:42,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {7489#true} assume true; {7489#true} is VALID [2022-04-08 14:51:42,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7489#true} {7489#true} #200#return; {7489#true} is VALID [2022-04-08 14:51:42,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {7489#true} call #t~ret9 := main(); {7489#true} is VALID [2022-04-08 14:51:42,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {7489#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -9223372036854775808 <= #t~nondet7 && #t~nondet7 <= 9223372036854775807;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {7489#true} is VALID [2022-04-08 14:51:42,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {7489#true} assume !false; {7489#true} is VALID [2022-04-08 14:51:42,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {7489#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {7489#true} is VALID [2022-04-08 14:51:42,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {7489#true} assume 8466 == ~s__state~0; {7489#true} is VALID [2022-04-08 14:51:42,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {7489#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7489#true} is VALID [2022-04-08 14:51:42,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {7489#true} ~s__state~0 := 8496; {7489#true} is VALID [2022-04-08 14:51:42,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {7489#true} assume !false; {7489#true} is VALID [2022-04-08 14:51:42,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {7489#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {7489#true} is VALID [2022-04-08 14:51:42,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {7489#true} assume !(8466 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {7489#true} assume 8496 == ~s__state~0; {7489#true} is VALID [2022-04-08 14:51:42,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {7489#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {7489#true} is VALID [2022-04-08 14:51:42,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {7489#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {7489#true} is VALID [2022-04-08 14:51:42,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {7489#true} assume !false; {7489#true} is VALID [2022-04-08 14:51:42,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {7489#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {7489#true} is VALID [2022-04-08 14:51:42,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {7489#true} assume !(8466 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {7489#true} assume !(8496 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {7489#true} assume !(8512 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {7489#true} assume !(8528 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {7489#true} assume !(8544 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {7489#true} assume !(8560 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {7489#true} assume !(8576 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,891 INFO L290 TraceCheckUtils]: 26: Hoare triple {7489#true} assume !(8592 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {7489#true} assume !(8608 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {7489#true} assume !(8640 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {7489#true} assume 8656 == ~s__state~0; {7489#true} is VALID [2022-04-08 14:51:42,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {7489#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {7489#true} is VALID [2022-04-08 14:51:42,892 INFO L290 TraceCheckUtils]: 31: Hoare triple {7489#true} ~s__state~0 := 8672; {7489#true} is VALID [2022-04-08 14:51:42,892 INFO L290 TraceCheckUtils]: 32: Hoare triple {7489#true} assume !false; {7489#true} is VALID [2022-04-08 14:51:42,892 INFO L290 TraceCheckUtils]: 33: Hoare triple {7489#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {7489#true} is VALID [2022-04-08 14:51:42,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {7489#true} assume !(8466 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,892 INFO L290 TraceCheckUtils]: 35: Hoare triple {7489#true} assume !(8496 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,892 INFO L290 TraceCheckUtils]: 36: Hoare triple {7489#true} assume !(8512 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,892 INFO L290 TraceCheckUtils]: 37: Hoare triple {7489#true} assume !(8528 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,893 INFO L290 TraceCheckUtils]: 38: Hoare triple {7489#true} assume !(8544 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,893 INFO L290 TraceCheckUtils]: 39: Hoare triple {7489#true} assume !(8560 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,893 INFO L290 TraceCheckUtils]: 40: Hoare triple {7489#true} assume !(8576 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,893 INFO L290 TraceCheckUtils]: 41: Hoare triple {7489#true} assume !(8592 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,893 INFO L290 TraceCheckUtils]: 42: Hoare triple {7489#true} assume !(8608 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,893 INFO L290 TraceCheckUtils]: 43: Hoare triple {7489#true} assume !(8640 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,893 INFO L290 TraceCheckUtils]: 44: Hoare triple {7489#true} assume !(8656 == ~s__state~0); {7489#true} is VALID [2022-04-08 14:51:42,894 INFO L290 TraceCheckUtils]: 45: Hoare triple {7489#true} assume 8672 == ~s__state~0; {7489#true} is VALID [2022-04-08 14:51:42,894 INFO L290 TraceCheckUtils]: 46: Hoare triple {7489#true} assume !(4 == ~blastFlag~0); {7489#true} is VALID [2022-04-08 14:51:42,894 INFO L290 TraceCheckUtils]: 47: Hoare triple {7489#true} assume !(5 == ~blastFlag~0); {7489#true} is VALID [2022-04-08 14:51:42,894 INFO L290 TraceCheckUtils]: 48: Hoare triple {7489#true} assume 0 != ~s__hit~0;~s__state~0 := 8640; {7494#(<= 8640 main_~s__state~0)} is VALID [2022-04-08 14:51:42,895 INFO L290 TraceCheckUtils]: 49: Hoare triple {7494#(<= 8640 main_~s__state~0)} assume !false; {7494#(<= 8640 main_~s__state~0)} is VALID [2022-04-08 14:51:42,895 INFO L290 TraceCheckUtils]: 50: Hoare triple {7494#(<= 8640 main_~s__state~0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {7490#false} is VALID [2022-04-08 14:51:42,895 INFO L290 TraceCheckUtils]: 51: Hoare triple {7490#false} assume !false; {7490#false} is VALID [2022-04-08 14:51:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 14:51:42,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:51:42,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473585531] [2022-04-08 14:51:42,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473585531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:42,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:42,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:42,897 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:51:42,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1100198254] [2022-04-08 14:51:42,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1100198254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:42,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:42,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:42,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647129989] [2022-04-08 14:51:42,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:51:42,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-08 14:51:42,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:51:42,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:51:42,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:51:42,919 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:51:42,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:42,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:51:42,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:51:42,919 INFO L87 Difference]: Start difference. First operand 266 states and 364 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:51:43,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:43,266 INFO L93 Difference]: Finished difference Result 524 states and 735 transitions. [2022-04-08 14:51:43,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:51:43,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-08 14:51:43,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:51:43,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:51:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-08 14:51:43,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:51:43,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-08 14:51:43,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-08 14:51:43,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:51:43,379 INFO L225 Difference]: With dead ends: 524 [2022-04-08 14:51:43,379 INFO L226 Difference]: Without dead ends: 186 [2022-04-08 14:51:43,380 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-08 14:51:43,380 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 85 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:51:43,380 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 77 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:51:43,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-08 14:51:43,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2022-04-08 14:51:43,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:51:43,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 183 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:51:43,455 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 183 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:51:43,456 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 183 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:51:43,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:43,467 INFO L93 Difference]: Finished difference Result 186 states and 239 transitions. [2022-04-08 14:51:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 239 transitions. [2022-04-08 14:51:43,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:43,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:43,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 186 states. [2022-04-08 14:51:43,468 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 186 states. [2022-04-08 14:51:43,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:43,472 INFO L93 Difference]: Finished difference Result 186 states and 239 transitions. [2022-04-08 14:51:43,472 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 239 transitions. [2022-04-08 14:51:43,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:43,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:43,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:51:43,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:51:43,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:51:43,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 234 transitions. [2022-04-08 14:51:43,477 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 234 transitions. Word has length 52 [2022-04-08 14:51:43,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:51:43,477 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 234 transitions. [2022-04-08 14:51:43,477 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:51:43,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 234 transitions. [2022-04-08 14:51:43,678 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-08 14:51:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 234 transitions. [2022-04-08 14:51:43,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-08 14:51:43,679 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:51:43,680 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:51:43,680 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 14:51:43,680 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:51:43,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:51:43,680 INFO L85 PathProgramCache]: Analyzing trace with hash -209652788, now seen corresponding path program 1 times [2022-04-08 14:51:43,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:43,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [199367660] [2022-04-08 14:51:43,701 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:51:43,701 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:51:43,701 INFO L85 PathProgramCache]: Analyzing trace with hash -209652788, now seen corresponding path program 2 times [2022-04-08 14:51:43,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:51:43,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446086117] [2022-04-08 14:51:43,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:51:43,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:51:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:43,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:51:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:43,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {9293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9287#true} is VALID [2022-04-08 14:51:43,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {9287#true} assume true; {9287#true} is VALID [2022-04-08 14:51:43,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9287#true} {9287#true} #200#return; {9287#true} is VALID [2022-04-08 14:51:43,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {9287#true} call ULTIMATE.init(); {9293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:51:43,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {9293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9287#true} is VALID [2022-04-08 14:51:43,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {9287#true} assume true; {9287#true} is VALID [2022-04-08 14:51:43,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9287#true} {9287#true} #200#return; {9287#true} is VALID [2022-04-08 14:51:43,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {9287#true} call #t~ret9 := main(); {9287#true} is VALID [2022-04-08 14:51:43,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {9287#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -9223372036854775808 <= #t~nondet7 && #t~nondet7 <= 9223372036854775807;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {9287#true} is VALID [2022-04-08 14:51:43,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {9287#true} assume !false; {9287#true} is VALID [2022-04-08 14:51:43,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {9287#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {9287#true} is VALID [2022-04-08 14:51:43,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {9287#true} assume 8466 == ~s__state~0; {9287#true} is VALID [2022-04-08 14:51:43,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {9287#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9287#true} is VALID [2022-04-08 14:51:43,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {9287#true} ~s__state~0 := 8496; {9287#true} is VALID [2022-04-08 14:51:43,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {9287#true} assume !false; {9287#true} is VALID [2022-04-08 14:51:43,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {9287#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {9287#true} is VALID [2022-04-08 14:51:43,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {9287#true} assume !(8466 == ~s__state~0); {9287#true} is VALID [2022-04-08 14:51:43,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {9287#true} assume 8496 == ~s__state~0; {9287#true} is VALID [2022-04-08 14:51:43,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {9287#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {9287#true} is VALID [2022-04-08 14:51:43,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {9287#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !false; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8466 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8496 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8512 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8528 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8544 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8560 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8576 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8592 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8608 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,783 INFO L290 TraceCheckUtils]: 28: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8640 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume 8656 == ~s__state~0; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,783 INFO L290 TraceCheckUtils]: 30: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,784 INFO L290 TraceCheckUtils]: 31: Hoare triple {9292#(not (= main_~s__hit~0 0))} ~s__state~0 := 8672; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !false; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,784 INFO L290 TraceCheckUtils]: 33: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,785 INFO L290 TraceCheckUtils]: 34: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8466 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,785 INFO L290 TraceCheckUtils]: 35: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8496 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,785 INFO L290 TraceCheckUtils]: 36: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8512 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,786 INFO L290 TraceCheckUtils]: 37: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8528 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,786 INFO L290 TraceCheckUtils]: 38: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8544 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,786 INFO L290 TraceCheckUtils]: 39: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8560 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,787 INFO L290 TraceCheckUtils]: 40: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8576 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,787 INFO L290 TraceCheckUtils]: 41: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8592 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,787 INFO L290 TraceCheckUtils]: 42: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8608 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,788 INFO L290 TraceCheckUtils]: 43: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8640 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,788 INFO L290 TraceCheckUtils]: 44: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8656 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,788 INFO L290 TraceCheckUtils]: 45: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume 8672 == ~s__state~0; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,789 INFO L290 TraceCheckUtils]: 46: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(4 == ~blastFlag~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,789 INFO L290 TraceCheckUtils]: 47: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(5 == ~blastFlag~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,789 INFO L290 TraceCheckUtils]: 48: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume 0 != ~s__hit~0;~s__state~0 := 8640; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,790 INFO L290 TraceCheckUtils]: 49: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !false; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,790 INFO L290 TraceCheckUtils]: 50: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,790 INFO L290 TraceCheckUtils]: 51: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8466 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,791 INFO L290 TraceCheckUtils]: 52: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8496 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,791 INFO L290 TraceCheckUtils]: 53: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8512 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,792 INFO L290 TraceCheckUtils]: 54: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8528 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,792 INFO L290 TraceCheckUtils]: 55: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8544 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,792 INFO L290 TraceCheckUtils]: 56: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8560 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,793 INFO L290 TraceCheckUtils]: 57: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8576 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,793 INFO L290 TraceCheckUtils]: 58: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8592 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,793 INFO L290 TraceCheckUtils]: 59: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(8608 == ~s__state~0); {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,794 INFO L290 TraceCheckUtils]: 60: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume 8640 == ~s__state~0; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,794 INFO L290 TraceCheckUtils]: 61: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {9292#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:43,794 INFO L290 TraceCheckUtils]: 62: Hoare triple {9292#(not (= main_~s__hit~0 0))} assume !(0 != ~s__hit~0);~s__state~0 := 8656; {9288#false} is VALID [2022-04-08 14:51:43,794 INFO L290 TraceCheckUtils]: 63: Hoare triple {9288#false} assume !false; {9288#false} is VALID [2022-04-08 14:51:43,795 INFO L290 TraceCheckUtils]: 64: Hoare triple {9288#false} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {9288#false} is VALID [2022-04-08 14:51:43,795 INFO L290 TraceCheckUtils]: 65: Hoare triple {9288#false} assume !(8466 == ~s__state~0); {9288#false} is VALID [2022-04-08 14:51:43,795 INFO L290 TraceCheckUtils]: 66: Hoare triple {9288#false} assume !(8496 == ~s__state~0); {9288#false} is VALID [2022-04-08 14:51:43,795 INFO L290 TraceCheckUtils]: 67: Hoare triple {9288#false} assume !(8512 == ~s__state~0); {9288#false} is VALID [2022-04-08 14:51:43,795 INFO L290 TraceCheckUtils]: 68: Hoare triple {9288#false} assume !(8528 == ~s__state~0); {9288#false} is VALID [2022-04-08 14:51:43,795 INFO L290 TraceCheckUtils]: 69: Hoare triple {9288#false} assume !(8544 == ~s__state~0); {9288#false} is VALID [2022-04-08 14:51:43,795 INFO L290 TraceCheckUtils]: 70: Hoare triple {9288#false} assume !(8560 == ~s__state~0); {9288#false} is VALID [2022-04-08 14:51:43,796 INFO L290 TraceCheckUtils]: 71: Hoare triple {9288#false} assume !(8576 == ~s__state~0); {9288#false} is VALID [2022-04-08 14:51:43,796 INFO L290 TraceCheckUtils]: 72: Hoare triple {9288#false} assume !(8592 == ~s__state~0); {9288#false} is VALID [2022-04-08 14:51:43,796 INFO L290 TraceCheckUtils]: 73: Hoare triple {9288#false} assume !(8608 == ~s__state~0); {9288#false} is VALID [2022-04-08 14:51:43,796 INFO L290 TraceCheckUtils]: 74: Hoare triple {9288#false} assume !(8640 == ~s__state~0); {9288#false} is VALID [2022-04-08 14:51:43,796 INFO L290 TraceCheckUtils]: 75: Hoare triple {9288#false} assume !(8656 == ~s__state~0); {9288#false} is VALID [2022-04-08 14:51:43,796 INFO L290 TraceCheckUtils]: 76: Hoare triple {9288#false} assume 8672 == ~s__state~0; {9288#false} is VALID [2022-04-08 14:51:43,796 INFO L290 TraceCheckUtils]: 77: Hoare triple {9288#false} assume !(4 == ~blastFlag~0); {9288#false} is VALID [2022-04-08 14:51:43,797 INFO L290 TraceCheckUtils]: 78: Hoare triple {9288#false} assume 5 == ~blastFlag~0; {9288#false} is VALID [2022-04-08 14:51:43,797 INFO L290 TraceCheckUtils]: 79: Hoare triple {9288#false} assume !false; {9288#false} is VALID [2022-04-08 14:51:43,797 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 14:51:43,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:51:43,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446086117] [2022-04-08 14:51:43,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446086117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:43,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:43,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:43,798 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:51:43,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [199367660] [2022-04-08 14:51:43,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [199367660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:43,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:43,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:43,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082243623] [2022-04-08 14:51:43,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:51:43,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-08 14:51:43,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:51:43,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:51:43,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:51:43,833 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:51:43,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:43,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:51:43,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:51:43,834 INFO L87 Difference]: Start difference. First operand 183 states and 234 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:51:44,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:44,068 INFO L93 Difference]: Finished difference Result 275 states and 332 transitions. [2022-04-08 14:51:44,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:51:44,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-08 14:51:44,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:51:44,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:51:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2022-04-08 14:51:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:51:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2022-04-08 14:51:44,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 117 transitions. [2022-04-08 14:51:44,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:51:44,163 INFO L225 Difference]: With dead ends: 275 [2022-04-08 14:51:44,163 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 14:51:44,164 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-08 14:51:44,165 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:51:44,165 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 81 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:51:44,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 14:51:44,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 14:51:44,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:51:44,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:51:44,165 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:51:44,165 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:51:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:44,166 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:51:44,166 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:51:44,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:44,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:44,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 14:51:44,166 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 14:51:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:44,166 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:51:44,166 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:51:44,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:44,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:44,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:51:44,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:51:44,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:51:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 14:51:44,167 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2022-04-08 14:51:44,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:51:44,167 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 14:51:44,167 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:51:44,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 14:51:44,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:51:44,168 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:51:44,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:44,170 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 14:51:44,171 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 14:51:44,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 14:51:45,419 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-08 14:51:45,420 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-08 14:51:45,420 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-08 14:51:45,420 INFO L885 garLoopResultBuilder]: At program point L225(lines 20 229) the Hoare annotation is: true [2022-04-08 14:51:45,420 INFO L878 garLoopResultBuilder]: At program point L126(lines 126 130) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 14:51:45,420 INFO L878 garLoopResultBuilder]: At program point L60(lines 60 207) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-08 14:51:45,421 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 20 229) the Hoare annotation is: true [2022-04-08 14:51:45,421 INFO L878 garLoopResultBuilder]: At program point L184(lines 184 186) the Hoare annotation is: (let ((.cse0 (<= 8672 main_~s__state~0))) (or (and .cse0 (= main_~blastFlag~0 0)) (and .cse0 (= main_~blastFlag~0 1)) (and (= 3 main_~blastFlag~0) .cse0) (and .cse0 (= 2 main_~blastFlag~0)))) [2022-04-08 14:51:45,421 INFO L878 garLoopResultBuilder]: At program point L118(lines 118 122) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 14:51:45,421 INFO L878 garLoopResultBuilder]: At program point L85(lines 84 195) the Hoare annotation is: (let ((.cse0 (<= 8672 main_~s__state~0))) (or (and .cse0 (= main_~blastFlag~0 0)) (and .cse0 (= main_~blastFlag~0 1)) (and (= 3 main_~blastFlag~0) .cse0) (and .cse0 (= 2 main_~blastFlag~0)))) [2022-04-08 14:51:45,425 INFO L878 garLoopResultBuilder]: At program point L52(lines 52 211) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-08 14:51:45,426 INFO L878 garLoopResultBuilder]: At program point L77(lines 76 199) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and (= main_~blastFlag~0 1) .cse0) (and .cse0 (= 2 main_~blastFlag~0)) (and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) .cse0) (and (= main_~blastFlag~0 0) .cse0))) [2022-04-08 14:51:45,427 INFO L878 garLoopResultBuilder]: At program point L44(lines 44 215) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-08 14:51:45,428 INFO L878 garLoopResultBuilder]: At program point L69(lines 68 203) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 14:51:45,428 INFO L878 garLoopResultBuilder]: At program point L61(lines 60 207) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 14:51:45,428 INFO L878 garLoopResultBuilder]: At program point L185(lines 20 229) the Hoare annotation is: false [2022-04-08 14:51:45,428 INFO L878 garLoopResultBuilder]: At program point L53(lines 52 211) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 14:51:45,428 INFO L878 garLoopResultBuilder]: At program point L45(lines 44 215) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 14:51:45,428 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 20 229) the Hoare annotation is: true [2022-04-08 14:51:45,429 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 227) the Hoare annotation is: false [2022-04-08 14:51:45,429 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 20 229) the Hoare annotation is: true [2022-04-08 14:51:45,429 INFO L878 garLoopResultBuilder]: At program point L80(lines 80 197) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-08 14:51:45,429 INFO L878 garLoopResultBuilder]: At program point L72(lines 72 201) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-08 14:51:45,429 INFO L878 garLoopResultBuilder]: At program point L163-1(lines 86 195) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and (= main_~blastFlag~0 1) .cse0) (and .cse0 (= 2 main_~blastFlag~0)) (and (= main_~blastFlag~0 0) .cse0) (and (not (= main_~s__hit~0 0)) .cse0))) [2022-04-08 14:51:45,429 INFO L878 garLoopResultBuilder]: At program point L64(lines 64 205) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-08 14:51:45,430 INFO L878 garLoopResultBuilder]: At program point L97-1(lines 86 195) the Hoare annotation is: (or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 14:51:45,430 INFO L878 garLoopResultBuilder]: At program point L188(lines 34 223) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-08 14:51:45,430 INFO L878 garLoopResultBuilder]: At program point L56(lines 56 209) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-08 14:51:45,430 INFO L878 garLoopResultBuilder]: At program point L147(lines 147 151) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 14:51:45,430 INFO L878 garLoopResultBuilder]: At program point L81(lines 80 197) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and (= main_~blastFlag~0 1) .cse0) (and .cse0 (= 2 main_~blastFlag~0)) (and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) .cse0) (and (= main_~blastFlag~0 0) .cse0))) [2022-04-08 14:51:45,430 INFO L878 garLoopResultBuilder]: At program point L48(lines 48 213) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-08 14:51:45,430 INFO L878 garLoopResultBuilder]: At program point L73(lines 72 201) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 14:51:45,431 INFO L878 garLoopResultBuilder]: At program point L65(lines 64 205) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 14:51:45,431 INFO L878 garLoopResultBuilder]: At program point L57(lines 56 209) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 14:51:45,431 INFO L878 garLoopResultBuilder]: At program point L90-1(lines 90 92) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0)) [2022-04-08 14:51:45,431 INFO L878 garLoopResultBuilder]: At program point L181-1(lines 86 195) the Hoare annotation is: (let ((.cse0 (<= 8672 main_~s__state~0))) (or (and .cse0 (= main_~blastFlag~0 0)) (and .cse0 (= main_~blastFlag~0 1)) (and (= 3 main_~blastFlag~0) .cse0) (and .cse0 (= 2 main_~blastFlag~0)))) [2022-04-08 14:51:45,431 INFO L878 garLoopResultBuilder]: At program point L49(lines 48 213) the Hoare annotation is: (let ((.cse0 (= (+ (- 8512) main_~s__state~0) 0))) (or (and (= (+ (- 2) main_~blastFlag~0) 0) .cse0) (and (= (+ (- 1) main_~blastFlag~0) 0) .cse0) (and (= main_~blastFlag~0 0) .cse0))) [2022-04-08 14:51:45,431 INFO L878 garLoopResultBuilder]: At program point L41(lines 41 216) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-08 14:51:45,431 INFO L878 garLoopResultBuilder]: At program point L132(lines 125 134) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 14:51:45,431 INFO L878 garLoopResultBuilder]: At program point L124(lines 117 135) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 14:51:45,432 INFO L878 garLoopResultBuilder]: At program point L174-1(lines 174 176) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and (= main_~blastFlag~0 1) .cse0) (and (= main_~blastFlag~0 0) .cse0) (and (= 3 main_~blastFlag~0) .cse0))) [2022-04-08 14:51:45,432 INFO L878 garLoopResultBuilder]: At program point L42(lines 41 216) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 14:51:45,432 INFO L878 garLoopResultBuilder]: At program point L117(lines 117 135) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 14:51:45,432 INFO L878 garLoopResultBuilder]: At program point L84(lines 84 195) the Hoare annotation is: (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and (= 3 main_~blastFlag~0) (<= 8640 main_~s__state~0)) (= 2 main_~blastFlag~0)) [2022-04-08 14:51:45,432 INFO L878 garLoopResultBuilder]: At program point L76(lines 76 199) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-08 14:51:45,432 INFO L878 garLoopResultBuilder]: At program point L68(lines 68 203) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-08 14:51:45,432 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-08 14:51:45,432 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 14:51:45,433 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 14:51:45,433 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 14:51:45,433 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 14:51:45,433 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 14:51:45,433 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 14:51:45,434 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 14:51:45,436 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 14:51:45,438 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 14:51:45,442 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 14:51:45,444 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 14:51:45,491 INFO L163 areAnnotationChecker]: CFG has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 14:51:45,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:51:45 BoogieIcfgContainer [2022-04-08 14:51:45,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 14:51:45,505 INFO L158 Benchmark]: Toolchain (without parser) took 8928.84ms. Allocated memory was 182.5MB in the beginning and 306.2MB in the end (delta: 123.7MB). Free memory was 131.3MB in the beginning and 239.5MB in the end (delta: -108.2MB). Peak memory consumption was 118.8MB. Max. memory is 8.0GB. [2022-04-08 14:51:45,505 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 182.5MB. Free memory was 148.1MB in the beginning and 148.0MB in the end (delta: 90.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 14:51:45,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.13ms. Allocated memory is still 182.5MB. Free memory was 131.2MB in the beginning and 156.6MB in the end (delta: -25.4MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-08 14:51:45,506 INFO L158 Benchmark]: Boogie Preprocessor took 38.02ms. Allocated memory is still 182.5MB. Free memory was 156.6MB in the beginning and 155.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 14:51:45,506 INFO L158 Benchmark]: RCFGBuilder took 366.03ms. Allocated memory is still 182.5MB. Free memory was 155.0MB in the beginning and 140.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-08 14:51:45,506 INFO L158 Benchmark]: TraceAbstraction took 8202.74ms. Allocated memory was 182.5MB in the beginning and 306.2MB in the end (delta: 123.7MB). Free memory was 139.8MB in the beginning and 240.0MB in the end (delta: -100.2MB). Peak memory consumption was 128.4MB. Max. memory is 8.0GB. [2022-04-08 14:51:45,508 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 182.5MB. Free memory was 148.1MB in the beginning and 148.0MB in the end (delta: 90.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 316.13ms. Allocated memory is still 182.5MB. Free memory was 131.2MB in the beginning and 156.6MB in the end (delta: -25.4MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.02ms. Allocated memory is still 182.5MB. Free memory was 156.6MB in the beginning and 155.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 366.03ms. Allocated memory is still 182.5MB. Free memory was 155.0MB in the beginning and 140.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 8202.74ms. Allocated memory was 182.5MB in the beginning and 306.2MB in the end (delta: 123.7MB). Free memory was 139.8MB in the beginning and 240.0MB in the end (delta: -100.2MB). Peak memory consumption was 128.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 227]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 840 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 840 mSDsluCounter, 762 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 560 IncrementalHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 704 mSDtfsCounter, 560 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=6, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 51 LocationsWithAnnotation, 51 PreInvPairs, 317 NumberOfFragments, 853 HoareAnnotationTreeSize, 51 FomulaSimplifications, 508 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 51 FomulaSimplificationsInter, 1057 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: (((blastFlag == 1 && 8640 <= s__state) || (8640 <= s__state && 2 == blastFlag)) || ((3 == blastFlag && !(s__hit == 0)) && 8640 <= s__state)) || (blastFlag == 0 && 8640 <= s__state) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: (((blastFlag == 1 && 8640 <= s__state) || (8640 <= s__state && 2 == blastFlag)) || ((3 == blastFlag && !(s__hit == 0)) && 8640 <= s__state)) || (blastFlag == 0 && 8640 <= s__state) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((blastFlag == 0 || blastFlag == 1) || ((3 == blastFlag && !(s__hit == 0)) && 8640 <= s__state)) || (3 == blastFlag && 8672 <= s__state)) || 2 == blastFlag - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (((8672 <= s__state && blastFlag == 0) || (8672 <= s__state && blastFlag == 1)) || (3 == blastFlag && 8672 <= s__state)) || (8672 <= s__state && 2 == blastFlag) - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: ((-2 + blastFlag == 0 && -8512 + s__state == 0) || (-1 + blastFlag == 0 && -8512 + s__state == 0)) || (blastFlag == 0 && -8512 + s__state == 0) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 14:51:45,547 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...