/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain EqDomain -i ../sv-benchmarks/c/heap-data/packet_filter.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 10:59:59,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 10:59:59,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 10:59:59,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 10:59:59,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 10:59:59,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 10:59:59,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 10:59:59,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 10:59:59,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 10:59:59,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 10:59:59,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 10:59:59,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 10:59:59,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 10:59:59,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 10:59:59,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 10:59:59,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 10:59:59,928 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 10:59:59,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 10:59:59,931 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 10:59:59,935 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 10:59:59,936 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 10:59:59,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 10:59:59,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 10:59:59,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 10:59:59,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 10:59:59,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 10:59:59,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 10:59:59,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 10:59:59,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 10:59:59,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 10:59:59,951 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 10:59:59,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 10:59:59,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 10:59:59,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 10:59:59,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 10:59:59,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 10:59:59,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 10:59:59,955 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 10:59:59,955 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 10:59:59,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 10:59:59,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 10:59:59,957 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 10:59:59,985 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 10:59:59,985 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 10:59:59,986 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 10:59:59,986 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 10:59:59,987 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 10:59:59,987 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 10:59:59,987 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 10:59:59,987 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 10:59:59,987 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 10:59:59,987 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 10:59:59,988 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 10:59:59,988 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 10:59:59,988 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 10:59:59,989 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 10:59:59,989 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 10:59:59,989 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 10:59:59,989 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 10:59:59,989 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 10:59:59,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 10:59:59,990 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 10:59:59,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 10:59:59,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 10:59:59,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 10:59:59,991 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 10:59:59,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 10:59:59,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 10:59:59,991 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 10:59:59,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 10:59:59,991 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 10:59:59,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 10:59:59,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 10:59:59,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 10:59:59,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 10:59:59,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 10:59:59,992 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 10:59:59,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 10:59:59,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 10:59:59,993 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 10:59:59,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 10:59:59,993 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 10:59:59,993 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 10:59:59,993 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> EqDomain [2023-04-01 11:00:00,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 11:00:00,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 11:00:00,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 11:00:00,261 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 11:00:00,262 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 11:00:00,263 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/packet_filter.i [2023-04-01 11:00:01,455 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 11:00:01,698 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 11:00:01,699 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i [2023-04-01 11:00:01,717 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3573bc375/4d9f13968bee42789e192babf71fd765/FLAG83e800793 [2023-04-01 11:00:01,733 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3573bc375/4d9f13968bee42789e192babf71fd765 [2023-04-01 11:00:01,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 11:00:01,737 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 11:00:01,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 11:00:01,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 11:00:01,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 11:00:01,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 11:00:01" (1/1) ... [2023-04-01 11:00:01,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1291cc91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:00:01, skipping insertion in model container [2023-04-01 11:00:01,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 11:00:01" (1/1) ... [2023-04-01 11:00:01,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 11:00:01,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 11:00:02,033 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i[23925,23938] [2023-04-01 11:00:02,046 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i[24159,24172] [2023-04-01 11:00:02,059 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 11:00:02,072 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 11:00:02,124 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i[23925,23938] [2023-04-01 11:00:02,135 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i[24159,24172] [2023-04-01 11:00:02,145 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 11:00:02,164 WARN L667 CHandler]: The function __VERIFIER_nondet_charp is called, but not defined or handled by StandardFunctionHandler. [2023-04-01 11:00:02,170 INFO L208 MainTranslator]: Completed translation [2023-04-01 11:00:02,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:00:02 WrapperNode [2023-04-01 11:00:02,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 11:00:02,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 11:00:02,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 11:00:02,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 11:00:02,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:00:02" (1/1) ... [2023-04-01 11:00:02,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:00:02" (1/1) ... [2023-04-01 11:00:02,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:00:02" (1/1) ... [2023-04-01 11:00:02,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:00:02" (1/1) ... [2023-04-01 11:00:02,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:00:02" (1/1) ... [2023-04-01 11:00:02,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:00:02" (1/1) ... [2023-04-01 11:00:02,246 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:00:02" (1/1) ... [2023-04-01 11:00:02,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:00:02" (1/1) ... [2023-04-01 11:00:02,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 11:00:02,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 11:00:02,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 11:00:02,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 11:00:02,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:00:02" (1/1) ... [2023-04-01 11:00:02,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 11:00:02,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:00:02,297 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) [2023-04-01 11:00:02,302 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 [2023-04-01 11:00:02,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 11:00:02,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 11:00:02,333 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 11:00:02,333 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2023-04-01 11:00:02,334 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2023-04-01 11:00:02,334 INFO L138 BoogieDeclarations]: Found implementation of procedure receive [2023-04-01 11:00:02,334 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2023-04-01 11:00:02,334 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2023-04-01 11:00:02,334 INFO L138 BoogieDeclarations]: Found implementation of procedure process_prio_queue [2023-04-01 11:00:02,334 INFO L138 BoogieDeclarations]: Found implementation of procedure process_normal_queue [2023-04-01 11:00:02,334 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 11:00:02,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2023-04-01 11:00:02,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 11:00:02,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2023-04-01 11:00:02,334 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 11:00:02,334 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 11:00:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-01 11:00:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-01 11:00:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 11:00:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 11:00:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2023-04-01 11:00:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2023-04-01 11:00:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-04-01 11:00:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-04-01 11:00:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-04-01 11:00:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-04-01 11:00:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-04-01 11:00:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-04-01 11:00:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-04-01 11:00:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-04-01 11:00:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-04-01 11:00:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-04-01 11:00:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-04-01 11:00:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-04-01 11:00:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-04-01 11:00:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-04-01 11:00:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-04-01 11:00:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-04-01 11:00:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-04-01 11:00:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-04-01 11:00:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-04-01 11:00:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-04-01 11:00:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-04-01 11:00:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-04-01 11:00:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-04-01 11:00:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-04-01 11:00:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-04-01 11:00:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-04-01 11:00:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-04-01 11:00:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-04-01 11:00:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-04-01 11:00:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-04-01 11:00:02,339 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-04-01 11:00:02,339 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-04-01 11:00:02,339 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-04-01 11:00:02,339 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-04-01 11:00:02,339 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-04-01 11:00:02,339 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-04-01 11:00:02,339 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-04-01 11:00:02,339 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-04-01 11:00:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-04-01 11:00:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-04-01 11:00:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-04-01 11:00:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-04-01 11:00:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-04-01 11:00:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-04-01 11:00:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-04-01 11:00:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-04-01 11:00:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-04-01 11:00:02,341 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-04-01 11:00:02,341 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-04-01 11:00:02,341 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-04-01 11:00:02,341 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-01 11:00:02,341 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-04-01 11:00:02,341 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-04-01 11:00:02,341 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-04-01 11:00:02,341 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2023-04-01 11:00:02,341 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-04-01 11:00:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-04-01 11:00:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-04-01 11:00:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-04-01 11:00:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-04-01 11:00:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-04-01 11:00:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-04-01 11:00:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-01 11:00:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-04-01 11:00:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-04-01 11:00:02,343 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-04-01 11:00:02,343 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-04-01 11:00:02,343 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-04-01 11:00:02,343 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-04-01 11:00:02,343 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-04-01 11:00:02,343 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-04-01 11:00:02,343 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-04-01 11:00:02,343 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-04-01 11:00:02,343 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-04-01 11:00:02,343 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-04-01 11:00:02,344 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-04-01 11:00:02,344 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-04-01 11:00:02,344 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-04-01 11:00:02,344 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-04-01 11:00:02,344 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-04-01 11:00:02,344 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-04-01 11:00:02,344 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-04-01 11:00:02,344 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-04-01 11:00:02,344 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-04-01 11:00:02,345 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-04-01 11:00:02,345 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-04-01 11:00:02,345 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-04-01 11:00:02,345 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-04-01 11:00:02,345 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-04-01 11:00:02,345 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-04-01 11:00:02,345 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-04-01 11:00:02,345 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-04-01 11:00:02,345 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-04-01 11:00:02,346 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-04-01 11:00:02,346 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-04-01 11:00:02,346 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-04-01 11:00:02,346 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-04-01 11:00:02,346 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-04-01 11:00:02,346 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-04-01 11:00:02,346 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-04-01 11:00:02,346 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-04-01 11:00:02,346 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-04-01 11:00:02,347 INFO L130 BoogieDeclarations]: Found specification of procedure receive [2023-04-01 11:00:02,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-04-01 11:00:02,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 11:00:02,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-04-01 11:00:02,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 11:00:02,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-04-01 11:00:02,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 11:00:02,347 INFO L130 BoogieDeclarations]: Found specification of procedure send [2023-04-01 11:00:02,347 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2023-04-01 11:00:02,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-01 11:00:02,348 INFO L130 BoogieDeclarations]: Found specification of procedure process_prio_queue [2023-04-01 11:00:02,348 INFO L130 BoogieDeclarations]: Found specification of procedure process_normal_queue [2023-04-01 11:00:02,348 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 11:00:02,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-04-01 11:00:02,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 11:00:02,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 11:00:02,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 11:00:02,549 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 11:00:02,551 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 11:00:02,922 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 11:00:03,020 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 11:00:03,021 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-04-01 11:00:03,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 11:00:03 BoogieIcfgContainer [2023-04-01 11:00:03,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 11:00:03,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 11:00:03,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 11:00:03,035 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 11:00:03,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 11:00:01" (1/3) ... [2023-04-01 11:00:03,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fadeca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 11:00:03, skipping insertion in model container [2023-04-01 11:00:03,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:00:02" (2/3) ... [2023-04-01 11:00:03,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fadeca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 11:00:03, skipping insertion in model container [2023-04-01 11:00:03,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 11:00:03" (3/3) ... [2023-04-01 11:00:03,038 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2023-04-01 11:00:03,055 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 11:00:03,055 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-04-01 11:00:03,113 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 11:00:03,119 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@56c3f4c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 11:00:03,119 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-04-01 11:00:03,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 33 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-04-01 11:00:03,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-04-01 11:00:03,129 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:00:03,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:00:03,130 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:00:03,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:00:03,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1105903737, now seen corresponding path program 1 times [2023-04-01 11:00:03,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:00:03,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013293977] [2023-04-01 11:00:03,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:00:03,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:00:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:00:03,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:00:03,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:00:03,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013293977] [2023-04-01 11:00:03,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013293977] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:00:03,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 11:00:03,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-04-01 11:00:03,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593312891] [2023-04-01 11:00:03,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:00:03,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-04-01 11:00:03,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:00:03,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-04-01 11:00:03,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-01 11:00:03,370 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 33 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 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) [2023-04-01 11:00:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:00:03,437 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2023-04-01 11:00:03,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-04-01 11:00:03,440 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 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 12 [2023-04-01 11:00:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:00:03,448 INFO L225 Difference]: With dead ends: 79 [2023-04-01 11:00:03,448 INFO L226 Difference]: Without dead ends: 46 [2023-04-01 11:00:03,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-01 11:00:03,457 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 11:00:03,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 11:00:03,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-04-01 11:00:03,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-04-01 11:00:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-04-01 11:00:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2023-04-01 11:00:03,489 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 12 [2023-04-01 11:00:03,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:00:03,490 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-04-01 11:00:03,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 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) [2023-04-01 11:00:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2023-04-01 11:00:03,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-01 11:00:03,491 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:00:03,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:00:03,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 11:00:03,491 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:00:03,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:00:03,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1394897449, now seen corresponding path program 1 times [2023-04-01 11:00:03,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:00:03,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895390369] [2023-04-01 11:00:03,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:00:03,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:00:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:00:03,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:00:03,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:00:03,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895390369] [2023-04-01 11:00:03,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895390369] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:00:03,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 11:00:03,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-01 11:00:03,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682271994] [2023-04-01 11:00:03,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:00:03,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 11:00:03,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:00:03,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 11:00:03,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-01 11:00:03,729 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 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) [2023-04-01 11:00:03,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:00:03,928 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2023-04-01 11:00:03,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 11:00:03,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 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 13 [2023-04-01 11:00:03,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:00:03,931 INFO L225 Difference]: With dead ends: 75 [2023-04-01 11:00:03,931 INFO L226 Difference]: Without dead ends: 55 [2023-04-01 11:00:03,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-04-01 11:00:03,933 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 11:00:03,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 193 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 11:00:03,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-04-01 11:00:03,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2023-04-01 11:00:03,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-04-01 11:00:03,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2023-04-01 11:00:03,954 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 13 [2023-04-01 11:00:03,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:00:03,956 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2023-04-01 11:00:03,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 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) [2023-04-01 11:00:03,959 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2023-04-01 11:00:03,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-04-01 11:00:03,960 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:00:03,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:00:03,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 11:00:03,960 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:00:03,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:00:03,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1872797766, now seen corresponding path program 1 times [2023-04-01 11:00:03,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:00:03,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314593101] [2023-04-01 11:00:03,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:00:03,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:00:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:00:04,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:00:04,226 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:00:04,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314593101] [2023-04-01 11:00:04,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314593101] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:00:04,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 11:00:04,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-01 11:00:04,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570169809] [2023-04-01 11:00:04,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:00:04,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-01 11:00:04,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:00:04,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-01 11:00:04,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-04-01 11:00:04,229 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 11:00:04,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:00:04,508 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2023-04-01 11:00:04,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 11:00:04,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-04-01 11:00:04,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:00:04,510 INFO L225 Difference]: With dead ends: 80 [2023-04-01 11:00:04,510 INFO L226 Difference]: Without dead ends: 62 [2023-04-01 11:00:04,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-04-01 11:00:04,511 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 22 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 11:00:04,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 191 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 11:00:04,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-04-01 11:00:04,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2023-04-01 11:00:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-04-01 11:00:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2023-04-01 11:00:04,518 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 18 [2023-04-01 11:00:04,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:00:04,518 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2023-04-01 11:00:04,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 11:00:04,519 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2023-04-01 11:00:04,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-04-01 11:00:04,519 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:00:04,519 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:00:04,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-01 11:00:04,520 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:00:04,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:00:04,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1471296298, now seen corresponding path program 1 times [2023-04-01 11:00:04,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:00:04,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441005262] [2023-04-01 11:00:04,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:00:04,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:00:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:00:05,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:00:05,388 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:00:05,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441005262] [2023-04-01 11:00:05,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441005262] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 11:00:05,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948354918] [2023-04-01 11:00:05,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:00:05,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:00:05,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:00:05,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 11:00:05,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 11:00:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:00:05,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 45 conjunts are in the unsatisfiable core [2023-04-01 11:00:05,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:00:05,662 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-01 11:00:05,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-04-01 11:00:05,745 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-01 11:00:05,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-04-01 11:00:05,796 WARN L861 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_74 (Array Int Int)) (v_ArrVal_77 (Array Int Int)) (|v_receive_~#packet~0.base_10| Int)) (and (= (select |c_old(#valid)| |v_receive_~#packet~0.base_10|) 0) (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_10| v_ArrVal_77) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_10| v_ArrVal_74) |c_#memory_$Pointer$.base|))) is different from true [2023-04-01 11:00:05,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 11:00:05,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-01 11:00:05,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 11:00:05,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-01 11:00:05,848 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-01 11:00:05,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-04-01 11:00:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:00:05,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:00:06,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948354918] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 11:00:06,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1198422901] [2023-04-01 11:00:06,137 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-01 11:00:06,138 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:00:06,141 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:00:06,145 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:00:06,145 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:00:06,250 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 49 for LOIs [2023-04-01 11:00:08,224 INFO L197 IcfgInterpreter]: Interpreting procedure process_prio_queue with input of size 128 for LOIs [2023-04-01 11:00:08,586 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 11:00:08,598 INFO L197 IcfgInterpreter]: Interpreting procedure receive with input of size 128 for LOIs [2023-04-01 11:00:08,650 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 11:00:11,081 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '730#(and (= |old(#length)| |#length|) (or (not (= process_prio_queue_~node~1.offset 0)) (not (= process_prio_queue_~node~1.base 0))) (= |#memory_int| |old(#memory_int)|) (= process_prio_queue_~q.offset process_prio_queue_~node~1.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= (mod (select (select |#memory_int| process_prio_queue_~node~1.base) (+ process_prio_queue_~node~1.offset 4)) 4294967296) 1)) (exists ((|v_old(#memory_int)_BEFORE_CALL_5| (Array Int (Array Int Int))) (|v_old(#length)_BEFORE_CALL_5| (Array Int Int)) (|v_old(#valid)_BEFORE_CALL_5| (Array Int Int)) (|v_main_~#normal_queue~0.base_BEFORE_CALL_5| Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_6| Int) (|v_main_~#prio_queue~0.offset_BEFORE_CALL_6| Int) (|v_old(#memory_$Pointer$.base)_BEFORE_CALL_5| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| (Array Int (Array Int Int))) (|v_main_~#normal_queue~0.offset_BEFORE_CALL_5| Int)) (and (= |process_prio_queue_#in~q.offset| (select (select |old(#memory_$Pointer$.offset)| |v_main_~#prio_queue~0.base_BEFORE_CALL_6|) |v_main_~#prio_queue~0.offset_BEFORE_CALL_6|)) (or (and (not (= |v_old(#valid)_BEFORE_CALL_5| (select |v_old(#memory_int)_BEFORE_CALL_5| 1))) (not (= 0 |v_main_~#normal_queue~0.base_BEFORE_CALL_5|)) (= (select |v_old(#valid)_BEFORE_CALL_5| 1) 1) (= (select (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_5| |v_main_~#normal_queue~0.base_BEFORE_CALL_5|) 0) 0) (= |v_main_~#normal_queue~0.offset_BEFORE_CALL_5| 0) (= (select (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_main_~#prio_queue~0.base_BEFORE_CALL_6|) 0) 0) (not (= |#StackHeapBarrier| |v_main_~#normal_queue~0.base_BEFORE_CALL_5|)) (= (select (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_5| |v_main_~#prio_queue~0.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_BEFORE_CALL_5| 2) 1) (= |v_main_~#prio_queue~0.offset_BEFORE_CALL_6| 0) (not (= (select |v_old(#memory_int)_BEFORE_CALL_5| 1) (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_main_~#prio_queue~0.base_BEFORE_CALL_6|))) (= 48 (select (select |v_old(#memory_int)_BEFORE_CALL_5| 1) 0)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_6| |#StackHeapBarrier|)) (= (select (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_main_~#normal_queue~0.base_BEFORE_CALL_5|) 0) 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_6| 0)) (not (= |#StackHeapBarrier| 0)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_5| 1) 1) 0) (not (= (select |v_old(#memory_int)_BEFORE_CALL_5| 1) (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_5| |v_main_~#normal_queue~0.base_BEFORE_CALL_5|))) (not (= (select |v_old(#memory_int)_BEFORE_CALL_5| 1) (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_5| |v_main_~#prio_queue~0.base_BEFORE_CALL_6|))) (not (= (select |v_old(#memory_int)_BEFORE_CALL_5| 1) |v_old(#length)_BEFORE_CALL_5|)) (= (select |v_old(#valid)_BEFORE_CALL_5| 0) 0) (= |#NULL.offset| 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_6| 2)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_5| 1) (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5| |v_main_~#normal_queue~0.base_BEFORE_CALL_5|))) (not (= |v_old(#valid)_BEFORE_CALL_5| |v_old(#length)_BEFORE_CALL_5|)) (= 2 (select |v_old(#length)_BEFORE_CALL_5| 1)) (= 16 (select |v_old(#length)_BEFORE_CALL_5| 2)) (= (select |v_old(#valid)_BEFORE_CALL_5| |v_main_~#prio_queue~0.base_BEFORE_CALL_6|) 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_6| 1)) (= |#NULL.base| 0)) (and (not (= |v_old(#valid)_BEFORE_CALL_5| (select |v_old(#memory_int)_BEFORE_CALL_5| 1))) (= |old(#memory_int)| |v_old(#memory_int)_BEFORE_CALL_5|) (not (= 0 |v_main_~#normal_queue~0.base_BEFORE_CALL_5|)) (= (select |v_old(#valid)_BEFORE_CALL_5| 1) 1) (= |v_main_~#normal_queue~0.offset_BEFORE_CALL_5| 0) (not (= |#StackHeapBarrier| |v_main_~#normal_queue~0.base_BEFORE_CALL_5|)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_5| 1) (select |old(#memory_$Pointer$.base)| |v_main_~#normal_queue~0.base_BEFORE_CALL_5|))) (= (select (select |old(#memory_$Pointer$.offset)| |v_main_~#normal_queue~0.base_BEFORE_CALL_5|) 0) 0) (= (select (select |old(#memory_$Pointer$.base)| |v_main_~#normal_queue~0.base_BEFORE_CALL_5|) 0) 0) (not (= (select |old(#memory_$Pointer$.offset)| |v_main_~#prio_queue~0.base_BEFORE_CALL_6|) (select |v_old(#memory_int)_BEFORE_CALL_5| 1))) (= (select |v_old(#valid)_BEFORE_CALL_5| 2) 1) (= |v_main_~#prio_queue~0.offset_BEFORE_CALL_6| 0) (= 48 (select (select |v_old(#memory_int)_BEFORE_CALL_5| 1) 0)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_6| |#StackHeapBarrier|)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_6| 0)) (not (= |#StackHeapBarrier| 0)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_5| 1) (select |old(#memory_$Pointer$.base)| |v_main_~#prio_queue~0.base_BEFORE_CALL_6|))) (= (select (select |v_old(#memory_int)_BEFORE_CALL_5| 1) 1) 0) (= (select (select |old(#memory_$Pointer$.offset)| |v_main_~#prio_queue~0.base_BEFORE_CALL_6|) 0) 0) (not (= (select |old(#memory_$Pointer$.offset)| |v_main_~#normal_queue~0.base_BEFORE_CALL_5|) (select |v_old(#memory_int)_BEFORE_CALL_5| 1))) (= |old(#memory_$Pointer$.offset)| |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_5|) (not (= (select |v_old(#memory_int)_BEFORE_CALL_5| 1) |v_old(#length)_BEFORE_CALL_5|)) (= (select |v_old(#valid)_BEFORE_CALL_5| 0) 0) (= |#NULL.offset| 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_6| 2)) (= (select (select |old(#memory_$Pointer$.base)| |v_main_~#prio_queue~0.base_BEFORE_CALL_6|) 0) 0) (not (= |v_old(#valid)_BEFORE_CALL_5| |v_old(#length)_BEFORE_CALL_5|)) (= 2 (select |v_old(#length)_BEFORE_CALL_5| 1)) (= 16 (select |v_old(#length)_BEFORE_CALL_5| 2)) (= (select |v_old(#valid)_BEFORE_CALL_5| |v_main_~#prio_queue~0.base_BEFORE_CALL_6|) 0) (= |old(#memory_$Pointer$.base)| |v_old(#memory_$Pointer$.base)_BEFORE_CALL_5|) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_6| 1)) (= |#NULL.base| 0))) (= (select (select |old(#memory_$Pointer$.base)| |v_main_~#prio_queue~0.base_BEFORE_CALL_6|) |v_main_~#prio_queue~0.offset_BEFORE_CALL_6|) |process_prio_queue_#in~q.base|))) (<= 500 (mod (select (select |#memory_int| process_prio_queue_~node~1.base) process_prio_queue_~node~1.offset) 4294967296)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= process_prio_queue_~q.base process_prio_queue_~node~1.base) (= process_prio_queue_~q.base |process_prio_queue_#in~q.base|) (= |old(#valid)| |#valid|) (= |process_prio_queue_#in~q.offset| process_prio_queue_~q.offset))' at error location [2023-04-01 11:00:11,081 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 11:00:11,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 11:00:11,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2023-04-01 11:00:11,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163197653] [2023-04-01 11:00:11,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 11:00:11,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-01 11:00:11,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:00:11,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-01 11:00:11,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=509, Unknown=18, NotChecked=46, Total=650 [2023-04-01 11:00:11,086 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 10 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-01 11:00:12,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:00:12,196 INFO L93 Difference]: Finished difference Result 115 states and 141 transitions. [2023-04-01 11:00:12,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-01 11:00:12,197 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2023-04-01 11:00:12,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:00:12,198 INFO L225 Difference]: With dead ends: 115 [2023-04-01 11:00:12,198 INFO L226 Difference]: Without dead ends: 95 [2023-04-01 11:00:12,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=115, Invalid=860, Unknown=21, NotChecked=60, Total=1056 [2023-04-01 11:00:12,200 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 59 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-01 11:00:12,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 171 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 208 Invalid, 0 Unknown, 117 Unchecked, 0.6s Time] [2023-04-01 11:00:12,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-04-01 11:00:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 59. [2023-04-01 11:00:12,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-04-01 11:00:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2023-04-01 11:00:12,210 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 21 [2023-04-01 11:00:12,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:00:12,210 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2023-04-01 11:00:12,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-01 11:00:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2023-04-01 11:00:12,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-04-01 11:00:12,211 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:00:12,211 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-01 11:00:12,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 11:00:12,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:00:12,412 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:00:12,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:00:12,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1485444679, now seen corresponding path program 1 times [2023-04-01 11:00:12,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:00:12,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361711597] [2023-04-01 11:00:12,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:00:12,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:00:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:00:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:00:13,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:00:13,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361711597] [2023-04-01 11:00:13,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361711597] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 11:00:13,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001808331] [2023-04-01 11:00:13,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:00:13,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:00:13,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:00:13,065 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 11:00:13,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 11:00:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:00:13,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 45 conjunts are in the unsatisfiable core [2023-04-01 11:00:13,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:00:13,253 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-04-01 11:00:13,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-04-01 11:00:13,289 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-01 11:00:13,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-04-01 11:00:13,319 WARN L861 $PredicateComparison]: unable to prove that (exists ((|v_receive_~#packet~0.base_19| Int) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_19| v_ArrVal_147)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_19| v_ArrVal_148)) (= (select |c_old(#valid)| |v_receive_~#packet~0.base_19|) 0))) is different from true [2023-04-01 11:00:13,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 11:00:13,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-01 11:00:13,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 11:00:13,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-01 11:00:13,343 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-01 11:00:13,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-04-01 11:00:13,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:00:13,392 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:00:13,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001808331] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 11:00:13,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [762853545] [2023-04-01 11:00:13,674 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-04-01 11:00:13,674 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:00:13,674 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:00:13,674 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:00:13,675 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:00:13,726 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 49 for LOIs [2023-04-01 11:00:15,047 INFO L197 IcfgInterpreter]: Interpreting procedure process_normal_queue with input of size 28 for LOIs [2023-04-01 11:00:15,088 INFO L197 IcfgInterpreter]: Interpreting procedure process_prio_queue with input of size 128 for LOIs [2023-04-01 11:00:15,209 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 11:00:15,212 INFO L197 IcfgInterpreter]: Interpreting procedure receive with input of size 143 for LOIs [2023-04-01 11:00:15,253 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 11:00:17,490 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1144#(and (= |old(#length)| |#length|) (= |process_normal_queue_#in~q.base| process_normal_queue_~q.base) (= |#memory_int| |old(#memory_int)|) (= process_normal_queue_~node~2.offset process_normal_queue_~q.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or (not (= process_normal_queue_~node~2.base 0)) (not (= process_normal_queue_~node~2.offset 0))) (= process_normal_queue_~node~2.base process_normal_queue_~q.base) (exists ((|v_process_normal_queue_#t~mem26_11| Int) (|v_process_normal_queue_#t~short27_10| Bool) (|v_process_normal_queue_#t~mem26_10| Int)) (and (or (and (= |v_process_normal_queue_#t~mem26_11| |v_process_normal_queue_#t~mem26_10|) (not |v_process_normal_queue_#t~short27_10|)) (and (= |v_process_normal_queue_#t~mem26_11| (select (select |#memory_int| process_normal_queue_~node~2.base) process_normal_queue_~node~2.offset)) |v_process_normal_queue_#t~short27_10| (< (mod |v_process_normal_queue_#t~mem26_11| 4294967296) 500))) (or (and |v_process_normal_queue_#t~short27_10| (= (mod (select (select |#memory_int| process_normal_queue_~node~2.base) (+ process_normal_queue_~node~2.offset 4)) 4294967296) 0)) (and (not (= (mod (select (select |#memory_int| process_normal_queue_~node~2.base) (+ process_normal_queue_~node~2.offset 4)) 4294967296) 0)) (not |v_process_normal_queue_#t~short27_10|))))) (= |process_normal_queue_#in~q.offset| process_normal_queue_~q.offset) (exists ((|v_main_~#normal_queue~0.offset_BEFORE_CALL_18| Int) (|v_main_~#normal_queue~0.base_BEFORE_CALL_18| Int)) (and (= |process_normal_queue_#in~q.base| (select (select |old(#memory_$Pointer$.base)| |v_main_~#normal_queue~0.base_BEFORE_CALL_18|) |v_main_~#normal_queue~0.offset_BEFORE_CALL_18|)) (= (select (select |old(#memory_$Pointer$.offset)| |v_main_~#normal_queue~0.base_BEFORE_CALL_18|) |v_main_~#normal_queue~0.offset_BEFORE_CALL_18|) |process_normal_queue_#in~q.offset|))) (= |old(#valid)| |#valid|))' at error location [2023-04-01 11:00:17,490 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 11:00:17,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 11:00:17,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2023-04-01 11:00:17,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646335036] [2023-04-01 11:00:17,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 11:00:17,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-01 11:00:17,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:00:17,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-01 11:00:17,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=919, Unknown=17, NotChecked=62, Total=1122 [2023-04-01 11:00:17,492 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-01 11:00:18,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:00:18,238 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2023-04-01 11:00:18,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-01 11:00:18,239 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2023-04-01 11:00:18,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:00:18,240 INFO L225 Difference]: With dead ends: 106 [2023-04-01 11:00:18,240 INFO L226 Difference]: Without dead ends: 88 [2023-04-01 11:00:18,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=157, Invalid=1234, Unknown=19, NotChecked=72, Total=1482 [2023-04-01 11:00:18,241 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 68 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-01 11:00:18,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 173 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 208 Invalid, 0 Unknown, 116 Unchecked, 0.5s Time] [2023-04-01 11:00:18,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-04-01 11:00:18,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 54. [2023-04-01 11:00:18,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 37 states have internal predecessors, (44), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-04-01 11:00:18,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2023-04-01 11:00:18,249 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 26 [2023-04-01 11:00:18,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:00:18,249 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2023-04-01 11:00:18,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-01 11:00:18,249 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2023-04-01 11:00:18,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-04-01 11:00:18,250 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:00:18,250 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-01 11:00:18,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-04-01 11:00:18,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:00:18,456 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:00:18,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:00:18,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1721036824, now seen corresponding path program 1 times [2023-04-01 11:00:18,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:00:18,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17595170] [2023-04-01 11:00:18,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:00:18,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:00:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:00:19,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:00:19,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:00:19,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17595170] [2023-04-01 11:00:19,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17595170] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 11:00:19,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275435850] [2023-04-01 11:00:19,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:00:19,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:00:19,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:00:19,642 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 11:00:19,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 11:00:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:00:19,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 68 conjunts are in the unsatisfiable core [2023-04-01 11:00:19,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:00:19,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-04-01 11:00:19,988 INFO L321 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2023-04-01 11:00:19,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2023-04-01 11:00:20,021 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-04-01 11:00:20,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2023-04-01 11:00:20,062 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-04-01 11:00:20,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2023-04-01 11:00:20,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-04-01 11:00:20,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-04-01 11:00:20,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-04-01 11:00:20,156 INFO L321 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2023-04-01 11:00:20,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 80 [2023-04-01 11:00:20,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-04-01 11:00:20,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-04-01 11:00:20,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-04-01 11:00:20,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 15 [2023-04-01 11:00:20,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-04-01 11:00:20,397 INFO L321 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2023-04-01 11:00:20,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 48 [2023-04-01 11:00:20,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2023-04-01 11:00:20,718 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 11:00:20,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2023-04-01 11:00:20,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2023-04-01 11:00:20,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-04-01 11:00:20,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-04-01 11:00:20,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 11:00:20,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 56 [2023-04-01 11:00:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:00:20,872 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:00:21,427 INFO L321 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2023-04-01 11:00:21,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 115 treesize of output 91 [2023-04-01 11:00:21,456 INFO L321 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-04-01 11:00:21,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 93 treesize of output 77 [2023-04-01 11:00:21,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2023-04-01 11:00:21,612 INFO L321 Elim1Store]: treesize reduction 107, result has 0.9 percent of original size [2023-04-01 11:00:21,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 115 treesize of output 1 [2023-04-01 11:00:21,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-04-01 11:00:21,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:00:21,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275435850] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:00:21,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1212593625] [2023-04-01 11:00:21,782 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-04-01 11:00:21,782 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:00:21,783 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:00:21,783 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:00:21,783 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:00:21,813 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 49 for LOIs [2023-04-01 11:00:23,253 INFO L197 IcfgInterpreter]: Interpreting procedure append_to_queue with input of size 123 for LOIs [2023-04-01 11:00:23,285 INFO L197 IcfgInterpreter]: Interpreting procedure process_prio_queue with input of size 128 for LOIs [2023-04-01 11:00:23,513 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 11:00:23,515 INFO L197 IcfgInterpreter]: Interpreting procedure receive with input of size 143 for LOIs [2023-04-01 11:00:23,555 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 11:00:24,355 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_113| (Array Int Int)) (|v_main_~#new_packet~0.base_BEFORE_CALL_25| Int) (|v_#length_84| (Array Int Int))) (and (not (= |v_main_~#new_packet~0.base_BEFORE_CALL_25| 0)) (= (store |v_#valid_113| |v_main_~#new_packet~0.base_BEFORE_CALL_25| 1) |c_old(#valid)|) (= (select |v_#valid_113| |v_main_~#new_packet~0.base_BEFORE_CALL_25|) 0) (< |c_#StackHeapBarrier| |v_main_~#new_packet~0.base_BEFORE_CALL_25|) (= |c_old(#length)| (store |v_#length_84| |v_main_~#new_packet~0.base_BEFORE_CALL_25| 12)))) (let ((.cse0 (not (= |c_#StackHeapBarrier| 0))) (.cse6 (= |c_#NULL.offset| 0)) (.cse7 (= |c_#NULL.base| 0))) (or (let ((.cse2 (select |c_old(#memory_int)| 1))) (and .cse0 (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_35| Int) (|v_old(#length)_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_BEFORE_CALL_30| (Array Int Int))) (let ((.cse1 (select |c_old(#memory_$Pointer$.base)| |v_main_~#prio_queue~0.base_BEFORE_CALL_35|)) (.cse3 (select |c_old(#memory_$Pointer$.offset)| |v_main_~#prio_queue~0.base_BEFORE_CALL_35|))) (and (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_35| 0)) (= (select |v_old(#valid)_BEFORE_CALL_30| 1) 1) (= 2 (select |v_old(#length)_BEFORE_CALL_30| 1)) (= (select .cse1 0) 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_35| |c_#StackHeapBarrier|)) (not (= |v_old(#valid)_BEFORE_CALL_30| |v_old(#length)_BEFORE_CALL_30|)) (not (= .cse2 .cse3)) (= (select |v_old(#length)_BEFORE_CALL_30| 2) 16) (= (select |v_old(#valid)_BEFORE_CALL_30| |v_main_~#prio_queue~0.base_BEFORE_CALL_35|) 0) (not (= |v_old(#valid)_BEFORE_CALL_30| .cse2)) (= (select |v_old(#valid)_BEFORE_CALL_30| 0) 0) (not (= .cse2 |v_old(#length)_BEFORE_CALL_30|)) (= (select |v_old(#valid)_BEFORE_CALL_30| 2) 1) (not (= .cse2 .cse1)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_35| 1)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_35| 2)) (= (select .cse3 0) 0)))) (exists ((|v_main_~#normal_queue~0.base_BEFORE_CALL_34| Int)) (let ((.cse4 (select |c_old(#memory_$Pointer$.base)| |v_main_~#normal_queue~0.base_BEFORE_CALL_34|)) (.cse5 (select |c_old(#memory_$Pointer$.offset)| |v_main_~#normal_queue~0.base_BEFORE_CALL_34|))) (and (= (select .cse4 0) 0) (not (= .cse4 .cse2)) (not (= |v_main_~#normal_queue~0.base_BEFORE_CALL_34| |c_#StackHeapBarrier|)) (= (select .cse5 0) 0) (not (= |v_main_~#normal_queue~0.base_BEFORE_CALL_34| 0)) (not (= .cse5 .cse2))))) (= 48 (select .cse2 0)) .cse6 .cse7 (= (select .cse2 1) 0))) (and .cse0 .cse6 (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_35| Int) (|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_30| (Array Int (Array Int Int))) (|v_main_~#normal_queue~0.base_BEFORE_CALL_34| Int) (|v_old(#length)_BEFORE_CALL_30| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_BEFORE_CALL_30| (Array Int (Array Int Int))) (|v_old(#memory_int)_BEFORE_CALL_30| (Array Int (Array Int Int))) (|v_old(#valid)_BEFORE_CALL_30| (Array Int Int))) (let ((.cse9 (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_30| |v_main_~#prio_queue~0.base_BEFORE_CALL_35|)) (.cse10 (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_30| |v_main_~#normal_queue~0.base_BEFORE_CALL_34|)) (.cse8 (select |v_old(#memory_int)_BEFORE_CALL_30| 1)) (.cse11 (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_30| |v_main_~#prio_queue~0.base_BEFORE_CALL_35|)) (.cse12 (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_30| |v_main_~#normal_queue~0.base_BEFORE_CALL_34|))) (and (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_35| 0)) (= (select |v_old(#valid)_BEFORE_CALL_30| 1) 1) (not (= |v_old(#valid)_BEFORE_CALL_30| .cse8)) (not (= |v_old(#length)_BEFORE_CALL_30| .cse8)) (= (select .cse9 0) 0) (= 2 (select |v_old(#length)_BEFORE_CALL_30| 1)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_35| |c_#StackHeapBarrier|)) (not (= |v_main_~#normal_queue~0.base_BEFORE_CALL_34| |c_#StackHeapBarrier|)) (not (= .cse8 .cse10)) (not (= .cse8 .cse9)) (not (= |v_old(#valid)_BEFORE_CALL_30| |v_old(#length)_BEFORE_CALL_30|)) (not (= .cse8 .cse11)) (= (select .cse8 1) 0) (= (select |v_old(#length)_BEFORE_CALL_30| 2) 16) (= 48 (select .cse8 0)) (= (select |v_old(#valid)_BEFORE_CALL_30| |v_main_~#prio_queue~0.base_BEFORE_CALL_35|) 0) (= (select .cse10 0) 0) (not (= .cse8 .cse12)) (= (select .cse11 0) 0) (= (select |v_old(#valid)_BEFORE_CALL_30| 0) 0) (not (= |v_main_~#normal_queue~0.base_BEFORE_CALL_34| 0)) (= (select |v_old(#valid)_BEFORE_CALL_30| 2) 1) (= (select .cse12 0) 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_35| 1)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_35| 2))))) .cse7))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|)) is different from true [2023-04-01 11:00:24,366 WARN L861 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_113| (Array Int Int)) (|v_main_~#new_packet~0.base_BEFORE_CALL_25| Int) (|v_#length_84| (Array Int Int))) (and (not (= |v_main_~#new_packet~0.base_BEFORE_CALL_25| 0)) (= (store |v_#valid_113| |v_main_~#new_packet~0.base_BEFORE_CALL_25| 1) |c_old(#valid)|) (= (select |v_#valid_113| |v_main_~#new_packet~0.base_BEFORE_CALL_25|) 0) (< |c_#StackHeapBarrier| |v_main_~#new_packet~0.base_BEFORE_CALL_25|) (= |c_old(#length)| (store |v_#length_84| |v_main_~#new_packet~0.base_BEFORE_CALL_25| 12)))) (exists ((|v_receive_#t~ret5.offset_5| Int) (|v_#memory_$Pointer$.base_82| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_81| (Array Int (Array Int Int))) (|v_receive_#t~nondet4_5| Int) (|v_receive_~#packet~0.base_5| Int) (|v_receive_#t~nondet3_5| Int) (|v_#memory_$Pointer$.offset_82| (Array Int (Array Int Int))) (|v_receive_#t~ret5.base_5| Int) (|v_#memory_$Pointer$.offset_81| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_#memory_$Pointer$.offset_82| |v_receive_~#packet~0.base_5|)) (.cse0 (select |v_#memory_$Pointer$.offset_81| |v_receive_~#packet~0.base_5|)) (.cse2 (select |c_#memory_int| |v_receive_~#packet~0.base_5|)) (.cse6 (select |v_#memory_$Pointer$.base_81| |v_receive_~#packet~0.base_5|)) (.cse7 (select |v_#memory_$Pointer$.base_82| |v_receive_~#packet~0.base_5|))) (and (not (= |v_receive_~#packet~0.base_5| 0)) (<= 0 (+ |v_receive_#t~nondet4_5| 2147483648)) (= |c_#valid| (store |c_old(#valid)| |v_receive_~#packet~0.base_5| 0)) (= (store |v_#memory_$Pointer$.offset_81| |v_receive_~#packet~0.base_5| (store .cse0 8 |v_receive_#t~ret5.offset_5|)) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_5| (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_5|) 0 (select .cse1 0))) |v_#memory_$Pointer$.offset_82|) (= (store |v_#memory_$Pointer$.offset_82| |v_receive_~#packet~0.base_5| (store .cse1 4 (select .cse0 4))) |v_#memory_$Pointer$.offset_81|) (= |c_receive_#res.payload.offset| (select (select |c_#memory_$Pointer$.offset| |v_receive_~#packet~0.base_5|) 8)) (= |c_receive_#res.size| (select .cse2 0)) (< |c_#StackHeapBarrier| |v_receive_~#packet~0.base_5|) (= (select .cse2 4) |c_receive_#res.prio|) (<= |v_receive_#t~nondet4_5| 2147483647) (let ((.cse5 (= |v_receive_#t~nondet4_5| 0)) (.cse3 (store (select |c_old(#memory_int)| |v_receive_~#packet~0.base_5|) 0 |v_receive_#t~nondet3_5|)) (.cse4 (select .cse2 8))) (or (and (= |c_#memory_int| (store |c_old(#memory_int)| |v_receive_~#packet~0.base_5| (store (store .cse3 4 1) 8 .cse4))) .cse5) (and (not .cse5) (= (store |c_old(#memory_int)| |v_receive_~#packet~0.base_5| (store (store .cse3 4 0) 8 .cse4)) |c_#memory_int|)))) (= (store |c_old(#length)| |v_receive_~#packet~0.base_5| 12) |c_#length|) (= (store |v_#memory_$Pointer$.base_81| |v_receive_~#packet~0.base_5| (store .cse6 4 (select .cse7 4))) |v_#memory_$Pointer$.base_82|) (= (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_5| (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_5|) 0 (select .cse6 0))) |v_#memory_$Pointer$.base_81|) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_82| |v_receive_~#packet~0.base_5| (store .cse7 8 |v_receive_#t~ret5.base_5|))) (= 0 (select |c_old(#valid)| |v_receive_~#packet~0.base_5|)) (= |c_receive_#res.payload.base| (select (select |c_#memory_$Pointer$.base| |v_receive_~#packet~0.base_5|) 8))))) (let ((.cse8 (not (= |c_#StackHeapBarrier| 0))) (.cse14 (= |c_#NULL.offset| 0)) (.cse15 (= |c_#NULL.base| 0))) (or (let ((.cse10 (select |c_old(#memory_int)| 1))) (and .cse8 (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_35| Int) (|v_old(#length)_BEFORE_CALL_30| (Array Int Int)) (|v_old(#valid)_BEFORE_CALL_30| (Array Int Int))) (let ((.cse9 (select |c_old(#memory_$Pointer$.base)| |v_main_~#prio_queue~0.base_BEFORE_CALL_35|)) (.cse11 (select |c_old(#memory_$Pointer$.offset)| |v_main_~#prio_queue~0.base_BEFORE_CALL_35|))) (and (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_35| 0)) (= (select |v_old(#valid)_BEFORE_CALL_30| 1) 1) (= 2 (select |v_old(#length)_BEFORE_CALL_30| 1)) (= (select .cse9 0) 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_35| |c_#StackHeapBarrier|)) (not (= |v_old(#valid)_BEFORE_CALL_30| |v_old(#length)_BEFORE_CALL_30|)) (not (= .cse10 .cse11)) (= (select |v_old(#length)_BEFORE_CALL_30| 2) 16) (= (select |v_old(#valid)_BEFORE_CALL_30| |v_main_~#prio_queue~0.base_BEFORE_CALL_35|) 0) (not (= |v_old(#valid)_BEFORE_CALL_30| .cse10)) (= (select |v_old(#valid)_BEFORE_CALL_30| 0) 0) (not (= .cse10 |v_old(#length)_BEFORE_CALL_30|)) (= (select |v_old(#valid)_BEFORE_CALL_30| 2) 1) (not (= .cse10 .cse9)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_35| 1)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_35| 2)) (= (select .cse11 0) 0)))) (exists ((|v_main_~#normal_queue~0.base_BEFORE_CALL_34| Int)) (let ((.cse12 (select |c_old(#memory_$Pointer$.base)| |v_main_~#normal_queue~0.base_BEFORE_CALL_34|)) (.cse13 (select |c_old(#memory_$Pointer$.offset)| |v_main_~#normal_queue~0.base_BEFORE_CALL_34|))) (and (= (select .cse12 0) 0) (not (= .cse12 .cse10)) (not (= |v_main_~#normal_queue~0.base_BEFORE_CALL_34| |c_#StackHeapBarrier|)) (= (select .cse13 0) 0) (not (= |v_main_~#normal_queue~0.base_BEFORE_CALL_34| 0)) (not (= .cse13 .cse10))))) (= 48 (select .cse10 0)) .cse14 .cse15 (= (select .cse10 1) 0))) (and .cse8 .cse14 (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_35| Int) (|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_30| (Array Int (Array Int Int))) (|v_main_~#normal_queue~0.base_BEFORE_CALL_34| Int) (|v_old(#length)_BEFORE_CALL_30| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_BEFORE_CALL_30| (Array Int (Array Int Int))) (|v_old(#memory_int)_BEFORE_CALL_30| (Array Int (Array Int Int))) (|v_old(#valid)_BEFORE_CALL_30| (Array Int Int))) (let ((.cse17 (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_30| |v_main_~#prio_queue~0.base_BEFORE_CALL_35|)) (.cse18 (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_30| |v_main_~#normal_queue~0.base_BEFORE_CALL_34|)) (.cse16 (select |v_old(#memory_int)_BEFORE_CALL_30| 1)) (.cse19 (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_30| |v_main_~#prio_queue~0.base_BEFORE_CALL_35|)) (.cse20 (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_30| |v_main_~#normal_queue~0.base_BEFORE_CALL_34|))) (and (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_35| 0)) (= (select |v_old(#valid)_BEFORE_CALL_30| 1) 1) (not (= |v_old(#valid)_BEFORE_CALL_30| .cse16)) (not (= |v_old(#length)_BEFORE_CALL_30| .cse16)) (= (select .cse17 0) 0) (= 2 (select |v_old(#length)_BEFORE_CALL_30| 1)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_35| |c_#StackHeapBarrier|)) (not (= |v_main_~#normal_queue~0.base_BEFORE_CALL_34| |c_#StackHeapBarrier|)) (not (= .cse16 .cse18)) (not (= .cse16 .cse17)) (not (= |v_old(#valid)_BEFORE_CALL_30| |v_old(#length)_BEFORE_CALL_30|)) (not (= .cse16 .cse19)) (= (select .cse16 1) 0) (= (select |v_old(#length)_BEFORE_CALL_30| 2) 16) (= 48 (select .cse16 0)) (= (select |v_old(#valid)_BEFORE_CALL_30| |v_main_~#prio_queue~0.base_BEFORE_CALL_35|) 0) (= (select .cse18 0) 0) (not (= .cse16 .cse20)) (= (select .cse19 0) 0) (= (select |v_old(#valid)_BEFORE_CALL_30| 0) 0) (not (= |v_main_~#normal_queue~0.base_BEFORE_CALL_34| 0)) (= (select |v_old(#valid)_BEFORE_CALL_30| 2) 1) (= (select .cse20 0) 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_35| 1)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_35| 2))))) .cse15)))) is different from true [2023-04-01 11:00:28,861 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1587#(and (= |old(#length)| |#length|) (or (not (= process_prio_queue_~node~1.offset 0)) (not (= process_prio_queue_~node~1.base 0))) (= |#memory_int| |old(#memory_int)|) (= process_prio_queue_~q.offset process_prio_queue_~node~1.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= (mod (select (select |#memory_int| process_prio_queue_~node~1.base) (+ process_prio_queue_~node~1.offset 4)) 4294967296) 1)) (<= 500 (mod (select (select |#memory_int| process_prio_queue_~node~1.base) process_prio_queue_~node~1.offset) 4294967296)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= process_prio_queue_~q.base process_prio_queue_~node~1.base) (= process_prio_queue_~q.base |process_prio_queue_#in~q.base|) (exists ((|v_old(#length)_BEFORE_CALL_27| (Array Int Int)) (|v_main_~#normal_queue~0.offset_BEFORE_CALL_31| Int) (|v_old(#memory_$Pointer$.base)_BEFORE_CALL_27| (Array Int (Array Int Int))) (|v_main_~#normal_queue~0.base_BEFORE_CALL_31| Int) (|v_main_~#prio_queue~0.offset_BEFORE_CALL_31| Int) (|v_old(#memory_int)_BEFORE_CALL_27| (Array Int (Array Int Int))) (|v_old(#valid)_BEFORE_CALL_27| (Array Int Int)) (|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_27| (Array Int (Array Int Int))) (|v_main_~#prio_queue~0.base_BEFORE_CALL_32| Int)) (and (= (select (select |old(#memory_$Pointer$.base)| |v_main_~#prio_queue~0.base_BEFORE_CALL_32|) |v_main_~#prio_queue~0.offset_BEFORE_CALL_31|) |process_prio_queue_#in~q.base|) (= |process_prio_queue_#in~q.offset| (select (select |old(#memory_$Pointer$.offset)| |v_main_~#prio_queue~0.base_BEFORE_CALL_32|) |v_main_~#prio_queue~0.offset_BEFORE_CALL_31|)) (or (and (= (select (select |old(#memory_$Pointer$.offset)| |v_main_~#prio_queue~0.base_BEFORE_CALL_32|) 0) 0) (= |v_main_~#normal_queue~0.offset_BEFORE_CALL_31| 0) (= (select |v_old(#valid)_BEFORE_CALL_27| |v_main_~#prio_queue~0.base_BEFORE_CALL_32|) 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_27| 1) 0) 48) (= 0 (select (select |old(#memory_$Pointer$.base)| |v_main_~#normal_queue~0.base_BEFORE_CALL_31|) 0)) (not (= |v_old(#valid)_BEFORE_CALL_27| (select |v_old(#memory_int)_BEFORE_CALL_27| 1))) (not (= |v_old(#valid)_BEFORE_CALL_27| |v_old(#length)_BEFORE_CALL_27|)) (= (select |v_old(#length)_BEFORE_CALL_27| 1) 2) (not (= (select |old(#memory_$Pointer$.offset)| |v_main_~#prio_queue~0.base_BEFORE_CALL_32|) (select |v_old(#memory_int)_BEFORE_CALL_27| 1))) (not (= (select |v_old(#memory_int)_BEFORE_CALL_27| 1) |v_old(#length)_BEFORE_CALL_27|)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_32| 1)) (not (= |v_main_~#normal_queue~0.base_BEFORE_CALL_31| |#StackHeapBarrier|)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_32| 0)) (= (select |v_old(#valid)_BEFORE_CALL_27| 1) 1) (= |v_old(#memory_$Pointer$.base)_BEFORE_CALL_27| |old(#memory_$Pointer$.base)|) (= (select (select |old(#memory_$Pointer$.offset)| |v_main_~#normal_queue~0.base_BEFORE_CALL_31|) 0) 0) (= (select |v_old(#valid)_BEFORE_CALL_27| 0) 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_27| 1) 1) 0) (= (select |v_old(#valid)_BEFORE_CALL_27| 2) 1) (not (= |v_main_~#normal_queue~0.base_BEFORE_CALL_31| 0)) (not (= |#StackHeapBarrier| 0)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_32| 2)) (= |old(#memory_$Pointer$.offset)| |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_27|) (= (select |v_old(#length)_BEFORE_CALL_27| 2) 16) (not (= (select |old(#memory_$Pointer$.offset)| |v_main_~#normal_queue~0.base_BEFORE_CALL_31|) (select |v_old(#memory_int)_BEFORE_CALL_27| 1))) (= |v_main_~#prio_queue~0.offset_BEFORE_CALL_31| 0) (= |#NULL.offset| 0) (not (= (select |v_old(#memory_int)_BEFORE_CALL_27| 1) (select |old(#memory_$Pointer$.base)| |v_main_~#normal_queue~0.base_BEFORE_CALL_31|))) (not (= (select |old(#memory_$Pointer$.base)| |v_main_~#prio_queue~0.base_BEFORE_CALL_32|) (select |v_old(#memory_int)_BEFORE_CALL_27| 1))) (= |old(#memory_int)| |v_old(#memory_int)_BEFORE_CALL_27|) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_32| |#StackHeapBarrier|)) (= (select (select |old(#memory_$Pointer$.base)| |v_main_~#prio_queue~0.base_BEFORE_CALL_32|) 0) 0) (= |#NULL.base| 0)) (and (= |v_main_~#normal_queue~0.offset_BEFORE_CALL_31| 0) (= (select |v_old(#valid)_BEFORE_CALL_27| |v_main_~#prio_queue~0.base_BEFORE_CALL_32|) 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_27| 1) 0) 48) (not (= |v_old(#valid)_BEFORE_CALL_27| (select |v_old(#memory_int)_BEFORE_CALL_27| 1))) (not (= |v_old(#valid)_BEFORE_CALL_27| |v_old(#length)_BEFORE_CALL_27|)) (= (select |v_old(#length)_BEFORE_CALL_27| 1) 2) (= (select (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_27| |v_main_~#prio_queue~0.base_BEFORE_CALL_32|) 0) 0) (not (= (select |v_old(#memory_int)_BEFORE_CALL_27| 1) |v_old(#length)_BEFORE_CALL_27|)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_32| 1)) (not (= |v_main_~#normal_queue~0.base_BEFORE_CALL_31| |#StackHeapBarrier|)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_32| 0)) (= (select |v_old(#valid)_BEFORE_CALL_27| 1) 1) (not (= (select |v_old(#memory_int)_BEFORE_CALL_27| 1) (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_27| |v_main_~#normal_queue~0.base_BEFORE_CALL_31|))) (= (select |v_old(#valid)_BEFORE_CALL_27| 0) 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_27| 1) 1) 0) (= (select |v_old(#valid)_BEFORE_CALL_27| 2) 1) (not (= |v_main_~#normal_queue~0.base_BEFORE_CALL_31| 0)) (not (= |#StackHeapBarrier| 0)) (= (select (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_27| |v_main_~#normal_queue~0.base_BEFORE_CALL_31|) 0) 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_32| 2)) (= (select |v_old(#length)_BEFORE_CALL_27| 2) 16) (not (= (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_27| |v_main_~#prio_queue~0.base_BEFORE_CALL_32|) (select |v_old(#memory_int)_BEFORE_CALL_27| 1))) (= (select (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_27| |v_main_~#prio_queue~0.base_BEFORE_CALL_32|) 0) 0) (not (= (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_27| |v_main_~#prio_queue~0.base_BEFORE_CALL_32|) (select |v_old(#memory_int)_BEFORE_CALL_27| 1))) (= |v_main_~#prio_queue~0.offset_BEFORE_CALL_31| 0) (= (select (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_27| |v_main_~#normal_queue~0.base_BEFORE_CALL_31|) 0) 0) (= |#NULL.offset| 0) (not (= (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_27| |v_main_~#normal_queue~0.base_BEFORE_CALL_31|) (select |v_old(#memory_int)_BEFORE_CALL_27| 1))) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_32| |#StackHeapBarrier|)) (= |#NULL.base| 0))))) (= |old(#valid)| |#valid|) (= |process_prio_queue_#in~q.offset| process_prio_queue_~q.offset))' at error location [2023-04-01 11:00:28,861 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 11:00:28,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 11:00:28,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 13] total 32 [2023-04-01 11:00:28,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614365817] [2023-04-01 11:00:28,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 11:00:28,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-04-01 11:00:28,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:00:28,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-04-01 11:00:28,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2178, Unknown=13, NotChecked=190, Total=2550 [2023-04-01 11:00:28,863 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 32 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 27 states have internal predecessors, (47), 10 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-01 11:00:30,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:00:30,525 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2023-04-01 11:00:30,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-01 11:00:30,526 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 27 states have internal predecessors, (47), 10 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 26 [2023-04-01 11:00:30,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:00:30,526 INFO L225 Difference]: With dead ends: 70 [2023-04-01 11:00:30,526 INFO L226 Difference]: Without dead ends: 68 [2023-04-01 11:00:30,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=277, Invalid=3140, Unknown=13, NotChecked=230, Total=3660 [2023-04-01 11:00:30,528 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 71 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-04-01 11:00:30,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 467 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-04-01 11:00:30,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-04-01 11:00:30,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2023-04-01 11:00:30,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 45 states have internal predecessors, (53), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2023-04-01 11:00:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2023-04-01 11:00:30,536 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 26 [2023-04-01 11:00:30,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:00:30,537 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2023-04-01 11:00:30,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 27 states have internal predecessors, (47), 10 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-01 11:00:30,537 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2023-04-01 11:00:30,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-04-01 11:00:30,538 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:00:30,538 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-01 11:00:30,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-04-01 11:00:30,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:00:30,745 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:00:30,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:00:30,745 INFO L85 PathProgramCache]: Analyzing trace with hash 826318219, now seen corresponding path program 1 times [2023-04-01 11:00:30,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:00:30,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689608631] [2023-04-01 11:00:30,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:00:30,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:00:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:00:31,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:00:31,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:00:31,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689608631] [2023-04-01 11:00:31,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689608631] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 11:00:31,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88148104] [2023-04-01 11:00:31,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:00:31,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:00:31,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:00:31,565 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 11:00:31,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 11:00:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:00:31,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 66 conjunts are in the unsatisfiable core [2023-04-01 11:00:31,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:00:31,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-04-01 11:00:31,904 INFO L321 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2023-04-01 11:00:31,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2023-04-01 11:00:31,939 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-04-01 11:00:31,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2023-04-01 11:00:31,972 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-04-01 11:00:31,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2023-04-01 11:00:31,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-04-01 11:00:32,024 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2023-04-01 11:00:32,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 60 [2023-04-01 11:00:32,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-04-01 11:00:32,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-04-01 11:00:32,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-04-01 11:00:32,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-04-01 11:00:32,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 15 [2023-04-01 11:00:32,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-04-01 11:00:32,232 INFO L321 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2023-04-01 11:00:32,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 42 [2023-04-01 11:00:32,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-04-01 11:00:32,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-04-01 11:00:32,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-04-01 11:00:32,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-04-01 11:00:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:00:32,497 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:00:32,886 INFO L321 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2023-04-01 11:00:32,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 79 [2023-04-01 11:00:32,896 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 11:00:32,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 48 [2023-04-01 11:00:32,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-04-01 11:00:33,016 INFO L321 Elim1Store]: treesize reduction 107, result has 0.9 percent of original size [2023-04-01 11:00:33,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 1 [2023-04-01 11:00:33,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-04-01 11:00:33,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:00:33,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88148104] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:00:33,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1854793559] [2023-04-01 11:00:33,163 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2023-04-01 11:00:33,163 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:00:33,163 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:00:33,163 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:00:33,163 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:00:33,189 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 49 for LOIs [2023-04-01 11:00:34,683 INFO L197 IcfgInterpreter]: Interpreting procedure append_to_queue with input of size 126 for LOIs [2023-04-01 11:00:34,716 INFO L197 IcfgInterpreter]: Interpreting procedure process_prio_queue with input of size 128 for LOIs [2023-04-01 11:00:34,947 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 11:00:34,951 INFO L197 IcfgInterpreter]: Interpreting procedure receive with input of size 143 for LOIs [2023-04-01 11:00:34,987 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 11:00:36,038 WARN L861 $PredicateComparison]: unable to prove that (and (let ((.cse0 (not (= |c_#StackHeapBarrier| 0))) (.cse1 (= |c_#NULL.offset| 0)) (.cse2 (= |c_#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 (exists ((|v_old(#memory_int)_BEFORE_CALL_43| (Array Int (Array Int Int))) (|v_old(#valid)_BEFORE_CALL_43| (Array Int Int)) (|v_main_~#normal_queue~0.base_BEFORE_CALL_47| Int) (|v_old(#memory_$Pointer$.base)_BEFORE_CALL_43| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_43| (Array Int (Array Int Int))) (|v_main_~#prio_queue~0.base_BEFORE_CALL_52| Int) (|v_old(#length)_BEFORE_CALL_43| (Array Int Int))) (let ((.cse6 (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_43| |v_main_~#normal_queue~0.base_BEFORE_CALL_47|)) (.cse3 (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_43| |v_main_~#normal_queue~0.base_BEFORE_CALL_47|)) (.cse5 (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_43| |v_main_~#prio_queue~0.base_BEFORE_CALL_52|)) (.cse7 (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_43| |v_main_~#prio_queue~0.base_BEFORE_CALL_52|)) (.cse4 (select |v_old(#memory_int)_BEFORE_CALL_43| 1))) (and (= (select .cse3 0) 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_52| 0)) (= (select .cse4 0) 48) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_52| 2)) (not (= |v_main_~#normal_queue~0.base_BEFORE_CALL_47| |c_#StackHeapBarrier|)) (= (select .cse5 0) 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_52| 1)) (not (= .cse6 .cse4)) (= (select .cse6 0) 0) (not (= .cse4 |v_old(#length)_BEFORE_CALL_43|)) (not (= |v_main_~#normal_queue~0.base_BEFORE_CALL_47| 0)) (not (= |v_old(#valid)_BEFORE_CALL_43| |v_old(#length)_BEFORE_CALL_43|)) (= (select |v_old(#valid)_BEFORE_CALL_43| 0) 0) (not (= |v_old(#valid)_BEFORE_CALL_43| .cse4)) (not (= .cse4 .cse3)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_52| |c_#StackHeapBarrier|)) (= (select .cse7 0) 0) (= 16 (select |v_old(#length)_BEFORE_CALL_43| 2)) (not (= .cse4 .cse5)) (= 2 (select |v_old(#length)_BEFORE_CALL_43| 1)) (not (= .cse4 .cse7)) (= (select |v_old(#valid)_BEFORE_CALL_43| 2) 1) (= (select .cse4 1) 0) (= (select |v_old(#valid)_BEFORE_CALL_43| 1) 1) (= (select |v_old(#valid)_BEFORE_CALL_43| |v_main_~#prio_queue~0.base_BEFORE_CALL_52|) 0))))) (let ((.cse8 (select |c_old(#memory_int)| 1))) (and .cse0 (= 48 (select .cse8 0)) (exists ((|v_old(#valid)_BEFORE_CALL_43| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_52| Int) (|v_old(#length)_BEFORE_CALL_43| (Array Int Int))) (let ((.cse9 (select |c_old(#memory_$Pointer$.offset)| |v_main_~#prio_queue~0.base_BEFORE_CALL_52|)) (.cse10 (select |c_old(#memory_$Pointer$.base)| |v_main_~#prio_queue~0.base_BEFORE_CALL_52|))) (and (not (= .cse8 |v_old(#length)_BEFORE_CALL_43|)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_52| 0)) (not (= .cse9 .cse8)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_52| 2)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_52| 1)) (not (= |v_old(#valid)_BEFORE_CALL_43| |v_old(#length)_BEFORE_CALL_43|)) (= (select |v_old(#valid)_BEFORE_CALL_43| 0) 0) (= (select .cse9 0) 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_52| |c_#StackHeapBarrier|)) (= 16 (select |v_old(#length)_BEFORE_CALL_43| 2)) (= 2 (select |v_old(#length)_BEFORE_CALL_43| 1)) (= (select |v_old(#valid)_BEFORE_CALL_43| 2) 1) (= 0 (select .cse10 0)) (not (= .cse8 .cse10)) (not (= |v_old(#valid)_BEFORE_CALL_43| .cse8)) (= (select |v_old(#valid)_BEFORE_CALL_43| 1) 1) (= (select |v_old(#valid)_BEFORE_CALL_43| |v_main_~#prio_queue~0.base_BEFORE_CALL_52|) 0)))) .cse1 .cse2 (= (select .cse8 1) 0) (exists ((|v_main_~#normal_queue~0.base_BEFORE_CALL_47| Int)) (let ((.cse11 (select |c_old(#memory_$Pointer$.offset)| |v_main_~#normal_queue~0.base_BEFORE_CALL_47|)) (.cse12 (select |c_old(#memory_$Pointer$.base)| |v_main_~#normal_queue~0.base_BEFORE_CALL_47|))) (and (not (= .cse11 .cse8)) (= (select .cse11 0) 0) (not (= |v_main_~#normal_queue~0.base_BEFORE_CALL_47| |c_#StackHeapBarrier|)) (not (= .cse12 .cse8)) (not (= |v_main_~#normal_queue~0.base_BEFORE_CALL_47| 0)) (= (select .cse12 0) 0)))))))) (exists ((|v_receive_#t~ret5.offset_5| Int) (|v_#memory_$Pointer$.base_82| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_81| (Array Int (Array Int Int))) (|v_receive_#t~nondet4_5| Int) (|v_receive_~#packet~0.base_5| Int) (|v_receive_#t~nondet3_5| Int) (|v_#memory_$Pointer$.offset_82| (Array Int (Array Int Int))) (|v_receive_#t~ret5.base_5| Int) (|v_#memory_$Pointer$.offset_81| (Array Int (Array Int Int)))) (let ((.cse14 (select |v_#memory_$Pointer$.offset_82| |v_receive_~#packet~0.base_5|)) (.cse13 (select |v_#memory_$Pointer$.offset_81| |v_receive_~#packet~0.base_5|)) (.cse15 (select |c_#memory_int| |v_receive_~#packet~0.base_5|)) (.cse19 (select |v_#memory_$Pointer$.base_81| |v_receive_~#packet~0.base_5|)) (.cse20 (select |v_#memory_$Pointer$.base_82| |v_receive_~#packet~0.base_5|))) (and (not (= |v_receive_~#packet~0.base_5| 0)) (<= 0 (+ |v_receive_#t~nondet4_5| 2147483648)) (= |c_#valid| (store |c_old(#valid)| |v_receive_~#packet~0.base_5| 0)) (= (store |v_#memory_$Pointer$.offset_81| |v_receive_~#packet~0.base_5| (store .cse13 8 |v_receive_#t~ret5.offset_5|)) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_5| (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_5|) 0 (select .cse14 0))) |v_#memory_$Pointer$.offset_82|) (= (store |v_#memory_$Pointer$.offset_82| |v_receive_~#packet~0.base_5| (store .cse14 4 (select .cse13 4))) |v_#memory_$Pointer$.offset_81|) (= |c_receive_#res.payload.offset| (select (select |c_#memory_$Pointer$.offset| |v_receive_~#packet~0.base_5|) 8)) (= |c_receive_#res.size| (select .cse15 0)) (< |c_#StackHeapBarrier| |v_receive_~#packet~0.base_5|) (= (select .cse15 4) |c_receive_#res.prio|) (<= |v_receive_#t~nondet4_5| 2147483647) (let ((.cse18 (= |v_receive_#t~nondet4_5| 0)) (.cse16 (store (select |c_old(#memory_int)| |v_receive_~#packet~0.base_5|) 0 |v_receive_#t~nondet3_5|)) (.cse17 (select .cse15 8))) (or (and (= |c_#memory_int| (store |c_old(#memory_int)| |v_receive_~#packet~0.base_5| (store (store .cse16 4 1) 8 .cse17))) .cse18) (and (not .cse18) (= (store |c_old(#memory_int)| |v_receive_~#packet~0.base_5| (store (store .cse16 4 0) 8 .cse17)) |c_#memory_int|)))) (= (store |c_old(#length)| |v_receive_~#packet~0.base_5| 12) |c_#length|) (= (store |v_#memory_$Pointer$.base_81| |v_receive_~#packet~0.base_5| (store .cse19 4 (select .cse20 4))) |v_#memory_$Pointer$.base_82|) (= (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_5| (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_5|) 0 (select .cse19 0))) |v_#memory_$Pointer$.base_81|) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_82| |v_receive_~#packet~0.base_5| (store .cse20 8 |v_receive_#t~ret5.base_5|))) (= 0 (select |c_old(#valid)| |v_receive_~#packet~0.base_5|)) (= |c_receive_#res.payload.base| (select (select |c_#memory_$Pointer$.base| |v_receive_~#packet~0.base_5|) 8))))) (exists ((|v_#valid_135| (Array Int Int)) (|v_main_~#new_packet~0.base_BEFORE_CALL_37| Int) (|v_#length_103| (Array Int Int))) (and (= (select |v_#valid_135| |v_main_~#new_packet~0.base_BEFORE_CALL_37|) 0) (= |c_old(#length)| (store |v_#length_103| |v_main_~#new_packet~0.base_BEFORE_CALL_37| 12)) (< |c_#StackHeapBarrier| |v_main_~#new_packet~0.base_BEFORE_CALL_37|) (not (= |v_main_~#new_packet~0.base_BEFORE_CALL_37| 0)) (= |c_old(#valid)| (store |v_#valid_135| |v_main_~#new_packet~0.base_BEFORE_CALL_37| 1))))) is different from true [2023-04-01 11:00:40,760 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2005#(and (= |old(#length)| |#length|) (or (not (= process_prio_queue_~node~1.offset 0)) (not (= process_prio_queue_~node~1.base 0))) (= |#memory_int| |old(#memory_int)|) (= process_prio_queue_~q.offset process_prio_queue_~node~1.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= (mod (select (select |#memory_int| process_prio_queue_~node~1.base) (+ process_prio_queue_~node~1.offset 4)) 4294967296) 1)) (<= 500 (mod (select (select |#memory_int| process_prio_queue_~node~1.base) process_prio_queue_~node~1.offset) 4294967296)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= process_prio_queue_~q.base process_prio_queue_~node~1.base) (= process_prio_queue_~q.base |process_prio_queue_#in~q.base|) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_49| Int) (|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_40| (Array Int (Array Int Int))) (|v_main_~#normal_queue~0.offset_BEFORE_CALL_44| Int) (|v_main_~#normal_queue~0.base_BEFORE_CALL_44| Int) (|v_old(#length)_BEFORE_CALL_40| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_BEFORE_CALL_40| (Array Int (Array Int Int))) (|v_main_~#prio_queue~0.offset_BEFORE_CALL_47| Int) (|v_old(#memory_int)_BEFORE_CALL_40| (Array Int (Array Int Int))) (|v_old(#valid)_BEFORE_CALL_40| (Array Int Int))) (and (= (select (select |old(#memory_$Pointer$.base)| |v_main_~#prio_queue~0.base_BEFORE_CALL_49|) |v_main_~#prio_queue~0.offset_BEFORE_CALL_47|) |process_prio_queue_#in~q.base|) (= (select (select |old(#memory_$Pointer$.offset)| |v_main_~#prio_queue~0.base_BEFORE_CALL_49|) |v_main_~#prio_queue~0.offset_BEFORE_CALL_47|) |process_prio_queue_#in~q.offset|) (or (and (= (select |v_old(#valid)_BEFORE_CALL_40| 0) 0) (not (= (select |old(#memory_$Pointer$.base)| |v_main_~#prio_queue~0.base_BEFORE_CALL_49|) (select |v_old(#memory_int)_BEFORE_CALL_40| 1))) (= (select (select |old(#memory_$Pointer$.offset)| |v_main_~#normal_queue~0.base_BEFORE_CALL_44|) 0) 0) (not (= |v_main_~#normal_queue~0.base_BEFORE_CALL_44| 0)) (= 2 (select |v_old(#length)_BEFORE_CALL_40| 1)) (= |old(#memory_$Pointer$.offset)| |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_40|) (= (select |v_old(#valid)_BEFORE_CALL_40| 1) 1) (not (= (select |old(#memory_$Pointer$.base)| |v_main_~#normal_queue~0.base_BEFORE_CALL_44|) (select |v_old(#memory_int)_BEFORE_CALL_40| 1))) (not (= |v_old(#valid)_BEFORE_CALL_40| |v_old(#length)_BEFORE_CALL_40|)) (= (select |v_old(#valid)_BEFORE_CALL_40| 2) 1) (= 0 (select (select |old(#memory_$Pointer$.base)| |v_main_~#normal_queue~0.base_BEFORE_CALL_44|) 0)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_40| 1) (select |old(#memory_$Pointer$.offset)| |v_main_~#normal_queue~0.base_BEFORE_CALL_44|))) (not (= |#StackHeapBarrier| 0)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_49| 2)) (not (= |v_old(#valid)_BEFORE_CALL_40| (select |v_old(#memory_int)_BEFORE_CALL_40| 1))) (not (= (select |old(#memory_$Pointer$.offset)| |v_main_~#prio_queue~0.base_BEFORE_CALL_49|) (select |v_old(#memory_int)_BEFORE_CALL_40| 1))) (= (select (select |old(#memory_$Pointer$.offset)| |v_main_~#prio_queue~0.base_BEFORE_CALL_49|) 0) 0) (= (select |v_old(#valid)_BEFORE_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_49|) 0) (= 16 (select |v_old(#length)_BEFORE_CALL_40| 2)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_49| |#StackHeapBarrier|)) (not (= |v_main_~#normal_queue~0.base_BEFORE_CALL_44| |#StackHeapBarrier|)) (= |old(#memory_int)| |v_old(#memory_int)_BEFORE_CALL_40|) (= |#NULL.offset| 0) (= |v_main_~#normal_queue~0.offset_BEFORE_CALL_44| 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_49| 1)) (= 48 (select (select |v_old(#memory_int)_BEFORE_CALL_40| 1) 0)) (= |v_main_~#prio_queue~0.offset_BEFORE_CALL_47| 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_49| 0)) (= (select (select |old(#memory_$Pointer$.base)| |v_main_~#prio_queue~0.base_BEFORE_CALL_49|) 0) 0) (= |v_old(#memory_$Pointer$.base)_BEFORE_CALL_40| |old(#memory_$Pointer$.base)|) (= (select (select |v_old(#memory_int)_BEFORE_CALL_40| 1) 1) 0) (not (= (select |v_old(#memory_int)_BEFORE_CALL_40| 1) |v_old(#length)_BEFORE_CALL_40|)) (= |#NULL.base| 0)) (and (= (select |v_old(#valid)_BEFORE_CALL_40| 0) 0) (= 0 (select (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_49|) 0)) (= (select (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_49|) 0) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_40| |v_main_~#normal_queue~0.base_BEFORE_CALL_44|) 0) 0) (not (= |v_main_~#normal_queue~0.base_BEFORE_CALL_44| 0)) (= 2 (select |v_old(#length)_BEFORE_CALL_40| 1)) (= (select |v_old(#valid)_BEFORE_CALL_40| 1) 1) (not (= (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_49|) (select |v_old(#memory_int)_BEFORE_CALL_40| 1))) (not (= |v_old(#valid)_BEFORE_CALL_40| |v_old(#length)_BEFORE_CALL_40|)) (= (select |v_old(#valid)_BEFORE_CALL_40| 2) 1) (not (= |#StackHeapBarrier| 0)) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_49| 2)) (not (= |v_old(#valid)_BEFORE_CALL_40| (select |v_old(#memory_int)_BEFORE_CALL_40| 1))) (= (select |v_old(#valid)_BEFORE_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_49|) 0) (= 16 (select |v_old(#length)_BEFORE_CALL_40| 2)) (= (select (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_40| |v_main_~#normal_queue~0.base_BEFORE_CALL_44|) 0) 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_49| |#StackHeapBarrier|)) (not (= |v_main_~#normal_queue~0.base_BEFORE_CALL_44| |#StackHeapBarrier|)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_40| 1) (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_49|))) (= |#NULL.offset| 0) (= |v_main_~#normal_queue~0.offset_BEFORE_CALL_44| 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_49| 1)) (= 48 (select (select |v_old(#memory_int)_BEFORE_CALL_40| 1) 0)) (= |v_main_~#prio_queue~0.offset_BEFORE_CALL_47| 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_49| 0)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_40| 1) (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_40| |v_main_~#normal_queue~0.base_BEFORE_CALL_44|))) (not (= (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_40| |v_main_~#normal_queue~0.base_BEFORE_CALL_44|) (select |v_old(#memory_int)_BEFORE_CALL_40| 1))) (= (select (select |v_old(#memory_int)_BEFORE_CALL_40| 1) 1) 0) (not (= (select |v_old(#memory_int)_BEFORE_CALL_40| 1) |v_old(#length)_BEFORE_CALL_40|)) (= |#NULL.base| 0))))) (= |old(#valid)| |#valid|) (= |process_prio_queue_#in~q.offset| process_prio_queue_~q.offset))' at error location [2023-04-01 11:00:40,761 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 11:00:40,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 11:00:40,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 31 [2023-04-01 11:00:40,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474299963] [2023-04-01 11:00:40,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 11:00:40,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-04-01 11:00:40,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:00:40,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-04-01 11:00:40,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2270, Unknown=14, NotChecked=96, Total=2550 [2023-04-01 11:00:40,763 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 31 states, 22 states have (on average 2.227272727272727) internal successors, (49), 27 states have internal predecessors, (49), 10 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-01 11:00:42,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:00:42,372 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2023-04-01 11:00:42,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-01 11:00:42,373 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 22 states have (on average 2.227272727272727) internal successors, (49), 27 states have internal predecessors, (49), 10 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 27 [2023-04-01 11:00:42,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:00:42,373 INFO L225 Difference]: With dead ends: 79 [2023-04-01 11:00:42,373 INFO L226 Difference]: Without dead ends: 77 [2023-04-01 11:00:42,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=296, Invalid=3476, Unknown=14, NotChecked=120, Total=3906 [2023-04-01 11:00:42,375 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 46 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-04-01 11:00:42,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 564 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-04-01 11:00:42,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-04-01 11:00:42,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2023-04-01 11:00:42,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 45 states have internal predecessors, (53), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2023-04-01 11:00:42,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2023-04-01 11:00:42,387 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 27 [2023-04-01 11:00:42,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:00:42,387 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2023-04-01 11:00:42,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 22 states have (on average 2.227272727272727) internal successors, (49), 27 states have internal predecessors, (49), 10 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-01 11:00:42,387 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2023-04-01 11:00:42,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-04-01 11:00:42,388 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:00:42,388 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-01 11:00:42,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-01 11:00:42,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:00:42,595 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:00:42,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:00:42,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1867711737, now seen corresponding path program 1 times [2023-04-01 11:00:42,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:00:42,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603058670] [2023-04-01 11:00:42,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:00:42,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:00:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat