/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/s3_srvr.blast.01.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 18:16:41,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 18:16:41,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 18:16:41,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 18:16:41,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 18:16:41,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 18:16:41,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 18:16:41,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 18:16:41,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 18:16:41,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 18:16:41,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 18:16:41,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 18:16:41,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 18:16:41,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 18:16:41,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 18:16:41,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 18:16:41,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 18:16:41,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 18:16:41,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 18:16:41,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 18:16:41,864 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 18:16:41,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 18:16:41,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 18:16:41,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 18:16:41,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 18:16:41,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 18:16:41,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 18:16:41,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 18:16:41,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 18:16:41,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 18:16:41,877 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 18:16:41,877 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 18:16:41,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 18:16:41,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 18:16:41,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 18:16:41,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 18:16:41,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 18:16:41,881 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 18:16:41,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 18:16:41,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 18:16:41,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 18:16:41,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 18:16:41,884 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 18:16:41,892 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 18:16:41,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 18:16:41,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 18:16:41,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 18:16:41,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 18:16:41,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 18:16:41,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 18:16:41,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 18:16:41,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 18:16:41,895 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 18:16:41,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 18:16:41,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 18:16:41,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 18:16:41,896 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 18:16:41,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 18:16:41,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:16:41,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 18:16:41,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 18:16:41,896 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 18:16:41,897 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 18:16:41,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 18:16:41,897 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 18:16:41,897 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 18:16:42,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 18:16:42,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 18:16:42,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 18:16:42,132 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 18:16:42,133 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 18:16:42,133 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-1.c [2022-04-15 18:16:42,174 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3be991c90/b7cb7300d9e2409fa63a98b221340b48/FLAG6f2d6d015 [2022-04-15 18:16:42,603 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 18:16:42,603 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-1.c [2022-04-15 18:16:42,620 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3be991c90/b7cb7300d9e2409fa63a98b221340b48/FLAG6f2d6d015 [2022-04-15 18:16:42,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3be991c90/b7cb7300d9e2409fa63a98b221340b48 [2022-04-15 18:16:42,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 18:16:42,926 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 18:16:42,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 18:16:42,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 18:16:42,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 18:16:42,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:16:42" (1/1) ... [2022-04-15 18:16:42,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34399637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:42, skipping insertion in model container [2022-04-15 18:16:42,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:16:42" (1/1) ... [2022-04-15 18:16:42,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 18:16:43,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 18:16:43,327 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/s3_srvr.blast.01.i.cil-1.c[72918,72931] [2022-04-15 18:16:43,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:16:43,347 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 18:16:43,424 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/s3_srvr.blast.01.i.cil-1.c[72918,72931] [2022-04-15 18:16:43,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:16:43,448 INFO L208 MainTranslator]: Completed translation [2022-04-15 18:16:43,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:43 WrapperNode [2022-04-15 18:16:43,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 18:16:43,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 18:16:43,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 18:16:43,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 18:16:43,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:43" (1/1) ... [2022-04-15 18:16:43,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:43" (1/1) ... [2022-04-15 18:16:43,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:43" (1/1) ... [2022-04-15 18:16:43,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:43" (1/1) ... [2022-04-15 18:16:43,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:43" (1/1) ... [2022-04-15 18:16:43,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:43" (1/1) ... [2022-04-15 18:16:43,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:43" (1/1) ... [2022-04-15 18:16:43,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 18:16:43,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 18:16:43,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 18:16:43,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 18:16:43,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:43" (1/1) ... [2022-04-15 18:16:43,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:16:43,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 18:16:43,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 18:16:43,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 18:16:43,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 18:16:43,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 18:16:43,644 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 18:16:43,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-15 18:16:43,645 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-15 18:16:43,645 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 18:16:43,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-15 18:16:43,646 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 18:16:43,646 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 18:16:43,646 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 18:16:43,646 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 18:16:43,646 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 18:16:43,646 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 18:16:43,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 18:16:43,647 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 18:16:43,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 18:16:43,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 18:16:43,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 18:16:43,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 18:16:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 18:16:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-15 18:16:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 18:16:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-15 18:16:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-15 18:16:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 18:16:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 18:16:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 18:16:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 18:16:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 18:16:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 18:16:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 18:16:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 18:16:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 18:16:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 18:16:43,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 18:16:43,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 18:16:43,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 18:16:43,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 18:16:43,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 18:16:43,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 18:16:43,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 18:16:43,823 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 18:16:43,824 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 18:16:45,344 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:16:45,820 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-15 18:16:45,820 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-15 18:16:45,833 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 18:16:45,842 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 18:16:45,842 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 18:16:45,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:16:45 BoogieIcfgContainer [2022-04-15 18:16:45,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 18:16:45,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 18:16:45,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 18:16:45,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 18:16:45,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:16:42" (1/3) ... [2022-04-15 18:16:45,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c62364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:16:45, skipping insertion in model container [2022-04-15 18:16:45,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:16:43" (2/3) ... [2022-04-15 18:16:45,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c62364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:16:45, skipping insertion in model container [2022-04-15 18:16:45,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:16:45" (3/3) ... [2022-04-15 18:16:45,850 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-1.c [2022-04-15 18:16:45,853 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 18:16:45,853 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 18:16:45,882 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 18:16:45,886 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 18:16:45,886 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 18:16:45,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 147 states have (on average 1.6870748299319729) internal successors, (248), 148 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 18:16:45,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 18:16:45,915 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:16:45,919 INFO L499 BasicCegarLoop]: trace histogram [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, 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, 1] [2022-04-15 18:16:45,920 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:16:45,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:16:45,924 INFO L85 PathProgramCache]: Analyzing trace with hash 37136980, now seen corresponding path program 1 times [2022-04-15 18:16:45,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:45,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1839275067] [2022-04-15 18:16:45,939 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:16:45,939 INFO L85 PathProgramCache]: Analyzing trace with hash 37136980, now seen corresponding path program 2 times [2022-04-15 18:16:45,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:16:45,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421718287] [2022-04-15 18:16:45,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:16:45,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:16:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:46,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:16:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:46,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {158#true} is VALID [2022-04-15 18:16:46,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} assume true; {158#true} is VALID [2022-04-15 18:16:46,478 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158#true} {158#true} #665#return; {158#true} is VALID [2022-04-15 18:16:46,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {158#true} call ULTIMATE.init(); {165#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:16:46,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {158#true} is VALID [2022-04-15 18:16:46,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} assume true; {158#true} is VALID [2022-04-15 18:16:46,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158#true} {158#true} #665#return; {158#true} is VALID [2022-04-15 18:16:46,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {158#true} call #t~ret162 := main(); {158#true} is VALID [2022-04-15 18:16:46,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {158#true} is VALID [2022-04-15 18:16:46,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {158#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {158#true} is VALID [2022-04-15 18:16:46,483 INFO L272 TraceCheckUtils]: 7: Hoare triple {158#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {158#true} is VALID [2022-04-15 18:16:46,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {158#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;~blastFlag~0 := 0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:46,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:46,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:46,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:46,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:46,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:46,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:46,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:46,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:46,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:46,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:46,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:46,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:46,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:46,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:46,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {164#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-15 18:16:46,503 INFO L290 TraceCheckUtils]: 24: Hoare triple {164#(= 8464 |ssl3_accept_#t~mem50|)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {159#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,504 INFO L290 TraceCheckUtils]: 26: Hoare triple {159#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,505 INFO L290 TraceCheckUtils]: 27: Hoare triple {159#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,505 INFO L290 TraceCheckUtils]: 28: Hoare triple {159#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {159#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,506 INFO L290 TraceCheckUtils]: 30: Hoare triple {159#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,506 INFO L290 TraceCheckUtils]: 31: Hoare triple {159#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,506 INFO L290 TraceCheckUtils]: 32: Hoare triple {159#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,506 INFO L290 TraceCheckUtils]: 33: Hoare triple {159#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {159#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {159#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {159#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {159#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {159#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,508 INFO L290 TraceCheckUtils]: 39: Hoare triple {159#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,508 INFO L290 TraceCheckUtils]: 40: Hoare triple {159#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,509 INFO L290 TraceCheckUtils]: 41: Hoare triple {159#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,509 INFO L290 TraceCheckUtils]: 42: Hoare triple {159#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,510 INFO L290 TraceCheckUtils]: 43: Hoare triple {159#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,510 INFO L290 TraceCheckUtils]: 44: Hoare triple {159#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,510 INFO L290 TraceCheckUtils]: 45: Hoare triple {159#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,513 INFO L290 TraceCheckUtils]: 46: Hoare triple {159#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,513 INFO L290 TraceCheckUtils]: 47: Hoare triple {159#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-15 18:16:46,513 INFO L290 TraceCheckUtils]: 48: Hoare triple {159#false} assume 8672 == #t~mem74;havoc #t~mem74; {159#false} is VALID [2022-04-15 18:16:46,513 INFO L290 TraceCheckUtils]: 49: Hoare triple {159#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {159#false} is VALID [2022-04-15 18:16:46,513 INFO L290 TraceCheckUtils]: 50: Hoare triple {159#false} assume !(4 == ~blastFlag~0); {159#false} is VALID [2022-04-15 18:16:46,514 INFO L290 TraceCheckUtils]: 51: Hoare triple {159#false} assume 5 == ~blastFlag~0; {159#false} is VALID [2022-04-15 18:16:46,515 INFO L290 TraceCheckUtils]: 52: Hoare triple {159#false} assume !false; {159#false} is VALID [2022-04-15 18:16:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:16:46,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:16:46,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421718287] [2022-04-15 18:16:46,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421718287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:46,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:46,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:16:46,530 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:16:46,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1839275067] [2022-04-15 18:16:46,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1839275067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:46,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:46,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:16:46,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201227523] [2022-04-15 18:16:46,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:16:46,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 18:16:46,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:16:46,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:46,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:46,602 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:16:46,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:46,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:16:46,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:16:46,633 INFO L87 Difference]: Start difference. First operand has 155 states, 147 states have (on average 1.6870748299319729) internal successors, (248), 148 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:50,250 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:52,265 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:54,301 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:56,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:57,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:57,870 INFO L93 Difference]: Finished difference Result 328 states and 543 transitions. [2022-04-15 18:16:57,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:16:57,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 18:16:57,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:16:57,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:57,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2022-04-15 18:16:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2022-04-15 18:16:57,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 543 transitions. [2022-04-15 18:16:58,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 543 edges. 543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:58,358 INFO L225 Difference]: With dead ends: 328 [2022-04-15 18:16:58,358 INFO L226 Difference]: Without dead ends: 167 [2022-04-15 18:16:58,360 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:16:58,363 INFO L913 BasicCegarLoop]: 221 mSDtfsCounter, 33 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 11 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:16:58,364 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 583 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 404 Invalid, 3 Unknown, 0 Unchecked, 8.1s Time] [2022-04-15 18:16:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-15 18:16:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2022-04-15 18:16:58,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:16:58,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:58,399 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:58,399 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:58,406 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2022-04-15 18:16:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2022-04-15 18:16:58,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:58,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:58,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-15 18:16:58,409 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-15 18:16:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:58,416 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2022-04-15 18:16:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2022-04-15 18:16:58,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:58,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:58,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:16:58,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:16:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:58,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 227 transitions. [2022-04-15 18:16:58,425 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 227 transitions. Word has length 53 [2022-04-15 18:16:58,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:16:58,425 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 227 transitions. [2022-04-15 18:16:58,426 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:58,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 227 transitions. [2022-04-15 18:16:58,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:58,628 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 227 transitions. [2022-04-15 18:16:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 18:16:58,629 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:16:58,629 INFO L499 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1] [2022-04-15 18:16:58,630 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 18:16:58,630 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:16:58,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:16:58,630 INFO L85 PathProgramCache]: Analyzing trace with hash -2067870814, now seen corresponding path program 1 times [2022-04-15 18:16:58,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:58,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1883281585] [2022-04-15 18:16:58,652 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 18:16:58,652 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:16:58,653 INFO L85 PathProgramCache]: Analyzing trace with hash -2067870814, now seen corresponding path program 2 times [2022-04-15 18:16:58,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:16:58,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868595082] [2022-04-15 18:16:58,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:16:58,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:16:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:58,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:16:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:58,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {1467#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1460#true} is VALID [2022-04-15 18:16:58,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {1460#true} assume true; {1460#true} is VALID [2022-04-15 18:16:58,908 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1460#true} {1460#true} #665#return; {1460#true} is VALID [2022-04-15 18:16:58,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {1460#true} call ULTIMATE.init(); {1467#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:16:58,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {1467#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1460#true} is VALID [2022-04-15 18:16:58,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {1460#true} assume true; {1460#true} is VALID [2022-04-15 18:16:58,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1460#true} {1460#true} #665#return; {1460#true} is VALID [2022-04-15 18:16:58,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {1460#true} call #t~ret162 := main(); {1460#true} is VALID [2022-04-15 18:16:58,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {1460#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1460#true} is VALID [2022-04-15 18:16:58,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {1460#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {1460#true} is VALID [2022-04-15 18:16:58,910 INFO L272 TraceCheckUtils]: 7: Hoare triple {1460#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1460#true} is VALID [2022-04-15 18:16:58,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {1460#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;~blastFlag~0 := 0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:58,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:58,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:58,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:58,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:58,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:58,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:58,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:58,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:58,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:58,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:58,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:16:58,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1466#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-15 18:16:58,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {1466#(= 8464 |ssl3_accept_#t~mem47|)} assume 8480 == #t~mem47;havoc #t~mem47; {1461#false} is VALID [2022-04-15 18:16:58,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {1461#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {1461#false} is VALID [2022-04-15 18:16:58,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {1461#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem88.base, 904 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {1461#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {1461#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {1461#false} is VALID [2022-04-15 18:16:58,919 INFO L290 TraceCheckUtils]: 26: Hoare triple {1461#false} ~skip~0 := 0; {1461#false} is VALID [2022-04-15 18:16:58,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {1461#false} assume !false; {1461#false} is VALID [2022-04-15 18:16:58,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {1461#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {1461#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {1461#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {1461#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,920 INFO L290 TraceCheckUtils]: 32: Hoare triple {1461#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {1461#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,921 INFO L290 TraceCheckUtils]: 34: Hoare triple {1461#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,922 INFO L290 TraceCheckUtils]: 35: Hoare triple {1461#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,924 INFO L290 TraceCheckUtils]: 36: Hoare triple {1461#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,924 INFO L290 TraceCheckUtils]: 37: Hoare triple {1461#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {1461#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {1461#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,925 INFO L290 TraceCheckUtils]: 40: Hoare triple {1461#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,925 INFO L290 TraceCheckUtils]: 41: Hoare triple {1461#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,925 INFO L290 TraceCheckUtils]: 42: Hoare triple {1461#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,925 INFO L290 TraceCheckUtils]: 43: Hoare triple {1461#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,925 INFO L290 TraceCheckUtils]: 44: Hoare triple {1461#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,925 INFO L290 TraceCheckUtils]: 45: Hoare triple {1461#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,926 INFO L290 TraceCheckUtils]: 46: Hoare triple {1461#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,926 INFO L290 TraceCheckUtils]: 47: Hoare triple {1461#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,926 INFO L290 TraceCheckUtils]: 48: Hoare triple {1461#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,926 INFO L290 TraceCheckUtils]: 49: Hoare triple {1461#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,926 INFO L290 TraceCheckUtils]: 50: Hoare triple {1461#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,926 INFO L290 TraceCheckUtils]: 51: Hoare triple {1461#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,926 INFO L290 TraceCheckUtils]: 52: Hoare triple {1461#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,927 INFO L290 TraceCheckUtils]: 53: Hoare triple {1461#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,927 INFO L290 TraceCheckUtils]: 54: Hoare triple {1461#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,927 INFO L290 TraceCheckUtils]: 55: Hoare triple {1461#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,927 INFO L290 TraceCheckUtils]: 56: Hoare triple {1461#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,927 INFO L290 TraceCheckUtils]: 57: Hoare triple {1461#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,927 INFO L290 TraceCheckUtils]: 58: Hoare triple {1461#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,928 INFO L290 TraceCheckUtils]: 59: Hoare triple {1461#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,928 INFO L290 TraceCheckUtils]: 60: Hoare triple {1461#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-15 18:16:58,928 INFO L290 TraceCheckUtils]: 61: Hoare triple {1461#false} assume 8672 == #t~mem74;havoc #t~mem74; {1461#false} is VALID [2022-04-15 18:16:58,928 INFO L290 TraceCheckUtils]: 62: Hoare triple {1461#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {1461#false} is VALID [2022-04-15 18:16:58,928 INFO L290 TraceCheckUtils]: 63: Hoare triple {1461#false} assume !(4 == ~blastFlag~0); {1461#false} is VALID [2022-04-15 18:16:58,928 INFO L290 TraceCheckUtils]: 64: Hoare triple {1461#false} assume 5 == ~blastFlag~0; {1461#false} is VALID [2022-04-15 18:16:58,928 INFO L290 TraceCheckUtils]: 65: Hoare triple {1461#false} assume !false; {1461#false} is VALID [2022-04-15 18:16:58,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:16:58,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:16:58,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868595082] [2022-04-15 18:16:58,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868595082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:58,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:58,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:16:58,931 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:16:58,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1883281585] [2022-04-15 18:16:58,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1883281585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:58,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:58,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:16:58,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81474926] [2022-04-15 18:16:58,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:16:58,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 18:16:58,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:16:58,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:58,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:58,975 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:16:58,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:58,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:16:58,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:16:58,976 INFO L87 Difference]: Start difference. First operand 150 states and 227 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:00,997 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:02,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:02,095 INFO L93 Difference]: Finished difference Result 291 states and 437 transitions. [2022-04-15 18:17:02,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:17:02,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 18:17:02,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:17:02,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:02,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2022-04-15 18:17:02,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:02,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2022-04-15 18:17:02,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 437 transitions. [2022-04-15 18:17:02,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 437 edges. 437 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:02,417 INFO L225 Difference]: With dead ends: 291 [2022-04-15 18:17:02,417 INFO L226 Difference]: Without dead ends: 167 [2022-04-15 18:17:02,417 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:17:02,418 INFO L913 BasicCegarLoop]: 180 mSDtfsCounter, 24 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:17:02,418 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 462 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 353 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 18:17:02,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-15 18:17:02,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2022-04-15 18:17:02,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:17:02,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:02,427 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:02,427 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:02,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:02,433 INFO L93 Difference]: Finished difference Result 167 states and 247 transitions. [2022-04-15 18:17:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2022-04-15 18:17:02,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:02,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:02,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-15 18:17:02,434 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-15 18:17:02,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:02,440 INFO L93 Difference]: Finished difference Result 167 states and 247 transitions. [2022-04-15 18:17:02,440 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2022-04-15 18:17:02,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:02,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:02,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:17:02,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:17:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:02,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 226 transitions. [2022-04-15 18:17:02,446 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 226 transitions. Word has length 66 [2022-04-15 18:17:02,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:17:02,446 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 226 transitions. [2022-04-15 18:17:02,446 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:02,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 226 transitions. [2022-04-15 18:17:02,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:02,607 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 226 transitions. [2022-04-15 18:17:02,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 18:17:02,608 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:17:02,608 INFO L499 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1] [2022-04-15 18:17:02,609 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 18:17:02,609 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:17:02,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:17:02,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1264672313, now seen corresponding path program 1 times [2022-04-15 18:17:02,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:02,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1484209660] [2022-04-15 18:17:02,628 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 18:17:02,628 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:17:02,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1264672313, now seen corresponding path program 2 times [2022-04-15 18:17:02,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:17:02,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476784280] [2022-04-15 18:17:02,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:17:02,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:17:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:02,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:17:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:02,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {2695#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2688#true} is VALID [2022-04-15 18:17:02,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {2688#true} assume true; {2688#true} is VALID [2022-04-15 18:17:02,782 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2688#true} {2688#true} #665#return; {2688#true} is VALID [2022-04-15 18:17:02,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {2688#true} call ULTIMATE.init(); {2695#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:17:02,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2688#true} is VALID [2022-04-15 18:17:02,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {2688#true} assume true; {2688#true} is VALID [2022-04-15 18:17:02,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2688#true} {2688#true} #665#return; {2688#true} is VALID [2022-04-15 18:17:02,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {2688#true} call #t~ret162 := main(); {2688#true} is VALID [2022-04-15 18:17:02,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {2688#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {2688#true} is VALID [2022-04-15 18:17:02,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {2688#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {2688#true} is VALID [2022-04-15 18:17:02,789 INFO L272 TraceCheckUtils]: 7: Hoare triple {2688#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2688#true} is VALID [2022-04-15 18:17:02,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {2688#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;~blastFlag~0 := 0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:02,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:02,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:02,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:02,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:02,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:02,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:02,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:02,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:02,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:02,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:02,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:02,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:02,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {2694#(= 8464 |ssl3_accept_#t~mem48|)} is VALID [2022-04-15 18:17:02,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {2694#(= 8464 |ssl3_accept_#t~mem48|)} assume 8481 == #t~mem48;havoc #t~mem48; {2689#false} is VALID [2022-04-15 18:17:02,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {2689#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {2689#false} is VALID [2022-04-15 18:17:02,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {2689#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem88.base, 904 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {2689#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {2689#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {2689#false} is VALID [2022-04-15 18:17:02,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {2689#false} ~skip~0 := 0; {2689#false} is VALID [2022-04-15 18:17:02,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {2689#false} assume !false; {2689#false} is VALID [2022-04-15 18:17:02,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {2689#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {2689#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {2689#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {2689#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {2689#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {2689#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {2689#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {2689#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {2689#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,799 INFO L290 TraceCheckUtils]: 38: Hoare triple {2689#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,799 INFO L290 TraceCheckUtils]: 39: Hoare triple {2689#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,799 INFO L290 TraceCheckUtils]: 40: Hoare triple {2689#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,799 INFO L290 TraceCheckUtils]: 41: Hoare triple {2689#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,799 INFO L290 TraceCheckUtils]: 42: Hoare triple {2689#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,799 INFO L290 TraceCheckUtils]: 43: Hoare triple {2689#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {2689#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,800 INFO L290 TraceCheckUtils]: 45: Hoare triple {2689#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,800 INFO L290 TraceCheckUtils]: 46: Hoare triple {2689#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,800 INFO L290 TraceCheckUtils]: 47: Hoare triple {2689#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,800 INFO L290 TraceCheckUtils]: 48: Hoare triple {2689#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,800 INFO L290 TraceCheckUtils]: 49: Hoare triple {2689#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,800 INFO L290 TraceCheckUtils]: 50: Hoare triple {2689#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,800 INFO L290 TraceCheckUtils]: 51: Hoare triple {2689#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,800 INFO L290 TraceCheckUtils]: 52: Hoare triple {2689#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,801 INFO L290 TraceCheckUtils]: 53: Hoare triple {2689#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,801 INFO L290 TraceCheckUtils]: 54: Hoare triple {2689#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,801 INFO L290 TraceCheckUtils]: 55: Hoare triple {2689#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,801 INFO L290 TraceCheckUtils]: 56: Hoare triple {2689#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,801 INFO L290 TraceCheckUtils]: 57: Hoare triple {2689#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,801 INFO L290 TraceCheckUtils]: 58: Hoare triple {2689#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,801 INFO L290 TraceCheckUtils]: 59: Hoare triple {2689#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,801 INFO L290 TraceCheckUtils]: 60: Hoare triple {2689#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,801 INFO L290 TraceCheckUtils]: 61: Hoare triple {2689#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-15 18:17:02,802 INFO L290 TraceCheckUtils]: 62: Hoare triple {2689#false} assume 8672 == #t~mem74;havoc #t~mem74; {2689#false} is VALID [2022-04-15 18:17:02,802 INFO L290 TraceCheckUtils]: 63: Hoare triple {2689#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {2689#false} is VALID [2022-04-15 18:17:02,802 INFO L290 TraceCheckUtils]: 64: Hoare triple {2689#false} assume !(4 == ~blastFlag~0); {2689#false} is VALID [2022-04-15 18:17:02,802 INFO L290 TraceCheckUtils]: 65: Hoare triple {2689#false} assume 5 == ~blastFlag~0; {2689#false} is VALID [2022-04-15 18:17:02,802 INFO L290 TraceCheckUtils]: 66: Hoare triple {2689#false} assume !false; {2689#false} is VALID [2022-04-15 18:17:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:17:02,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:17:02,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476784280] [2022-04-15 18:17:02,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476784280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:02,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:02,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:17:02,803 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:17:02,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1484209660] [2022-04-15 18:17:02,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1484209660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:02,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:02,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:17:02,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854458856] [2022-04-15 18:17:02,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:17:02,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 18:17:02,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:17:02,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:02,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:02,863 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:17:02,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:02,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:17:02,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:17:02,864 INFO L87 Difference]: Start difference. First operand 150 states and 226 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:06,506 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:08,511 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:10,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:12,578 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:13,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:13,623 INFO L93 Difference]: Finished difference Result 289 states and 434 transitions. [2022-04-15 18:17:13,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:17:13,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 18:17:13,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:17:13,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-15 18:17:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:13,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-15 18:17:13,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 434 transitions. [2022-04-15 18:17:13,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:13,939 INFO L225 Difference]: With dead ends: 289 [2022-04-15 18:17:13,939 INFO L226 Difference]: Without dead ends: 165 [2022-04-15 18:17:13,940 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:17:13,941 INFO L913 BasicCegarLoop]: 182 mSDtfsCounter, 22 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:17:13,941 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 466 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 350 Invalid, 3 Unknown, 0 Unchecked, 8.0s Time] [2022-04-15 18:17:13,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-15 18:17:13,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 150. [2022-04-15 18:17:13,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:17:13,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 150 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 145 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:13,948 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 150 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 145 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:13,948 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 150 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 145 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:13,951 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2022-04-15 18:17:13,951 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2022-04-15 18:17:13,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:13,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:13,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 145 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-15 18:17:13,952 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 145 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-15 18:17:13,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:13,955 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2022-04-15 18:17:13,955 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2022-04-15 18:17:13,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:13,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:13,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:17:13,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:17:13,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 145 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:13,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 225 transitions. [2022-04-15 18:17:13,959 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 225 transitions. Word has length 67 [2022-04-15 18:17:13,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:17:13,959 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 225 transitions. [2022-04-15 18:17:13,959 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:13,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 225 transitions. [2022-04-15 18:17:14,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:14,110 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 225 transitions. [2022-04-15 18:17:14,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 18:17:14,111 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:17:14,111 INFO L499 BasicCegarLoop]: trace histogram [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, 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, 1] [2022-04-15 18:17:14,111 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 18:17:14,111 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:17:14,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:17:14,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1566814562, now seen corresponding path program 1 times [2022-04-15 18:17:14,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:14,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [75349881] [2022-04-15 18:17:14,124 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 18:17:14,124 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:17:14,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1566814562, now seen corresponding path program 2 times [2022-04-15 18:17:14,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:17:14,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997605429] [2022-04-15 18:17:14,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:17:14,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:17:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:14,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:17:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:14,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {3915#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3908#true} is VALID [2022-04-15 18:17:14,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {3908#true} assume true; {3908#true} is VALID [2022-04-15 18:17:14,268 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3908#true} {3908#true} #665#return; {3908#true} is VALID [2022-04-15 18:17:14,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {3908#true} call ULTIMATE.init(); {3915#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:17:14,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {3915#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3908#true} is VALID [2022-04-15 18:17:14,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {3908#true} assume true; {3908#true} is VALID [2022-04-15 18:17:14,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3908#true} {3908#true} #665#return; {3908#true} is VALID [2022-04-15 18:17:14,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {3908#true} call #t~ret162 := main(); {3908#true} is VALID [2022-04-15 18:17:14,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {3908#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3908#true} is VALID [2022-04-15 18:17:14,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {3908#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {3908#true} is VALID [2022-04-15 18:17:14,269 INFO L272 TraceCheckUtils]: 7: Hoare triple {3908#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3908#true} is VALID [2022-04-15 18:17:14,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {3908#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;~blastFlag~0 := 0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:14,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:14,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:14,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:14,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:14,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:14,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:14,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:14,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:14,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:14,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:14,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:14,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:14,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:14,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {3914#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-15 18:17:14,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {3914#(= 8464 |ssl3_accept_#t~mem49|)} assume 8482 == #t~mem49;havoc #t~mem49; {3909#false} is VALID [2022-04-15 18:17:14,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {3909#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {3909#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {3909#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {3909#false} is VALID [2022-04-15 18:17:14,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {3909#false} ~skip~0 := 0; {3909#false} is VALID [2022-04-15 18:17:14,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {3909#false} assume !false; {3909#false} is VALID [2022-04-15 18:17:14,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {3909#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {3909#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,278 INFO L290 TraceCheckUtils]: 31: Hoare triple {3909#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,278 INFO L290 TraceCheckUtils]: 32: Hoare triple {3909#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,278 INFO L290 TraceCheckUtils]: 33: Hoare triple {3909#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {3909#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,278 INFO L290 TraceCheckUtils]: 35: Hoare triple {3909#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,278 INFO L290 TraceCheckUtils]: 36: Hoare triple {3909#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,278 INFO L290 TraceCheckUtils]: 37: Hoare triple {3909#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,278 INFO L290 TraceCheckUtils]: 38: Hoare triple {3909#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,279 INFO L290 TraceCheckUtils]: 39: Hoare triple {3909#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,279 INFO L290 TraceCheckUtils]: 40: Hoare triple {3909#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,279 INFO L290 TraceCheckUtils]: 41: Hoare triple {3909#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,279 INFO L290 TraceCheckUtils]: 42: Hoare triple {3909#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,279 INFO L290 TraceCheckUtils]: 43: Hoare triple {3909#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,279 INFO L290 TraceCheckUtils]: 44: Hoare triple {3909#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,279 INFO L290 TraceCheckUtils]: 45: Hoare triple {3909#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,279 INFO L290 TraceCheckUtils]: 46: Hoare triple {3909#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,279 INFO L290 TraceCheckUtils]: 47: Hoare triple {3909#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,279 INFO L290 TraceCheckUtils]: 48: Hoare triple {3909#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,279 INFO L290 TraceCheckUtils]: 49: Hoare triple {3909#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,280 INFO L290 TraceCheckUtils]: 50: Hoare triple {3909#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,280 INFO L290 TraceCheckUtils]: 51: Hoare triple {3909#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,280 INFO L290 TraceCheckUtils]: 52: Hoare triple {3909#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,280 INFO L290 TraceCheckUtils]: 53: Hoare triple {3909#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,280 INFO L290 TraceCheckUtils]: 54: Hoare triple {3909#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,280 INFO L290 TraceCheckUtils]: 55: Hoare triple {3909#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,280 INFO L290 TraceCheckUtils]: 56: Hoare triple {3909#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,280 INFO L290 TraceCheckUtils]: 57: Hoare triple {3909#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,280 INFO L290 TraceCheckUtils]: 58: Hoare triple {3909#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,280 INFO L290 TraceCheckUtils]: 59: Hoare triple {3909#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,280 INFO L290 TraceCheckUtils]: 60: Hoare triple {3909#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,281 INFO L290 TraceCheckUtils]: 61: Hoare triple {3909#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-15 18:17:14,281 INFO L290 TraceCheckUtils]: 62: Hoare triple {3909#false} assume 8672 == #t~mem74;havoc #t~mem74; {3909#false} is VALID [2022-04-15 18:17:14,281 INFO L290 TraceCheckUtils]: 63: Hoare triple {3909#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {3909#false} is VALID [2022-04-15 18:17:14,281 INFO L290 TraceCheckUtils]: 64: Hoare triple {3909#false} assume !(4 == ~blastFlag~0); {3909#false} is VALID [2022-04-15 18:17:14,281 INFO L290 TraceCheckUtils]: 65: Hoare triple {3909#false} assume 5 == ~blastFlag~0; {3909#false} is VALID [2022-04-15 18:17:14,281 INFO L290 TraceCheckUtils]: 66: Hoare triple {3909#false} assume !false; {3909#false} is VALID [2022-04-15 18:17:14,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:17:14,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:17:14,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997605429] [2022-04-15 18:17:14,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997605429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:14,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:14,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:17:14,282 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:17:14,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [75349881] [2022-04-15 18:17:14,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [75349881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:14,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:14,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:17:14,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310537630] [2022-04-15 18:17:14,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:17:14,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 18:17:14,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:17:14,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:14,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:14,331 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:17:14,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:14,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:17:14,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:17:14,343 INFO L87 Difference]: Start difference. First operand 150 states and 225 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:16,365 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:17,310 INFO L93 Difference]: Finished difference Result 288 states and 432 transitions. [2022-04-15 18:17:17,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:17:17,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 18:17:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:17:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:17,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-04-15 18:17:17,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:17,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-04-15 18:17:17,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 432 transitions. [2022-04-15 18:17:17,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 432 edges. 432 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:17,622 INFO L225 Difference]: With dead ends: 288 [2022-04-15 18:17:17,622 INFO L226 Difference]: Without dead ends: 164 [2022-04-15 18:17:17,623 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:17:17,623 INFO L913 BasicCegarLoop]: 183 mSDtfsCounter, 20 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 18:17:17,624 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 468 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 347 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 18:17:17,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-15 18:17:17,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2022-04-15 18:17:17,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:17:17,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 150 states, 145 states have (on average 1.5172413793103448) internal successors, (220), 145 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:17,630 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 150 states, 145 states have (on average 1.5172413793103448) internal successors, (220), 145 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:17,630 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 150 states, 145 states have (on average 1.5172413793103448) internal successors, (220), 145 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:17,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:17,633 INFO L93 Difference]: Finished difference Result 164 states and 242 transitions. [2022-04-15 18:17:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2022-04-15 18:17:17,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:17,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:17,633 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5172413793103448) internal successors, (220), 145 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 164 states. [2022-04-15 18:17:17,633 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5172413793103448) internal successors, (220), 145 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 164 states. [2022-04-15 18:17:17,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:17,636 INFO L93 Difference]: Finished difference Result 164 states and 242 transitions. [2022-04-15 18:17:17,636 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2022-04-15 18:17:17,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:17,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:17,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:17:17,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:17:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5172413793103448) internal successors, (220), 145 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 224 transitions. [2022-04-15 18:17:17,638 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 224 transitions. Word has length 67 [2022-04-15 18:17:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:17:17,639 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 224 transitions. [2022-04-15 18:17:17,639 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:17,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 224 transitions. [2022-04-15 18:17:17,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:17,808 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 224 transitions. [2022-04-15 18:17:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 18:17:17,811 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:17:17,811 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:17:17,812 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 18:17:17,812 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:17:17,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:17:17,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1167044530, now seen corresponding path program 1 times [2022-04-15 18:17:17,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:17,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1188053845] [2022-04-15 18:17:17,858 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 18:17:17,859 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:17:17,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1167044530, now seen corresponding path program 2 times [2022-04-15 18:17:17,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:17:17,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250624164] [2022-04-15 18:17:17,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:17:17,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:17:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:17,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:17:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:17:17,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {5131#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5124#true} is VALID [2022-04-15 18:17:17,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {5124#true} assume true; {5124#true} is VALID [2022-04-15 18:17:17,978 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5124#true} {5124#true} #665#return; {5124#true} is VALID [2022-04-15 18:17:17,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {5124#true} call ULTIMATE.init(); {5131#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:17:17,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {5131#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5124#true} is VALID [2022-04-15 18:17:17,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {5124#true} assume true; {5124#true} is VALID [2022-04-15 18:17:17,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5124#true} {5124#true} #665#return; {5124#true} is VALID [2022-04-15 18:17:17,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {5124#true} call #t~ret162 := main(); {5124#true} is VALID [2022-04-15 18:17:17,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {5124#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {5124#true} is VALID [2022-04-15 18:17:17,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {5124#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {5124#true} is VALID [2022-04-15 18:17:17,980 INFO L272 TraceCheckUtils]: 7: Hoare triple {5124#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5124#true} is VALID [2022-04-15 18:17:17,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {5124#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;~blastFlag~0 := 0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:17,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:17,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:17,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:17,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:17,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:17,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-15 18:17:17,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {5130#(= 8464 |ssl3_accept_#t~mem42|)} is VALID [2022-04-15 18:17:17,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {5130#(= 8464 |ssl3_accept_#t~mem42|)} assume 12292 == #t~mem42;havoc #t~mem42; {5125#false} is VALID [2022-04-15 18:17:17,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {5125#false} call write~int(1, ~s.base, 60 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {5125#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {5125#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {5125#false} is VALID [2022-04-15 18:17:17,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {5125#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {5125#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {5125#false} is VALID [2022-04-15 18:17:17,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {5125#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {5125#false} is VALID [2022-04-15 18:17:17,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {5125#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {5125#false} is VALID [2022-04-15 18:17:17,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {5125#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {5125#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem86 := read~int(#t~mem85.base, 132 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 132 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {5125#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {5125#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {5125#false} is VALID [2022-04-15 18:17:17,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {5125#false} ~skip~0 := 0; {5125#false} is VALID [2022-04-15 18:17:17,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {5125#false} assume !false; {5125#false} is VALID [2022-04-15 18:17:17,987 INFO L290 TraceCheckUtils]: 30: Hoare triple {5125#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {5125#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {5125#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,987 INFO L290 TraceCheckUtils]: 33: Hoare triple {5125#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,987 INFO L290 TraceCheckUtils]: 34: Hoare triple {5125#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,987 INFO L290 TraceCheckUtils]: 35: Hoare triple {5125#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,987 INFO L290 TraceCheckUtils]: 36: Hoare triple {5125#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,987 INFO L290 TraceCheckUtils]: 37: Hoare triple {5125#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,987 INFO L290 TraceCheckUtils]: 38: Hoare triple {5125#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {5125#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {5125#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {5125#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,988 INFO L290 TraceCheckUtils]: 42: Hoare triple {5125#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,988 INFO L290 TraceCheckUtils]: 43: Hoare triple {5125#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,988 INFO L290 TraceCheckUtils]: 44: Hoare triple {5125#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,988 INFO L290 TraceCheckUtils]: 45: Hoare triple {5125#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,988 INFO L290 TraceCheckUtils]: 46: Hoare triple {5125#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,988 INFO L290 TraceCheckUtils]: 47: Hoare triple {5125#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,988 INFO L290 TraceCheckUtils]: 48: Hoare triple {5125#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,988 INFO L290 TraceCheckUtils]: 49: Hoare triple {5125#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,988 INFO L290 TraceCheckUtils]: 50: Hoare triple {5125#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,988 INFO L290 TraceCheckUtils]: 51: Hoare triple {5125#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,989 INFO L290 TraceCheckUtils]: 52: Hoare triple {5125#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,989 INFO L290 TraceCheckUtils]: 53: Hoare triple {5125#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,989 INFO L290 TraceCheckUtils]: 54: Hoare triple {5125#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,989 INFO L290 TraceCheckUtils]: 55: Hoare triple {5125#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,989 INFO L290 TraceCheckUtils]: 56: Hoare triple {5125#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,989 INFO L290 TraceCheckUtils]: 57: Hoare triple {5125#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,989 INFO L290 TraceCheckUtils]: 58: Hoare triple {5125#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,989 INFO L290 TraceCheckUtils]: 59: Hoare triple {5125#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,989 INFO L290 TraceCheckUtils]: 60: Hoare triple {5125#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,989 INFO L290 TraceCheckUtils]: 61: Hoare triple {5125#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,989 INFO L290 TraceCheckUtils]: 62: Hoare triple {5125#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-15 18:17:17,990 INFO L290 TraceCheckUtils]: 63: Hoare triple {5125#false} assume 8672 == #t~mem74;havoc #t~mem74; {5125#false} is VALID [2022-04-15 18:17:17,990 INFO L290 TraceCheckUtils]: 64: Hoare triple {5125#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {5125#false} is VALID [2022-04-15 18:17:17,990 INFO L290 TraceCheckUtils]: 65: Hoare triple {5125#false} assume !(4 == ~blastFlag~0); {5125#false} is VALID [2022-04-15 18:17:17,990 INFO L290 TraceCheckUtils]: 66: Hoare triple {5125#false} assume 5 == ~blastFlag~0; {5125#false} is VALID [2022-04-15 18:17:17,990 INFO L290 TraceCheckUtils]: 67: Hoare triple {5125#false} assume !false; {5125#false} is VALID [2022-04-15 18:17:17,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:17:17,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:17:17,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250624164] [2022-04-15 18:17:17,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250624164] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:17,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:17,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:17:17,991 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:17:17,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1188053845] [2022-04-15 18:17:17,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1188053845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:17:17,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:17:17,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:17:17,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440833662] [2022-04-15 18:17:17,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:17:17,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 18:17:17,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:17:17,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:18,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:18,039 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:17:18,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:18,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:17:18,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:17:18,040 INFO L87 Difference]: Start difference. First operand 150 states and 224 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:20,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:21,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:21,006 INFO L93 Difference]: Finished difference Result 287 states and 430 transitions. [2022-04-15 18:17:21,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:17:21,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 18:17:21,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:17:21,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:21,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 430 transitions. [2022-04-15 18:17:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 430 transitions. [2022-04-15 18:17:21,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 430 transitions. [2022-04-15 18:17:21,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:21,310 INFO L225 Difference]: With dead ends: 287 [2022-04-15 18:17:21,310 INFO L226 Difference]: Without dead ends: 163 [2022-04-15 18:17:21,311 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:17:21,311 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 26 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 18:17:21,312 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 18:17:21,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-15 18:17:21,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2022-04-15 18:17:21,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:17:21,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.5103448275862068) internal successors, (219), 145 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:21,318 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.5103448275862068) internal successors, (219), 145 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:21,318 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.5103448275862068) internal successors, (219), 145 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:21,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:21,320 INFO L93 Difference]: Finished difference Result 163 states and 240 transitions. [2022-04-15 18:17:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2022-04-15 18:17:21,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:21,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:21,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5103448275862068) internal successors, (219), 145 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 163 states. [2022-04-15 18:17:21,321 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5103448275862068) internal successors, (219), 145 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 163 states. [2022-04-15 18:17:21,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:17:21,323 INFO L93 Difference]: Finished difference Result 163 states and 240 transitions. [2022-04-15 18:17:21,323 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2022-04-15 18:17:21,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:17:21,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:17:21,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:17:21,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:17:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5103448275862068) internal successors, (219), 145 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 223 transitions. [2022-04-15 18:17:21,326 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 223 transitions. Word has length 68 [2022-04-15 18:17:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:17:21,326 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 223 transitions. [2022-04-15 18:17:21,326 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:17:21,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 223 transitions. [2022-04-15 18:17:21,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:17:21,508 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 223 transitions. [2022-04-15 18:17:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 18:17:21,509 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:17:21,509 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:17:21,509 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 18:17:21,509 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:17:21,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:17:21,510 INFO L85 PathProgramCache]: Analyzing trace with hash -958455226, now seen corresponding path program 1 times [2022-04-15 18:17:21,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:17:21,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1081172784] [2022-04-15 18:17:21,616 ERROR L250 FreeRefinementEngine]: Caught unknown exception: Undeclared function symbol (* (Array Int (Array Int Int)) Int) [2022-04-15 18:17:21,616 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-15 18:17:21,616 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (* (Array Int (Array Int Int)) Int) at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1615) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.mul(SmtUtils.java:597) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrUtils.matrixVectorMultiplicationWithVariables(QvasrUtils.java:226) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrSummarizer.intVasrAbstractionToFormula(QvasrSummarizer.java:177) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrSummarizer.summarizeLoop(QvasrSummarizer.java:140) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrLoopSummarization.getQvasrAcceleration(QvasrLoopSummarization.java:87) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorQvasr.accelerateLoop(AcceleratorQvasr.java:91) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:246) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 18:17:21,620 INFO L158 Benchmark]: Toolchain (without parser) took 38694.17ms. Allocated memory was 184.5MB in the beginning and 251.7MB in the end (delta: 67.1MB). Free memory was 132.8MB in the beginning and 169.5MB in the end (delta: -36.6MB). Peak memory consumption was 30.7MB. Max. memory is 8.0GB. [2022-04-15 18:17:21,621 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 184.5MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 18:17:21,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 517.76ms. Allocated memory is still 184.5MB. Free memory was 132.7MB in the beginning and 140.8MB in the end (delta: -8.2MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2022-04-15 18:17:21,621 INFO L158 Benchmark]: Boogie Preprocessor took 135.42ms. Allocated memory is still 184.5MB. Free memory was 140.8MB in the beginning and 130.9MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 18:17:21,621 INFO L158 Benchmark]: RCFGBuilder took 2258.75ms. Allocated memory was 184.5MB in the beginning and 251.7MB in the end (delta: 67.1MB). Free memory was 130.9MB in the beginning and 201.3MB in the end (delta: -70.4MB). Peak memory consumption was 76.9MB. Max. memory is 8.0GB. [2022-04-15 18:17:21,622 INFO L158 Benchmark]: TraceAbstraction took 35774.26ms. Allocated memory is still 251.7MB. Free memory was 200.7MB in the beginning and 169.5MB in the end (delta: 31.3MB). Peak memory consumption was 30.8MB. Max. memory is 8.0GB. [2022-04-15 18:17:21,623 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.13ms. Allocated memory is still 184.5MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 517.76ms. Allocated memory is still 184.5MB. Free memory was 132.7MB in the beginning and 140.8MB in the end (delta: -8.2MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 135.42ms. Allocated memory is still 184.5MB. Free memory was 140.8MB in the beginning and 130.9MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 2258.75ms. Allocated memory was 184.5MB in the beginning and 251.7MB in the end (delta: 67.1MB). Free memory was 130.9MB in the beginning and 201.3MB in the end (delta: -70.4MB). Peak memory consumption was 76.9MB. Max. memory is 8.0GB. * TraceAbstraction took 35774.26ms. Allocated memory is still 251.7MB. Free memory was 200.7MB in the beginning and 169.5MB in the end (delta: 31.3MB). Peak memory consumption was 30.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (* (Array Int (Array Int Int)) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (* (Array Int (Array Int Int)) Int): de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1615) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 18:17:21,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...