/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/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/heap-data/packet_filter.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 01:11:09,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 01:11:09,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 01:11:09,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 01:11:09,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 01:11:09,172 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 01:11:09,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 01:11:09,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 01:11:09,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 01:11:09,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 01:11:09,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 01:11:09,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 01:11:09,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 01:11:09,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 01:11:09,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 01:11:09,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 01:11:09,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 01:11:09,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 01:11:09,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 01:11:09,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 01:11:09,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 01:11:09,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 01:11:09,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 01:11:09,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 01:11:09,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 01:11:09,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 01:11:09,208 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 01:11:09,209 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 01:11:09,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 01:11:09,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 01:11:09,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 01:11:09,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 01:11:09,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 01:11:09,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 01:11:09,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 01:11:09,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 01:11:09,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 01:11:09,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 01:11:09,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 01:11:09,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 01:11:09,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 01:11:09,217 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-04-02 01:11:09,243 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 01:11:09,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 01:11:09,244 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 01:11:09,244 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 01:11:09,245 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 01:11:09,245 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 01:11:09,245 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 01:11:09,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 01:11:09,245 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 01:11:09,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 01:11:09,246 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 01:11:09,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 01:11:09,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 01:11:09,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 01:11:09,246 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 01:11:09,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 01:11:09,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 01:11:09,246 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 01:11:09,246 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 01:11:09,246 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 01:11:09,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 01:11:09,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 01:11:09,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 01:11:09,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 01:11:09,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:11:09,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 01:11:09,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 01:11:09,247 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 01:11:09,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 01:11:09,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 01:11:09,247 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 01:11:09,247 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 01:11:09,248 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 01:11:09,248 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 01:11:09,248 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 01:11:09,248 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-04-02 01:11:09,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 01:11:09,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 01:11:09,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 01:11:09,445 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 01:11:09,445 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 01:11:09,446 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-02 01:11:10,581 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 01:11:10,828 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 01:11:10,829 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i [2023-04-02 01:11:10,838 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f96605c3d/c70eb0d055144b61b8989da8521ca71d/FLAG5d40f1f93 [2023-04-02 01:11:10,851 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f96605c3d/c70eb0d055144b61b8989da8521ca71d [2023-04-02 01:11:10,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 01:11:10,855 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 01:11:10,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 01:11:10,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 01:11:10,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 01:11:10,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:11:10" (1/1) ... [2023-04-02 01:11:10,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@910b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:11:10, skipping insertion in model container [2023-04-02 01:11:10,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:11:10" (1/1) ... [2023-04-02 01:11:10,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 01:11:10,906 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 01:11:11,127 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-02 01:11:11,138 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-02 01:11:11,150 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:11:11,162 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 01:11:11,211 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-02 01:11:11,213 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-02 01:11:11,216 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:11:11,235 WARN L667 CHandler]: The function __VERIFIER_nondet_charp is called, but not defined or handled by StandardFunctionHandler. [2023-04-02 01:11:11,241 INFO L208 MainTranslator]: Completed translation [2023-04-02 01:11:11,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:11:11 WrapperNode [2023-04-02 01:11:11,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 01:11:11,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 01:11:11,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 01:11:11,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 01:11:11,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:11:11" (1/1) ... [2023-04-02 01:11:11,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:11:11" (1/1) ... [2023-04-02 01:11:11,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:11:11" (1/1) ... [2023-04-02 01:11:11,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:11:11" (1/1) ... [2023-04-02 01:11:11,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:11:11" (1/1) ... [2023-04-02 01:11:11,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:11:11" (1/1) ... [2023-04-02 01:11:11,301 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:11:11" (1/1) ... [2023-04-02 01:11:11,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:11:11" (1/1) ... [2023-04-02 01:11:11,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 01:11:11,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 01:11:11,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 01:11:11,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 01:11:11,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:11:11" (1/1) ... [2023-04-02 01:11:11,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:11:11,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:11:11,351 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-02 01:11:11,374 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-02 01:11:11,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 01:11:11,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 01:11:11,388 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 01:11:11,388 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2023-04-02 01:11:11,388 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2023-04-02 01:11:11,388 INFO L138 BoogieDeclarations]: Found implementation of procedure receive [2023-04-02 01:11:11,388 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2023-04-02 01:11:11,388 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2023-04-02 01:11:11,388 INFO L138 BoogieDeclarations]: Found implementation of procedure process_prio_queue [2023-04-02 01:11:11,389 INFO L138 BoogieDeclarations]: Found implementation of procedure process_normal_queue [2023-04-02 01:11:11,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 01:11:11,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2023-04-02 01:11:11,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 01:11:11,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2023-04-02 01:11:11,389 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 01:11:11,389 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 01:11:11,389 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-02 01:11:11,389 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-02 01:11:11,390 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 01:11:11,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 01:11:11,390 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2023-04-02 01:11:11,390 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2023-04-02 01:11:11,390 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-04-02 01:11:11,390 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-04-02 01:11:11,390 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-04-02 01:11:11,390 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-04-02 01:11:11,390 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-04-02 01:11:11,390 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-04-02 01:11:11,390 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-04-02 01:11:11,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-04-02 01:11:11,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-04-02 01:11:11,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-04-02 01:11:11,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-04-02 01:11:11,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-04-02 01:11:11,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-04-02 01:11:11,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-04-02 01:11:11,391 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-04-02 01:11:11,391 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-04-02 01:11:11,392 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-04-02 01:11:11,392 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-04-02 01:11:11,392 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-04-02 01:11:11,392 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-04-02 01:11:11,392 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-04-02 01:11:11,392 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-04-02 01:11:11,392 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-04-02 01:11:11,392 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-04-02 01:11:11,392 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-04-02 01:11:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-04-02 01:11:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-04-02 01:11:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-04-02 01:11:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-04-02 01:11:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-04-02 01:11:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-04-02 01:11:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-04-02 01:11:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-04-02 01:11:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-04-02 01:11:11,394 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-04-02 01:11:11,394 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-04-02 01:11:11,394 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-04-02 01:11:11,394 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-04-02 01:11:11,394 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-04-02 01:11:11,394 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-04-02 01:11:11,394 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-04-02 01:11:11,394 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-04-02 01:11:11,394 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-04-02 01:11:11,395 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-04-02 01:11:11,395 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-04-02 01:11:11,395 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-04-02 01:11:11,395 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-04-02 01:11:11,395 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-04-02 01:11:11,395 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-04-02 01:11:11,395 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-04-02 01:11:11,395 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-02 01:11:11,395 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-04-02 01:11:11,396 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-04-02 01:11:11,396 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-04-02 01:11:11,396 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2023-04-02 01:11:11,396 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-04-02 01:11:11,396 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-04-02 01:11:11,396 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-04-02 01:11:11,396 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-04-02 01:11:11,396 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-04-02 01:11:11,396 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-04-02 01:11:11,397 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-04-02 01:11:11,397 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-02 01:11:11,397 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-04-02 01:11:11,397 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-04-02 01:11:11,397 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-04-02 01:11:11,397 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-04-02 01:11:11,397 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-04-02 01:11:11,397 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-04-02 01:11:11,397 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-04-02 01:11:11,397 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-04-02 01:11:11,398 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-04-02 01:11:11,398 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-04-02 01:11:11,398 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-04-02 01:11:11,398 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-04-02 01:11:11,398 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-04-02 01:11:11,398 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-04-02 01:11:11,398 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-04-02 01:11:11,399 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-04-02 01:11:11,399 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-04-02 01:11:11,399 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-04-02 01:11:11,399 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-04-02 01:11:11,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-04-02 01:11:11,399 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-04-02 01:11:11,399 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-04-02 01:11:11,400 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-04-02 01:11:11,400 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-04-02 01:11:11,400 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-04-02 01:11:11,400 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-04-02 01:11:11,400 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-04-02 01:11:11,400 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-04-02 01:11:11,400 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-04-02 01:11:11,401 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-04-02 01:11:11,401 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-04-02 01:11:11,401 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-04-02 01:11:11,401 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-04-02 01:11:11,401 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-04-02 01:11:11,401 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-04-02 01:11:11,401 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-04-02 01:11:11,401 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-04-02 01:11:11,401 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-04-02 01:11:11,402 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-04-02 01:11:11,402 INFO L130 BoogieDeclarations]: Found specification of procedure receive [2023-04-02 01:11:11,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-04-02 01:11:11,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 01:11:11,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-04-02 01:11:11,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 01:11:11,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-04-02 01:11:11,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 01:11:11,402 INFO L130 BoogieDeclarations]: Found specification of procedure send [2023-04-02 01:11:11,403 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2023-04-02 01:11:11,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-02 01:11:11,403 INFO L130 BoogieDeclarations]: Found specification of procedure process_prio_queue [2023-04-02 01:11:11,403 INFO L130 BoogieDeclarations]: Found specification of procedure process_normal_queue [2023-04-02 01:11:11,403 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 01:11:11,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-04-02 01:11:11,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 01:11:11,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 01:11:11,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 01:11:11,717 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 01:11:11,718 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 01:11:12,068 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 01:11:12,074 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 01:11:12,074 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-04-02 01:11:12,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:11:12 BoogieIcfgContainer [2023-04-02 01:11:12,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 01:11:12,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 01:11:12,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 01:11:12,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 01:11:12,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 01:11:10" (1/3) ... [2023-04-02 01:11:12,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51af18d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:11:12, skipping insertion in model container [2023-04-02 01:11:12,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:11:11" (2/3) ... [2023-04-02 01:11:12,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51af18d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:11:12, skipping insertion in model container [2023-04-02 01:11:12,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:11:12" (3/3) ... [2023-04-02 01:11:12,089 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2023-04-02 01:11:12,106 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 01:11:12,107 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-04-02 01:11:12,157 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 01:11:12,165 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=PETRI_NET, 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;@294b0b99, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 01:11:12,165 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-04-02 01:11:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 44 states have internal predecessors, (57), 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-02 01:11:12,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-04-02 01:11:12,177 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:11:12,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:11:12,178 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:11:12,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:11:12,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1068933411, now seen corresponding path program 1 times [2023-04-02 01:11:12,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:11:12,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246549325] [2023-04-02 01:11:12,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:12,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:11:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:12,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:11:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:12,371 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-02 01:11:12,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:11:12,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246549325] [2023-04-02 01:11:12,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246549325] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:11:12,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:11:12,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-02 01:11:12,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998086415] [2023-04-02 01:11:12,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:11:12,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 01:11:12,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:11:12,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 01:11:12,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 01:11:12,420 INFO L87 Difference]: Start difference. First operand has 62 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 44 states have internal predecessors, (57), 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 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:12,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:11:12,647 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2023-04-02 01:11:12,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 01:11:12,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-04-02 01:11:12,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:11:12,656 INFO L225 Difference]: With dead ends: 98 [2023-04-02 01:11:12,657 INFO L226 Difference]: Without dead ends: 55 [2023-04-02 01:11:12,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 01:11:12,665 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 57 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:11:12,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 10 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 01:11:12,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-04-02 01:11:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-04-02 01:11:12,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 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-02 01:11:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2023-04-02 01:11:12,734 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 14 [2023-04-02 01:11:12,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:11:12,734 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2023-04-02 01:11:12,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:12,735 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2023-04-02 01:11:12,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-04-02 01:11:12,736 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:11:12,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:11:12,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 01:11:12,737 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:11:12,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:11:12,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1316192133, now seen corresponding path program 1 times [2023-04-02 01:11:12,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:11:12,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785540524] [2023-04-02 01:11:12,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:12,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:11:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:13,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:11:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:13,072 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-02 01:11:13,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:11:13,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785540524] [2023-04-02 01:11:13,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785540524] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:11:13,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:11:13,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-02 01:11:13,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187411399] [2023-04-02 01:11:13,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:11:13,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 01:11:13,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:11:13,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 01:11:13,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-04-02 01:11:13,080 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:13,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:11:13,592 INFO L93 Difference]: Finished difference Result 91 states and 108 transitions. [2023-04-02 01:11:13,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-02 01:11:13,593 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-04-02 01:11:13,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:11:13,595 INFO L225 Difference]: With dead ends: 91 [2023-04-02 01:11:13,595 INFO L226 Difference]: Without dead ends: 65 [2023-04-02 01:11:13,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-04-02 01:11:13,597 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 69 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-02 01:11:13,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 27 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-02 01:11:13,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-04-02 01:11:13,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2023-04-02 01:11:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 46 states have internal predecessors, (54), 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-02 01:11:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2023-04-02 01:11:13,609 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 15 [2023-04-02 01:11:13,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:11:13,609 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2023-04-02 01:11:13,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:11:13,609 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2023-04-02 01:11:13,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-04-02 01:11:13,610 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:11:13,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:11:13,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-02 01:11:13,611 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:11:13,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:11:13,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1729106577, now seen corresponding path program 1 times [2023-04-02 01:11:13,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:11:13,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283612284] [2023-04-02 01:11:13,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:13,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:11:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:13,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:11:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:13,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-04-02 01:11:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:13,870 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-02 01:11:13,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:11:13,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283612284] [2023-04-02 01:11:13,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283612284] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:11:13,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:11:13,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-02 01:11:13,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390473416] [2023-04-02 01:11:13,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:11:13,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-02 01:11:13,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:11:13,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-02 01:11:13,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-04-02 01:11:13,875 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (4), 4 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-02 01:11:14,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:11:14,525 INFO L93 Difference]: Finished difference Result 96 states and 114 transitions. [2023-04-02 01:11:14,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-02 01:11:14,526 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (4), 4 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 21 [2023-04-02 01:11:14,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:11:14,527 INFO L225 Difference]: With dead ends: 96 [2023-04-02 01:11:14,527 INFO L226 Difference]: Without dead ends: 74 [2023-04-02 01:11:14,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-04-02 01:11:14,529 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 105 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-02 01:11:14,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 11 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-02 01:11:14,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-04-02 01:11:14,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 57. [2023-04-02 01:11:14,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 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-02 01:11:14,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2023-04-02 01:11:14,539 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 21 [2023-04-02 01:11:14,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:11:14,539 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2023-04-02 01:11:14,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (4), 4 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-02 01:11:14,540 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2023-04-02 01:11:14,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-04-02 01:11:14,541 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:11:14,541 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] [2023-04-02 01:11:14,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-02 01:11:14,541 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:11:14,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:11:14,542 INFO L85 PathProgramCache]: Analyzing trace with hash -983006409, now seen corresponding path program 1 times [2023-04-02 01:11:14,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:11:14,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199943851] [2023-04-02 01:11:14,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:14,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:11:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:14,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:11:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:14,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 01:11:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 01:11:14,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:11:14,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199943851] [2023-04-02 01:11:14,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199943851] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:11:14,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:11:14,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-02 01:11:14,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988804820] [2023-04-02 01:11:14,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:11:14,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 01:11:14,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:11:14,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 01:11:14,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-02 01:11:14,632 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-02 01:11:14,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:11:14,942 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2023-04-02 01:11:14,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 01:11:14,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-04-02 01:11:14,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:11:14,944 INFO L225 Difference]: With dead ends: 77 [2023-04-02 01:11:14,944 INFO L226 Difference]: Without dead ends: 75 [2023-04-02 01:11:14,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-04-02 01:11:14,945 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 92 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-02 01:11:14,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 5 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-02 01:11:14,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-04-02 01:11:14,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 58. [2023-04-02 01:11:14,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 42 states have internal predecessors, (50), 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-02 01:11:14,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2023-04-02 01:11:14,961 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 24 [2023-04-02 01:11:14,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:11:14,961 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2023-04-02 01:11:14,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-02 01:11:14,962 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2023-04-02 01:11:14,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-04-02 01:11:14,962 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:11:14,963 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] [2023-04-02 01:11:14,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-02 01:11:14,963 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:11:14,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:11:14,963 INFO L85 PathProgramCache]: Analyzing trace with hash -983004487, now seen corresponding path program 1 times [2023-04-02 01:11:14,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:11:14,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209806970] [2023-04-02 01:11:14,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:14,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:11:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:15,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:11:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:15,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 01:11:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:15,623 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-02 01:11:15,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:11:15,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209806970] [2023-04-02 01:11:15,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209806970] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:11:15,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400313638] [2023-04-02 01:11:15,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:15,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:15,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:11:15,628 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-02 01:11:15,645 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-02 01:11:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:15,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 45 conjunts are in the unsatisfiable core [2023-04-02 01:11:15,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:11:15,913 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 01:11:15,914 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-02 01:11:15,947 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 01:11:15,947 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 12 treesize of output 14 [2023-04-02 01:11:16,039 WARN L861 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_139 (Array Int Int)) (v_ArrVal_135 (Array Int Int)) (|v_receive_~#packet~0.base_9| Int)) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_9| v_ArrVal_139)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_9| v_ArrVal_135)) (= (select |c_old(#valid)| |v_receive_~#packet~0.base_9|) 0))) is different from true [2023-04-02 01:11:16,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:11:16,063 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-02 01:11:16,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:11:16,069 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-02 01:11:16,092 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-02 01:11:16,092 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-02 01:11:16,132 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-02 01:11:16,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:11:16,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400313638] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:11:16,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:11:16,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2023-04-02 01:11:16,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738191108] [2023-04-02 01:11:16,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:11:16,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-02 01:11:16,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:11:16,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-02 01:11:16,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=107, Unknown=1, NotChecked=20, Total=156 [2023-04-02 01:11:16,275 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-02 01:11:17,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:11:17,959 INFO L93 Difference]: Finished difference Result 143 states and 177 transitions. [2023-04-02 01:11:17,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-02 01:11:17,960 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-04-02 01:11:17,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:11:17,961 INFO L225 Difference]: With dead ends: 143 [2023-04-02 01:11:17,961 INFO L226 Difference]: Without dead ends: 116 [2023-04-02 01:11:17,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=399, Unknown=3, NotChecked=42, Total=552 [2023-04-02 01:11:17,962 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 170 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:11:17,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 13 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 502 Invalid, 0 Unknown, 140 Unchecked, 1.1s Time] [2023-04-02 01:11:17,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-04-02 01:11:17,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 70. [2023-04-02 01:11:17,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 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-02 01:11:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2023-04-02 01:11:17,978 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 24 [2023-04-02 01:11:17,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:11:17,978 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2023-04-02 01:11:17,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-02 01:11:17,978 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2023-04-02 01:11:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-04-02 01:11:17,980 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:11:17,981 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, 1, 1, 1] [2023-04-02 01:11:17,991 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-02 01:11:18,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:18,182 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:11:18,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:11:18,182 INFO L85 PathProgramCache]: Analyzing trace with hash -44698837, now seen corresponding path program 1 times [2023-04-02 01:11:18,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:11:18,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897695125] [2023-04-02 01:11:18,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:18,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:11:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:18,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:11:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:18,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 01:11:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:18,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-04-02 01:11:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:18,867 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-02 01:11:18,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:11:18,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897695125] [2023-04-02 01:11:18,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897695125] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:11:18,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060047472] [2023-04-02 01:11:18,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:18,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:18,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:11:18,873 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-02 01:11:18,876 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-02 01:11:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:19,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 45 conjunts are in the unsatisfiable core [2023-04-02 01:11:19,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:11:19,052 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-04-02 01:11:19,052 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-02 01:11:19,078 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 01:11:19,078 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 12 treesize of output 14 [2023-04-02 01:11:19,119 WARN L861 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_228 (Array Int Int)) (|v_receive_~#packet~0.base_19| Int) (v_ArrVal_224 (Array Int Int))) (and (= (select |c_old(#valid)| |v_receive_~#packet~0.base_19|) 0) (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_19| v_ArrVal_224) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_19| v_ArrVal_228)))) is different from true [2023-04-02 01:11:19,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:11:19,140 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-02 01:11:19,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:11:19,146 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-02 01:11:19,152 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-02 01:11:19,152 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-02 01:11:19,215 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-02 01:11:19,215 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:11:19,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060047472] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:11:19,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:11:19,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2023-04-02 01:11:19,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715465993] [2023-04-02 01:11:19,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:11:19,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-02 01:11:19,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:11:19,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-02 01:11:19,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=147, Unknown=1, NotChecked=24, Total=210 [2023-04-02 01:11:19,527 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 01:11:20,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:11:20,868 INFO L93 Difference]: Finished difference Result 130 states and 160 transitions. [2023-04-02 01:11:20,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 01:11:20,868 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2023-04-02 01:11:20,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:11:20,869 INFO L225 Difference]: With dead ends: 130 [2023-04-02 01:11:20,869 INFO L226 Difference]: Without dead ends: 108 [2023-04-02 01:11:20,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=362, Unknown=3, NotChecked=40, Total=506 [2023-04-02 01:11:20,871 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 179 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:11:20,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 11 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 435 Invalid, 0 Unknown, 138 Unchecked, 1.0s Time] [2023-04-02 01:11:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-04-02 01:11:20,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 64. [2023-04-02 01:11:20,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 47 states have internal predecessors, (56), 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-02 01:11:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2023-04-02 01:11:20,887 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 30 [2023-04-02 01:11:20,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:11:20,888 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2023-04-02 01:11:20,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 01:11:20,888 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2023-04-02 01:11:20,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-04-02 01:11:20,889 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:11:20,889 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, 1, 1, 1] [2023-04-02 01:11:20,896 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-02 01:11:21,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-04-02 01:11:21,096 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:11:21,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:11:21,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1535485560, now seen corresponding path program 1 times [2023-04-02 01:11:21,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:11:21,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978350680] [2023-04-02 01:11:21,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:21,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:11:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:22,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:11:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:22,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 01:11:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:22,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 01:11:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:22,539 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-02 01:11:22,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:11:22,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978350680] [2023-04-02 01:11:22,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978350680] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:11:22,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713897187] [2023-04-02 01:11:22,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:22,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:22,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:11:22,541 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-02 01:11:22,550 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-02 01:11:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:22,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 67 conjunts are in the unsatisfiable core [2023-04-02 01:11:22,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:11:22,822 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-02 01:11:22,905 INFO L321 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2023-04-02 01:11:22,907 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-02 01:11:22,950 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-04-02 01:11:22,951 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-02 01:11:22,985 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-04-02 01:11:22,986 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-02 01:11:22,998 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-02 01:11:23,048 INFO L321 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2023-04-02 01:11:23,048 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-02 01:11:23,068 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-02 01:11:23,082 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-02 01:11:23,099 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-02 01:11:23,175 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-02 01:11:23,238 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-02 01:11:23,248 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-02 01:11:23,324 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:11:23,325 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 5 [2023-04-02 01:11:23,329 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-02 01:11:23,339 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:11:23,340 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 9 [2023-04-02 01:11:23,343 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 9 treesize of output 7 [2023-04-02 01:11:23,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:11:23,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:11:23,879 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 0 case distinctions, treesize of input 15 treesize of output 9 [2023-04-02 01:11:23,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:11:23,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:11:23,888 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 0 case distinctions, treesize of input 24 treesize of output 16 [2023-04-02 01:11:23,892 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-02 01:11:23,895 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 19 treesize of output 15 [2023-04-02 01:11:24,011 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 37 treesize of output 25 [2023-04-02 01:11:24,016 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-02 01:11:24,016 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:11:24,429 INFO L321 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2023-04-02 01:11:24,432 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-02 01:11:24,441 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:11:24,442 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-02 01:11:24,449 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-02 01:11:24,584 INFO L321 Elim1Store]: treesize reduction 107, result has 0.9 percent of original size [2023-04-02 01:11:24,585 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-02 01:11:24,677 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-02 01:11:24,750 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-02 01:11:24,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713897187] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:11:24,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:11:24,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 13] total 35 [2023-04-02 01:11:24,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953639797] [2023-04-02 01:11:24,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:11:24,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-04-02 01:11:24,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:11:24,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-04-02 01:11:24,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1067, Unknown=3, NotChecked=0, Total=1190 [2023-04-02 01:11:24,753 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand has 35 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 28 states have internal predecessors, (55), 10 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 01:11:27,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:11:27,058 INFO L93 Difference]: Finished difference Result 125 states and 152 transitions. [2023-04-02 01:11:27,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-04-02 01:11:27,058 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 28 states have internal predecessors, (55), 10 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 30 [2023-04-02 01:11:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:11:27,059 INFO L225 Difference]: With dead ends: 125 [2023-04-02 01:11:27,059 INFO L226 Difference]: Without dead ends: 98 [2023-04-02 01:11:27,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=320, Invalid=2532, Unknown=10, NotChecked=0, Total=2862 [2023-04-02 01:11:27,061 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 185 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 58 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-04-02 01:11:27,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 37 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1307 Invalid, 3 Unknown, 0 Unchecked, 1.4s Time] [2023-04-02 01:11:27,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-04-02 01:11:27,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 77. [2023-04-02 01:11:27,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (12), 9 states have call predecessors, (12), 10 states have call successors, (12) [2023-04-02 01:11:27,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2023-04-02 01:11:27,074 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 30 [2023-04-02 01:11:27,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:11:27,075 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2023-04-02 01:11:27,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 28 states have internal predecessors, (55), 10 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 01:11:27,075 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2023-04-02 01:11:27,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-04-02 01:11:27,076 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:11:27,076 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, 1, 1, 1, 1] [2023-04-02 01:11:27,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-02 01:11:27,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:27,289 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:11:27,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:11:27,290 INFO L85 PathProgramCache]: Analyzing trace with hash 247753001, now seen corresponding path program 1 times [2023-04-02 01:11:27,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:11:27,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181335639] [2023-04-02 01:11:27,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:27,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:11:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:28,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:11:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:28,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 01:11:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:28,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-04-02 01:11:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:28,466 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-02 01:11:28,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:11:28,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181335639] [2023-04-02 01:11:28,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181335639] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:11:28,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082067919] [2023-04-02 01:11:28,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:28,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:28,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:11:28,468 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-02 01:11:28,470 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-02 01:11:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:28,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 68 conjunts are in the unsatisfiable core [2023-04-02 01:11:28,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:11:28,755 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-02 01:11:28,842 INFO L321 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2023-04-02 01:11:28,842 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-02 01:11:28,873 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-04-02 01:11:28,873 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-02 01:11:28,904 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-04-02 01:11:28,904 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-02 01:11:28,946 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2023-04-02 01:11:28,946 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-02 01:11:28,968 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-02 01:11:28,980 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-02 01:11:28,994 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-02 01:11:29,005 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-02 01:11:29,043 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-02 01:11:29,069 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:11:29,070 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 9 [2023-04-02 01:11:29,074 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 9 treesize of output 7 [2023-04-02 01:11:29,137 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:11:29,138 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 5 [2023-04-02 01:11:29,142 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-02 01:11:29,230 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-02 01:11:29,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:11:29,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:11:29,562 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 0 case distinctions, treesize of input 15 treesize of output 9 [2023-04-02 01:11:29,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:11:29,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:11:29,569 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 0 case distinctions, treesize of input 24 treesize of output 16 [2023-04-02 01:11:29,573 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 32 treesize of output 26 [2023-04-02 01:11:29,575 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 24 [2023-04-02 01:11:29,724 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 44 treesize of output 28 [2023-04-02 01:11:29,735 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-02 01:11:29,736 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:11:30,114 INFO L321 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2023-04-02 01:11:30,114 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-02 01:11:30,133 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:11:30,133 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-02 01:11:30,142 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-02 01:11:30,251 INFO L321 Elim1Store]: treesize reduction 107, result has 0.9 percent of original size [2023-04-02 01:11:30,251 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-02 01:11:30,338 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-02 01:11:30,400 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-02 01:11:30,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082067919] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:11:30,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:11:30,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 13] total 33 [2023-04-02 01:11:30,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007169671] [2023-04-02 01:11:30,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:11:30,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-04-02 01:11:30,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:11:30,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-04-02 01:11:30,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2023-04-02 01:11:30,403 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand has 33 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 10 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 01:11:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:11:32,675 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2023-04-02 01:11:32,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-02 01:11:32,675 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 10 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 31 [2023-04-02 01:11:32,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:11:32,676 INFO L225 Difference]: With dead ends: 111 [2023-04-02 01:11:32,677 INFO L226 Difference]: Without dead ends: 109 [2023-04-02 01:11:32,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=320, Invalid=2230, Unknown=0, NotChecked=0, Total=2550 [2023-04-02 01:11:32,678 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 142 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 45 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-04-02 01:11:32,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 31 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1346 Invalid, 3 Unknown, 0 Unchecked, 1.4s Time] [2023-04-02 01:11:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-04-02 01:11:32,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2023-04-02 01:11:32,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.25) internal successors, (80), 68 states have internal predecessors, (80), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (14), 9 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-02 01:11:32,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2023-04-02 01:11:32,694 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 107 transitions. Word has length 31 [2023-04-02 01:11:32,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:11:32,694 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 107 transitions. [2023-04-02 01:11:32,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 states have internal predecessors, (59), 10 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 01:11:32,694 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2023-04-02 01:11:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-04-02 01:11:32,695 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:11:32,695 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, 1, 1, 1, 1] [2023-04-02 01:11:32,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-04-02 01:11:32,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:11:32,903 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:11:32,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:11:32,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1413952791, now seen corresponding path program 1 times [2023-04-02 01:11:32,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:11:32,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332618197] [2023-04-02 01:11:32,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:11:32,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:11:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:33,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:11:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:33,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 01:11:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:33,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-04-02 01:11:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:11:58,106 WARN L223 SmtUtils]: Spent 10.19s on a formula simplification that was a NOOP. DAG size: 152 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 01:12:10,099 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-02 01:12:10,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:12:10,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332618197] [2023-04-02 01:12:10,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332618197] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:12:10,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931134086] [2023-04-02 01:12:10,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:12:10,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:12:10,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:12:10,101 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:12:10,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-02 01:12:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:12:10,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 100 conjunts are in the unsatisfiable core [2023-04-02 01:12:10,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:12:10,327 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 01:12:10,327 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-02 01:12:10,369 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 01:12:10,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-04-02 01:12:10,382 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-02 01:12:10,386 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-02 01:12:10,390 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-02 01:12:10,428 WARN L861 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1169 Int) (|v_receive_~#packet~0.base_41| Int) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (and (= |c_#valid| (store |c_old(#valid)| |v_receive_~#packet~0.base_41| v_ArrVal_1169)) (= 0 (select |c_old(#valid)| |v_receive_~#packet~0.base_41|)) (= (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_41| v_ArrVal_1166) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_41| v_ArrVal_1163)) (= (select (select |c_#memory_$Pointer$.offset| |v_receive_~#packet~0.base_41|) 8) |c_receive_#res.payload.offset|))) is different from true [2023-04-02 01:12:10,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:10,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-02 01:12:10,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:10,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-02 01:12:10,476 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 01:12:10,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-02 01:12:10,750 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-04-02 01:12:10,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 7 [2023-04-02 01:12:10,756 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-02 01:12:10,759 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-02 01:12:10,771 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2023-04-02 01:12:10,774 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2023-04-02 01:12:10,789 WARN L861 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimArr_15 (Array Int Int)) (|v_append_to_queue_~#p.base_29| Int) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1175 (Array Int Int)) (append_to_queue_~node~0.base Int) (v_ArrVal_1174 (Array Int Int))) (and (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_29|) 0) (= |c_append_to_queue_#in~p.payload.offset| (select v_arrayElimArr_16 8)) (= (select v_arrayElimArr_15 8) |c_append_to_queue_#in~p.payload.base|) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| |v_append_to_queue_~#p.base_29| v_arrayElimArr_16) append_to_queue_~node~0.base v_ArrVal_1177) |c_append_to_queue_#in~q.base| v_ArrVal_1175)) (< append_to_queue_~node~0.base |c_#StackHeapBarrier|) (= (store (store (store |c_old(#memory_$Pointer$.base)| |v_append_to_queue_~#p.base_29| v_arrayElimArr_15) append_to_queue_~node~0.base v_ArrVal_1181) |c_append_to_queue_#in~q.base| v_ArrVal_1174) |c_#memory_$Pointer$.base|))) is different from true [2023-04-02 01:12:10,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:10,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:10,907 INFO L321 Elim1Store]: treesize reduction 111, result has 35.1 percent of original size [2023-04-02 01:12:10,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 93 [2023-04-02 01:12:10,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:10,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:10,968 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-04-02 01:12:10,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 61 [2023-04-02 01:12:10,989 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-02 01:12:10,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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-02 01:12:11,010 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 9 treesize of output 7 [2023-04-02 01:12:11,019 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 9 treesize of output 7 [2023-04-02 01:12:11,031 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 9 treesize of output 7 [2023-04-02 01:12:11,039 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 9 treesize of output 7 [2023-04-02 01:12:11,054 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 7 [2023-04-02 01:12:11,068 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 7 [2023-04-02 01:12:11,080 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 7 [2023-04-02 01:12:11,101 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 9 treesize of output 7 [2023-04-02 01:12:11,108 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 9 treesize of output 7 [2023-04-02 01:12:11,113 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-04-02 01:12:11,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:11,170 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 28 treesize of output 18 [2023-04-02 01:12:11,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:11,188 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 28 treesize of output 18 [2023-04-02 01:12:11,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:12:11,200 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 28 treesize of output 18 [2023-04-02 01:12:11,228 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:12:11,229 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 28 treesize of output 18 [2023-04-02 01:12:11,249 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:12:11,250 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 28 treesize of output 18 [2023-04-02 01:12:11,272 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:12:11,272 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 28 treesize of output 18 [2023-04-02 01:12:11,315 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:12:11,315 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 28 treesize of output 18 [2023-04-02 01:12:11,327 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:12:11,327 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 28 treesize of output 18 [2023-04-02 01:12:11,343 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:12:11,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 28 treesize of output 18 [2023-04-02 01:12:11,382 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 37 treesize of output 29 [2023-04-02 01:12:11,415 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 37 treesize of output 29 [2023-04-02 01:12:11,452 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 37 treesize of output 29 [2023-04-02 01:12:12,136 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-02 01:12:12,136 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:12:12,258 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:12,258 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 43 [2023-04-02 01:12:12,264 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:12:12,264 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2023-04-02 01:12:12,280 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 6 treesize of output 4 [2023-04-02 01:12:12,290 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 6 treesize of output 4 [2023-04-02 01:12:13,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931134086] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:12:13,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:12:13,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 19 [2023-04-02 01:12:13,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726623776] [2023-04-02 01:12:13,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:12:13,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-02 01:12:13,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:12:13,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-02 01:12:13,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=248, Unknown=2, NotChecked=66, Total=380 [2023-04-02 01:12:13,307 INFO L87 Difference]: Start difference. First operand 87 states and 107 transitions. Second operand has 19 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-04-02 01:12:26,417 WARN L223 SmtUtils]: Spent 12.70s on a formula simplification that was a NOOP. DAG size: 174 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 01:12:44,621 WARN L223 SmtUtils]: Spent 14.36s on a formula simplification that was a NOOP. DAG size: 190 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 01:13:05,246 WARN L223 SmtUtils]: Spent 9.21s on a formula simplification that was a NOOP. DAG size: 158 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 01:13:17,714 WARN L223 SmtUtils]: Spent 11.22s on a formula simplification that was a NOOP. DAG size: 162 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 01:13:20,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-04-02 01:13:24,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-04-02 01:13:24,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:13:24,935 INFO L93 Difference]: Finished difference Result 198 states and 253 transitions. [2023-04-02 01:13:24,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-04-02 01:13:24,942 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 31 [2023-04-02 01:13:24,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:13:24,943 INFO L225 Difference]: With dead ends: 198 [2023-04-02 01:13:24,943 INFO L226 Difference]: Without dead ends: 171 [2023-04-02 01:13:24,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 67.4s TimeCoverageRelationStatistics Valid=245, Invalid=1165, Unknown=4, NotChecked=146, Total=1560 [2023-04-02 01:13:24,944 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 221 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 62 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 354 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:13:24,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 19 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 888 Invalid, 2 Unknown, 354 Unchecked, 16.2s Time] [2023-04-02 01:13:24,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-04-02 01:13:24,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 106. [2023-04-02 01:13:24,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 84 states have internal predecessors, (100), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (17), 11 states have call predecessors, (17), 14 states have call successors, (17) [2023-04-02 01:13:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 133 transitions. [2023-04-02 01:13:24,970 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 133 transitions. Word has length 31 [2023-04-02 01:13:24,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:13:24,970 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 133 transitions. [2023-04-02 01:13:24,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-04-02 01:13:24,970 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2023-04-02 01:13:24,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-04-02 01:13:24,971 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:13:24,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:13:24,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-04-02 01:13:25,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:13:25,179 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:13:25,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:13:25,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1786828102, now seen corresponding path program 1 times [2023-04-02 01:13:25,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:13:25,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138995398] [2023-04-02 01:13:25,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:13:25,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:13:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:25,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:13:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:25,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 01:13:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:25,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 01:13:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:25,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-04-02 01:13:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:25,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:13:25,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:13:25,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138995398] [2023-04-02 01:13:25,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138995398] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:13:25,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:13:25,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-02 01:13:25,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091524155] [2023-04-02 01:13:25,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:13:25,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-02 01:13:25,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:13:25,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-02 01:13:25,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-04-02 01:13:25,495 INFO L87 Difference]: Start difference. First operand 106 states and 133 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-02 01:13:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:13:26,179 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2023-04-02 01:13:26,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 01:13:26,179 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2023-04-02 01:13:26,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:13:26,180 INFO L225 Difference]: With dead ends: 139 [2023-04-02 01:13:26,180 INFO L226 Difference]: Without dead ends: 120 [2023-04-02 01:13:26,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2023-04-02 01:13:26,181 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 104 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-02 01:13:26,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 13 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-04-02 01:13:26,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-04-02 01:13:26,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2023-04-02 01:13:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 80 states have internal predecessors, (96), 16 states have call successors, (16), 10 states have call predecessors, (16), 7 states have return successors, (15), 11 states have call predecessors, (15), 14 states have call successors, (15) [2023-04-02 01:13:26,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 127 transitions. [2023-04-02 01:13:26,204 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 127 transitions. Word has length 36 [2023-04-02 01:13:26,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:13:26,204 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 127 transitions. [2023-04-02 01:13:26,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-02 01:13:26,204 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2023-04-02 01:13:26,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-04-02 01:13:26,205 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:13:26,205 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:13:26,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-04-02 01:13:26,206 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:13:26,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:13:26,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1637961563, now seen corresponding path program 1 times [2023-04-02 01:13:26,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:13:26,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84755393] [2023-04-02 01:13:26,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:13:26,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:13:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:26,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:13:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:26,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 01:13:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:26,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-04-02 01:13:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:27,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-04-02 01:13:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:27,185 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-02 01:13:27,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:13:27,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84755393] [2023-04-02 01:13:27,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84755393] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:13:27,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532054948] [2023-04-02 01:13:27,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:13:27,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:13:27,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:13:27,187 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:13:27,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-02 01:13:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:27,439 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 74 conjunts are in the unsatisfiable core [2023-04-02 01:13:27,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:13:27,524 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-02 01:13:27,605 INFO L321 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2023-04-02 01:13:27,605 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-02 01:13:27,637 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-04-02 01:13:27,638 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-02 01:13:27,669 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-04-02 01:13:27,670 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-02 01:13:27,734 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2023-04-02 01:13:27,735 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-02 01:13:27,746 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-02 01:13:27,759 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-02 01:13:27,772 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-02 01:13:27,784 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-02 01:13:27,840 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-02 01:13:27,856 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-02 01:13:27,881 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:13:27,882 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:13:27,883 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 5 [2023-04-02 01:13:27,888 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-02 01:13:27,902 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 66 treesize of output 19 [2023-04-02 01:13:27,905 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 9 treesize of output 7 [2023-04-02 01:13:28,177 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 42 treesize of output 26 [2023-04-02 01:13:28,184 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-02 01:13:28,302 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 42 treesize of output 26 [2023-04-02 01:13:28,308 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-02 01:13:28,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:13:28,738 INFO L321 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2023-04-02 01:13:28,738 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 92 [2023-04-02 01:13:28,749 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:13:28,749 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 86 treesize of output 62 [2023-04-02 01:13:28,762 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 19 treesize of output 15 [2023-04-02 01:13:28,913 INFO L321 Elim1Store]: treesize reduction 107, result has 0.9 percent of original size [2023-04-02 01:13:28,914 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-02 01:13:29,018 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-02 01:13:29,086 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-02 01:13:29,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532054948] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:13:29,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:13:29,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 14] total 30 [2023-04-02 01:13:29,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476976367] [2023-04-02 01:13:29,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:13:29,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-04-02 01:13:29,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:13:29,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-04-02 01:13:29,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2023-04-02 01:13:29,088 INFO L87 Difference]: Start difference. First operand 102 states and 127 transitions. Second operand has 30 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 11 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (10), 6 states have call predecessors, (10), 9 states have call successors, (10) [2023-04-02 01:13:31,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:13:31,189 INFO L93 Difference]: Finished difference Result 137 states and 173 transitions. [2023-04-02 01:13:31,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-02 01:13:31,190 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 11 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (10), 6 states have call predecessors, (10), 9 states have call successors, (10) Word has length 37 [2023-04-02 01:13:31,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:13:31,191 INFO L225 Difference]: With dead ends: 137 [2023-04-02 01:13:31,191 INFO L226 Difference]: Without dead ends: 135 [2023-04-02 01:13:31,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=248, Invalid=1558, Unknown=0, NotChecked=0, Total=1806 [2023-04-02 01:13:31,193 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 149 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-04-02 01:13:31,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 33 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-04-02 01:13:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-04-02 01:13:31,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 115. [2023-04-02 01:13:31,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 87 states have (on average 1.2413793103448276) internal successors, (108), 91 states have internal predecessors, (108), 19 states have call successors, (19), 11 states have call predecessors, (19), 7 states have return successors, (18), 12 states have call predecessors, (18), 16 states have call successors, (18) [2023-04-02 01:13:31,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 145 transitions. [2023-04-02 01:13:31,219 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 145 transitions. Word has length 37 [2023-04-02 01:13:31,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:13:31,220 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 145 transitions. [2023-04-02 01:13:31,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 11 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (10), 6 states have call predecessors, (10), 9 states have call successors, (10) [2023-04-02 01:13:31,220 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2023-04-02 01:13:31,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-04-02 01:13:31,221 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:13:31,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:13:31,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-02 01:13:31,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:13:31,431 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:13:31,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:13:31,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1637963485, now seen corresponding path program 1 times [2023-04-02 01:13:31,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:13:31,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260303228] [2023-04-02 01:13:31,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:13:31,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:13:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:32,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:13:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:32,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 01:13:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:32,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-04-02 01:13:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:32,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-04-02 01:13:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:32,788 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-02 01:13:32,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:13:32,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260303228] [2023-04-02 01:13:32,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260303228] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:13:32,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677445830] [2023-04-02 01:13:32,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:13:32,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:13:32,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:13:32,790 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:13:32,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-02 01:13:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:33,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 78 conjunts are in the unsatisfiable core [2023-04-02 01:13:33,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:13:33,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2023-04-02 01:13:33,489 INFO L321 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2023-04-02 01:13:33,489 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-02 01:13:33,516 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-04-02 01:13:33,517 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-02 01:13:33,542 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-04-02 01:13:33,543 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-02 01:13:33,553 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-02 01:13:33,564 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-02 01:13:33,606 INFO L321 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2023-04-02 01:13:33,606 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-02 01:13:33,619 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-02 01:13:33,630 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-02 01:13:33,689 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-02 01:13:33,704 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-02 01:13:33,787 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-02 01:13:33,790 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-02 01:13:33,802 INFO L321 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2023-04-02 01:13:33,802 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-02 01:13:33,805 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-02 01:13:33,811 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-02 01:13:34,073 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:13:34,073 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 73 treesize of output 54 [2023-04-02 01:13:34,077 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 29 treesize of output 21 [2023-04-02 01:13:34,080 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-02 01:13:34,082 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-02 01:13:34,145 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 40 treesize of output 24 [2023-04-02 01:13:34,152 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-02 01:13:34,153 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:13:34,603 INFO L321 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2023-04-02 01:13:34,603 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-02 01:13:34,629 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:13:34,630 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-02 01:13:34,634 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-02 01:13:34,754 INFO L321 Elim1Store]: treesize reduction 107, result has 0.9 percent of original size [2023-04-02 01:13:34,755 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-02 01:13:35,004 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:13:35,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 76 [2023-04-02 01:13:35,141 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-02 01:13:35,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677445830] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:13:35,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:13:35,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 41 [2023-04-02 01:13:35,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193107591] [2023-04-02 01:13:35,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:13:35,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-04-02 01:13:35,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:13:35,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-04-02 01:13:35,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1485, Unknown=0, NotChecked=0, Total=1640 [2023-04-02 01:13:35,143 INFO L87 Difference]: Start difference. First operand 115 states and 145 transitions. Second operand has 41 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 34 states have internal predecessors, (70), 12 states have call successors, (14), 7 states have call predecessors, (14), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2023-04-02 01:13:37,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:13:37,886 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2023-04-02 01:13:37,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-04-02 01:13:37,887 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 34 states have internal predecessors, (70), 12 states have call successors, (14), 7 states have call predecessors, (14), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Word has length 37 [2023-04-02 01:13:37,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:13:37,888 INFO L225 Difference]: With dead ends: 144 [2023-04-02 01:13:37,888 INFO L226 Difference]: Without dead ends: 132 [2023-04-02 01:13:37,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=330, Invalid=2862, Unknown=0, NotChecked=0, Total=3192 [2023-04-02 01:13:37,889 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 146 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1916 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:13:37,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 47 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1916 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-04-02 01:13:37,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-04-02 01:13:37,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 115. [2023-04-02 01:13:37,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 87 states have (on average 1.2298850574712643) internal successors, (107), 91 states have internal predecessors, (107), 19 states have call successors, (19), 11 states have call predecessors, (19), 7 states have return successors, (18), 12 states have call predecessors, (18), 16 states have call successors, (18) [2023-04-02 01:13:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 144 transitions. [2023-04-02 01:13:37,914 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 144 transitions. Word has length 37 [2023-04-02 01:13:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:13:37,914 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 144 transitions. [2023-04-02 01:13:37,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 34 states have internal predecessors, (70), 12 states have call successors, (14), 7 states have call predecessors, (14), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2023-04-02 01:13:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 144 transitions. [2023-04-02 01:13:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-02 01:13:37,915 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:13:37,915 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:13:37,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-02 01:13:38,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:13:38,119 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:13:38,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:13:38,119 INFO L85 PathProgramCache]: Analyzing trace with hash 13934831, now seen corresponding path program 2 times [2023-04-02 01:13:38,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:13:38,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2564069] [2023-04-02 01:13:38,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:13:38,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:13:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:38,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:13:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:38,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 01:13:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:38,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-04-02 01:13:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:39,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-04-02 01:13:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 01:13:39,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:13:39,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2564069] [2023-04-02 01:13:39,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2564069] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:13:39,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138016129] [2023-04-02 01:13:39,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 01:13:39,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:13:39,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:13:39,197 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:13:39,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-02 01:13:39,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 01:13:39,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:13:39,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 64 conjunts are in the unsatisfiable core [2023-04-02 01:13:39,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:13:39,482 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-04-02 01:13:39,483 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-02 01:13:39,502 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 01:13:39,502 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-02 01:13:39,538 WARN L861 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2195 Int) (v_ArrVal_2198 (Array Int Int)) (v_ArrVal_2197 (Array Int Int)) (|v_receive_~#packet~0.base_67| Int)) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_67| v_ArrVal_2198)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_67| v_ArrVal_2197)) (= (select |c_old(#valid)| |v_receive_~#packet~0.base_67|) 0) (= |c_#valid| (store |c_old(#valid)| |v_receive_~#packet~0.base_67| v_ArrVal_2195)))) is different from true [2023-04-02 01:13:39,563 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 01:13:39,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-04-02 01:13:39,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-02 01:13:39,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-02 01:13:39,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-04-02 01:13:39,623 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 01:13:39,624 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-02 01:13:39,648 WARN L861 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2208 (Array Int Int)) (v_ArrVal_2206 (Array Int Int)) (|v_receive_~#packet~0.base_68| Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_68| v_ArrVal_2208)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_68| v_ArrVal_2206)) (= (select |c_old(#valid)| |v_receive_~#packet~0.base_68|) 0))) is different from true [2023-04-02 01:13:39,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:13:39,663 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-02 01:13:39,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:13:39,667 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-02 01:13:39,675 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-02 01:13:39,675 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-02 01:13:39,728 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2023-04-02 01:13:39,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:13:40,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138016129] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:13:40,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:13:40,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 18 [2023-04-02 01:13:40,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082711652] [2023-04-02 01:13:40,096 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:13:40,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-02 01:13:40,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:13:40,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-02 01:13:40,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=250, Unknown=2, NotChecked=66, Total=380 [2023-04-02 01:13:40,098 INFO L87 Difference]: Start difference. First operand 115 states and 144 transitions. Second operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 14 states have internal predecessors, (39), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-04-02 01:13:41,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:13:41,825 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2023-04-02 01:13:41,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-02 01:13:41,825 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 14 states have internal predecessors, (39), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 39 [2023-04-02 01:13:41,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:13:41,826 INFO L225 Difference]: With dead ends: 168 [2023-04-02 01:13:41,826 INFO L226 Difference]: Without dead ends: 150 [2023-04-02 01:13:41,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=161, Invalid=601, Unknown=2, NotChecked=106, Total=870 [2023-04-02 01:13:41,827 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 206 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-04-02 01:13:41,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 11 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 535 Invalid, 0 Unknown, 276 Unchecked, 1.3s Time] [2023-04-02 01:13:41,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-04-02 01:13:41,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 105. [2023-04-02 01:13:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 82 states have internal predecessors, (97), 17 states have call successors, (17), 11 states have call predecessors, (17), 7 states have return successors, (16), 11 states have call predecessors, (16), 14 states have call successors, (16) [2023-04-02 01:13:41,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2023-04-02 01:13:41,855 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 39 [2023-04-02 01:13:41,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:13:41,855 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2023-04-02 01:13:41,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 14 states have internal predecessors, (39), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-04-02 01:13:41,855 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2023-04-02 01:13:41,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-02 01:13:41,856 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:13:41,856 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:13:41,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-02 01:13:42,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-04-02 01:13:42,064 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:13:42,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:13:42,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1716929934, now seen corresponding path program 1 times [2023-04-02 01:13:42,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:13:42,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580367063] [2023-04-02 01:13:42,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:13:42,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:13:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:43,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:13:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:43,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 01:13:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:43,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 01:13:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:43,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 01:13:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:44,297 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 01:13:44,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:13:44,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580367063] [2023-04-02 01:13:44,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580367063] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:13:44,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431285268] [2023-04-02 01:13:44,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:13:44,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:13:44,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:13:44,299 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:13:44,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-02 01:13:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:44,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 111 conjunts are in the unsatisfiable core [2023-04-02 01:13:44,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:13:44,603 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 01:13:44,604 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-02 01:13:44,657 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 01:13:44,657 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-02 01:13:44,698 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 11 treesize of output 7 [2023-04-02 01:13:44,726 WARN L861 $PredicateComparison]: unable to prove that (exists ((|v_receive_~#packet~0.base_81| Int) (v_ArrVal_2552 Int)) (and (= (select |c_old(#valid)| |v_receive_~#packet~0.base_81|) 0) (= |c_#valid| (store |c_old(#valid)| |v_receive_~#packet~0.base_81| v_ArrVal_2552)))) is different from true [2023-04-02 01:13:44,778 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-04-02 01:13:44,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-04-02 01:13:44,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 21 treesize of output 9 [2023-04-02 01:13:44,916 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 11 treesize of output 7 [2023-04-02 01:13:44,970 INFO L321 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2023-04-02 01:13:44,970 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-02 01:13:45,008 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-04-02 01:13:45,009 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-02 01:13:45,042 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-04-02 01:13:45,042 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-02 01:13:45,087 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2023-04-02 01:13:45,087 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-02 01:13:45,103 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-02 01:13:45,116 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-02 01:13:45,131 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-02 01:13:45,142 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-02 01:13:45,206 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-02 01:13:45,222 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-02 01:13:45,275 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-02 01:13:45,281 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-02 01:13:45,317 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:13:45,317 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 9 [2023-04-02 01:13:45,322 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 9 treesize of output 7 [2023-04-02 01:13:45,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:13:45,757 INFO L321 Elim1Store]: treesize reduction 70, result has 38.6 percent of original size [2023-04-02 01:13:45,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 58 [2023-04-02 01:13:45,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-04-02 01:13:46,003 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 01:13:46,003 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-02 01:13:46,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 23 treesize of output 15 [2023-04-02 01:13:46,029 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:13:46,030 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 21 treesize of output 9 [2023-04-02 01:13:46,034 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-02 01:13:46,036 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-02 01:13:46,079 WARN L861 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2579 (Array Int Int)) (|v_receive_~#packet~0.base_82| Int) (v_ArrVal_2583 (Array Int Int)) (v_ArrVal_2582 (Array Int Int))) (and (= (store |c_old(#memory_int)| |v_receive_~#packet~0.base_82| v_ArrVal_2582) |c_#memory_int|) (= (select |c_old(#valid)| |v_receive_~#packet~0.base_82|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_82| v_ArrVal_2579)) (< |c_#StackHeapBarrier| |v_receive_~#packet~0.base_82|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_82| v_ArrVal_2583)))) is different from true [2023-04-02 01:13:46,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:13:46,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2023-04-02 01:13:46,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:13:46,124 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-04-02 01:13:46,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2023-04-02 01:13:46,134 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-02 01:13:46,134 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 1 case distinctions, treesize of input 11 treesize of output 11 [2023-04-02 01:13:46,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-02 01:13:46,151 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-02 01:13:46,243 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-02 01:13:46,247 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-02 01:13:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-04-02 01:13:46,389 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:13:46,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431285268] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:13:46,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:13:46,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2023-04-02 01:13:46,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780107109] [2023-04-02 01:13:46,746 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:13:46,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-04-02 01:13:46,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:13:46,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-04-02 01:13:46,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1352, Unknown=2, NotChecked=150, Total=1640 [2023-04-02 01:13:46,747 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand has 36 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 29 states have internal predecessors, (55), 9 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 01:13:54,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:13:54,559 INFO L93 Difference]: Finished difference Result 196 states and 251 transitions. [2023-04-02 01:13:54,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-04-02 01:13:54,560 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 29 states have internal predecessors, (55), 9 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 39 [2023-04-02 01:13:54,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:13:54,561 INFO L225 Difference]: With dead ends: 196 [2023-04-02 01:13:54,561 INFO L226 Difference]: Without dead ends: 169 [2023-04-02 01:13:54,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=509, Invalid=4053, Unknown=2, NotChecked=266, Total=4830 [2023-04-02 01:13:54,563 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 290 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 2069 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-04-02 01:13:54,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 39 Invalid, 2495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 2069 Invalid, 0 Unknown, 312 Unchecked, 5.3s Time] [2023-04-02 01:13:54,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-04-02 01:13:54,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 117. [2023-04-02 01:13:54,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 92 states have internal predecessors, (109), 19 states have call successors, (19), 12 states have call predecessors, (19), 8 states have return successors, (19), 12 states have call predecessors, (19), 16 states have call successors, (19) [2023-04-02 01:13:54,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 147 transitions. [2023-04-02 01:13:54,592 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 147 transitions. Word has length 39 [2023-04-02 01:13:54,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:13:54,592 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 147 transitions. [2023-04-02 01:13:54,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 29 states have internal predecessors, (55), 9 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 01:13:54,592 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 147 transitions. [2023-04-02 01:13:54,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-04-02 01:13:54,593 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:13:54,593 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:13:54,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-02 01:13:54,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-04-02 01:13:54,801 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:13:54,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:13:54,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1282077679, now seen corresponding path program 1 times [2023-04-02 01:13:54,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:13:54,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299106493] [2023-04-02 01:13:54,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:13:54,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:13:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:56,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:13:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:56,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 01:13:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:56,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 01:13:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:56,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-04-02 01:13:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:13:57,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:13:57,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299106493] [2023-04-02 01:13:57,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299106493] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:13:57,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974772581] [2023-04-02 01:13:57,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:13:57,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:13:57,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:13:57,232 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:13:57,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-02 01:13:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:13:57,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 141 conjunts are in the unsatisfiable core [2023-04-02 01:13:57,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:13:57,539 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 01:13:57,539 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-02 01:13:57,597 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 01:13:57,597 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-02 01:13:57,640 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-02 01:13:57,644 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-02 01:13:57,647 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-02 01:13:57,694 WARN L861 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2928 Int) (|v_receive_~#packet~0.base_92| Int) (v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2925 (Array Int Int))) (and (= |c_#valid| (store |c_old(#valid)| |v_receive_~#packet~0.base_92| v_ArrVal_2928)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_92| v_ArrVal_2929)) (= (select |c_old(#valid)| |v_receive_~#packet~0.base_92|) 0) (= (select (select |c_#memory_$Pointer$.offset| |v_receive_~#packet~0.base_92|) 8) |c_receive_#res.payload.offset|) (= (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_92| v_ArrVal_2925) |c_#memory_$Pointer$.base|) (= (select (select |c_#memory_$Pointer$.base| |v_receive_~#packet~0.base_92|) 8) |c_receive_#res.payload.base|))) is different from true [2023-04-02 01:13:57,726 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 01:13:57,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-04-02 01:13:57,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-02 01:13:57,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-02 01:13:57,945 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-04-02 01:13:57,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 7 [2023-04-02 01:13:57,954 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-04-02 01:13:57,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 7 [2023-04-02 01:13:57,957 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-02 01:13:57,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 67 [2023-04-02 01:13:57,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 67 [2023-04-02 01:13:58,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:13:58,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:13:58,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:13:58,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:13:58,270 INFO L321 Elim1Store]: treesize reduction 56, result has 42.9 percent of original size [2023-04-02 01:13:58,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 85 [2023-04-02 01:13:58,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:13:58,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:13:58,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:13:58,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:13:58,344 INFO L321 Elim1Store]: treesize reduction 56, result has 42.9 percent of original size [2023-04-02 01:13:58,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 85 [2023-04-02 01:13:58,376 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 0 case distinctions, treesize of input 14 treesize of output 11 [2023-04-02 01:13:58,410 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-02 01:13:58,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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-02 01:13:58,444 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 9 treesize of output 5 [2023-04-02 01:13:58,451 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 9 treesize of output 5 [2023-04-02 01:13:58,467 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 9 treesize of output 5 [2023-04-02 01:13:58,499 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 9 treesize of output 5 [2023-04-02 01:13:58,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:13:58,528 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 9 treesize of output 3 [2023-04-02 01:13:58,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:13:58,536 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 9 treesize of output 3 [2023-04-02 01:13:58,542 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-02 01:13:58,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:13:58,557 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 9 treesize of output 3 [2023-04-02 01:13:58,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:13:58,564 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 9 treesize of output 3 [2023-04-02 01:13:58,571 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-02 01:13:58,603 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:13:58,603 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 9 treesize of output 3 [2023-04-02 01:13:58,613 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:13:58,613 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 9 treesize of output 3 [2023-04-02 01:13:58,636 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-02 01:13:58,645 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-02 01:13:58,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:13:58,657 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 9 treesize of output 3 [2023-04-02 01:13:58,723 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 0 case distinctions, treesize of input 14 treesize of output 11 [2023-04-02 01:13:59,037 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:13:59,038 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 17 [2023-04-02 01:13:59,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:13:59,042 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 0 case distinctions, treesize of input 15 treesize of output 7 [2023-04-02 01:13:59,076 WARN L861 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2962 (Array Int Int)) (v_ArrVal_2961 (Array Int Int)) (|v_send_~#p.base_7| Int)) (and (< |c_#StackHeapBarrier| |v_send_~#p.base_7|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_send_~#p.base_7| v_ArrVal_2961)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_send_~#p.base_7| v_ArrVal_2962)))) is different from true [2023-04-02 01:13:59,108 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-04-02 01:13:59,108 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 54 treesize of output 58 [2023-04-02 01:13:59,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:13:59,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:13:59,123 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-04-02 01:13:59,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2023-04-02 01:13:59,136 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 38 treesize of output 28 [2023-04-02 01:13:59,205 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:13:59,205 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:14:01,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974772581] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:14:01,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:14:01,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2023-04-02 01:14:01,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239500343] [2023-04-02 01:14:01,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:14:01,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-04-02 01:14:01,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:14:01,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-04-02 01:14:01,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=711, Unknown=14, NotChecked=110, Total=930 [2023-04-02 01:14:01,452 INFO L87 Difference]: Start difference. First operand 117 states and 147 transitions. Second operand has 30 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 23 states have internal predecessors, (55), 9 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 01:14:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:14:21,686 INFO L93 Difference]: Finished difference Result 224 states and 290 transitions. [2023-04-02 01:14:21,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-04-02 01:14:21,687 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 23 states have internal predecessors, (55), 9 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 40 [2023-04-02 01:14:21,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:14:21,688 INFO L225 Difference]: With dead ends: 224 [2023-04-02 01:14:21,688 INFO L226 Difference]: Without dead ends: 197 [2023-04-02 01:14:21,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=328, Invalid=2514, Unknown=28, NotChecked=210, Total=3080 [2023-04-02 01:14:21,689 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 259 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-04-02 01:14:21,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 27 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1255 Invalid, 0 Unknown, 346 Unchecked, 8.8s Time] [2023-04-02 01:14:21,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-04-02 01:14:21,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 145. [2023-04-02 01:14:21,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 110 states have (on average 1.2181818181818183) internal successors, (134), 115 states have internal predecessors, (134), 24 states have call successors, (24), 14 states have call predecessors, (24), 9 states have return successors, (24), 15 states have call predecessors, (24), 21 states have call successors, (24) [2023-04-02 01:14:21,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 182 transitions. [2023-04-02 01:14:21,725 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 182 transitions. Word has length 40 [2023-04-02 01:14:21,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:14:21,726 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 182 transitions. [2023-04-02 01:14:21,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 23 states have internal predecessors, (55), 9 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 01:14:21,726 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 182 transitions. [2023-04-02 01:14:21,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-04-02 01:14:21,726 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:14:21,727 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:14:21,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-02 01:14:21,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-04-02 01:14:21,937 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:14:21,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:14:21,937 INFO L85 PathProgramCache]: Analyzing trace with hash -551732467, now seen corresponding path program 1 times [2023-04-02 01:14:21,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:14:21,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132789890] [2023-04-02 01:14:21,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:14:21,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:14:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:14:23,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:14:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:14:23,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 01:14:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:14:23,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-04-02 01:14:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:14:23,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-04-02 01:14:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:14:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 01:14:23,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:14:23,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132789890] [2023-04-02 01:14:23,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132789890] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:14:23,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911235276] [2023-04-02 01:14:23,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:14:23,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:14:23,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:14:23,768 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:14:23,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-02 01:14:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:14:24,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 110 conjunts are in the unsatisfiable core [2023-04-02 01:14:24,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:14:24,092 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 01:14:24,093 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-02 01:14:24,137 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 01:14:24,137 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-02 01:14:24,170 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-02 01:14:24,191 WARN L839 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3308 Int) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_160|))) (= (select |v_#valid_160| .cse0) (select |c_old(#valid)| .cse0))) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)))) is different from false [2023-04-02 01:14:24,193 WARN L861 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3308 Int) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_160|))) (= (select |v_#valid_160| .cse0) (select |c_old(#valid)| .cse0))) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)))) is different from true [2023-04-02 01:14:24,213 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (exists ((v_ArrVal_3308 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse0) (select |v_#valid_160| .cse0))))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|)) is different from false [2023-04-02 01:14:24,215 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (exists ((v_ArrVal_3308 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse0) (select |v_#valid_160| .cse0))))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|)) is different from true [2023-04-02 01:14:24,275 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (= (select (select |c_#memory_int| |c_main_~#new_packet~0.base|) |c_main_~#new_packet~0.offset|) |c_main_#t~mem38|) (exists ((v_ArrVal_3308 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse0) (select |v_#valid_160| .cse0))))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|)) is different from false [2023-04-02 01:14:24,278 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (= (select (select |c_#memory_int| |c_main_~#new_packet~0.base|) |c_main_~#new_packet~0.offset|) |c_main_#t~mem38|) (exists ((v_ArrVal_3308 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse0) (select |v_#valid_160| .cse0))))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|)) is different from true [2023-04-02 01:14:24,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2023-04-02 01:14:24,308 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (exists ((v_ArrVal_3308 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse0) (select |v_#valid_160| .cse0))))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|) (< (mod |c_main_#t~mem39| 4294967296) 500)) is different from false [2023-04-02 01:14:24,311 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (exists ((v_ArrVal_3308 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse0) (select |v_#valid_160| .cse0))))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|) (< (mod |c_main_#t~mem39| 4294967296) 500)) is different from true [2023-04-02 01:14:24,331 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse0) (select |v_#valid_160| .cse0)))))) is different from false [2023-04-02 01:14:24,333 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse0) (select |v_#valid_160| .cse0)))))) is different from true [2023-04-02 01:14:24,394 INFO L321 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2023-04-02 01:14:24,394 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-02 01:14:24,433 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2023-04-02 01:14:24,433 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-02 01:14:24,464 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-04-02 01:14:24,465 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-02 01:14:24,473 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-02 01:14:24,510 INFO L321 Elim1Store]: treesize reduction 42, result has 45.5 percent of original size [2023-04-02 01:14:24,510 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 52 treesize of output 114 [2023-04-02 01:14:24,520 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-02 01:14:24,537 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-02 01:14:24,547 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-02 01:14:24,643 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-02 01:14:24,709 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-02 01:14:24,715 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-02 01:14:24,793 INFO L321 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2023-04-02 01:14:24,794 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 144 treesize of output 92 [2023-04-02 01:14:24,798 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 87 treesize of output 69 [2023-04-02 01:14:24,807 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-02 01:14:24,888 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|))) (let ((.cse2 (= (select |c_old(#valid)| |c_append_to_queue_#in~q.base|) 0)) (.cse0 (= .cse3 |c_append_to_queue_#in~q.base|)) (.cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|) 0))) (or (and .cse0 (< |c_append_to_queue_#in~q.base| |c_#StackHeapBarrier|) .cse1 (or (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_append_to_queue_~#p.base_71| Int)) (and (= |c_append_to_queue_#in~p.size| (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0)) (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_71|) 0) (= |c_#valid| (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_71| v_ArrVal_3309) |c_append_to_queue_#in~q.base| v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327)))) (and .cse2 (exists ((v_ArrVal_3327 Int)) (= |c_#valid| (store |c_old(#valid)| |c_append_to_queue_#in~q.base| v_ArrVal_3327)))))) (and (let ((.cse4 (or (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_append_to_queue_~#p.base_71| Int)) (and (= |c_#valid| (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_71| v_ArrVal_3309) .cse3 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327)) (= |c_append_to_queue_#in~p.size| (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0)) (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_71|) 0))) (and .cse2 (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int)) (= |c_#valid| (store (store (store |c_old(#valid)| |c_append_to_queue_#in~q.base| v_ArrVal_3309) .cse3 v_ArrVal_3326) |c_append_to_queue_#in~q.base| v_ArrVal_3327))))))) (or (and (= (select (select |c_#memory_int| .cse3) 0) |c_append_to_queue_#in~p.size|) .cse4) (and .cse0 .cse4))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_29) |c_append_to_queue_#in~q.base| v_DerPreprocessor_30) .cse3 v_DerPreprocessor_29) |c_append_to_queue_#in~q.base| v_DerPreprocessor_30) .cse3) (select |c_#memory_$Pointer$.base| .cse3)) (= .cse3 (select v_DerPreprocessor_30 |c_append_to_queue_#in~q.offset|)))) (< .cse3 |c_#StackHeapBarrier|) (or (and .cse1 (not .cse0)) (and (exists ((v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int))) (and (= v_DerPreprocessor_27 (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_DerPreprocessor_27) |c_append_to_queue_#in~q.base| v_DerPreprocessor_28) .cse3 v_DerPreprocessor_27) |c_append_to_queue_#in~q.base| v_DerPreprocessor_28) .cse3)) (= (select v_DerPreprocessor_28 |c_append_to_queue_#in~q.offset|) 0))) .cse1)))))) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse5) (select |v_#valid_160| .cse5)))))) is different from false [2023-04-02 01:14:24,891 WARN L861 $PredicateComparison]: unable to prove that (and (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|))) (let ((.cse2 (= (select |c_old(#valid)| |c_append_to_queue_#in~q.base|) 0)) (.cse0 (= .cse3 |c_append_to_queue_#in~q.base|)) (.cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|) 0))) (or (and .cse0 (< |c_append_to_queue_#in~q.base| |c_#StackHeapBarrier|) .cse1 (or (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_append_to_queue_~#p.base_71| Int)) (and (= |c_append_to_queue_#in~p.size| (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0)) (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_71|) 0) (= |c_#valid| (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_71| v_ArrVal_3309) |c_append_to_queue_#in~q.base| v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327)))) (and .cse2 (exists ((v_ArrVal_3327 Int)) (= |c_#valid| (store |c_old(#valid)| |c_append_to_queue_#in~q.base| v_ArrVal_3327)))))) (and (let ((.cse4 (or (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_append_to_queue_~#p.base_71| Int)) (and (= |c_#valid| (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_71| v_ArrVal_3309) .cse3 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327)) (= |c_append_to_queue_#in~p.size| (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0)) (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_71|) 0))) (and .cse2 (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int)) (= |c_#valid| (store (store (store |c_old(#valid)| |c_append_to_queue_#in~q.base| v_ArrVal_3309) .cse3 v_ArrVal_3326) |c_append_to_queue_#in~q.base| v_ArrVal_3327))))))) (or (and (= (select (select |c_#memory_int| .cse3) 0) |c_append_to_queue_#in~p.size|) .cse4) (and .cse0 .cse4))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_29) |c_append_to_queue_#in~q.base| v_DerPreprocessor_30) .cse3 v_DerPreprocessor_29) |c_append_to_queue_#in~q.base| v_DerPreprocessor_30) .cse3) (select |c_#memory_$Pointer$.base| .cse3)) (= .cse3 (select v_DerPreprocessor_30 |c_append_to_queue_#in~q.offset|)))) (< .cse3 |c_#StackHeapBarrier|) (or (and .cse1 (not .cse0)) (and (exists ((v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int))) (and (= v_DerPreprocessor_27 (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_DerPreprocessor_27) |c_append_to_queue_#in~q.base| v_DerPreprocessor_28) .cse3 v_DerPreprocessor_27) |c_append_to_queue_#in~q.base| v_DerPreprocessor_28) .cse3)) (= (select v_DerPreprocessor_28 |c_append_to_queue_#in~q.offset|) 0))) .cse1)))))) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse5) (select |v_#valid_160| .cse5)))))) is different from true [2023-04-02 01:14:25,170 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|) 0))) (let ((.cse3 (select (select |c_#memory_int| .cse1) 0))) (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse0) (select |v_#valid_162| .cse0))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse1 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse1) (select |c_#memory_$Pointer$.base| .cse1)) (= .cse1 (select v_DerPreprocessor_30 0)))) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_main_~#prio_queue~0.base|) 0)) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|) (exists ((v_ArrVal_3308 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_append_to_queue_~#p.base_71| Int)) (let ((.cse2 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse2 |v_append_to_queue_~#p.base_71|) 0) (= |c_#valid| (store (store (store .cse2 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) .cse1 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327)) (= .cse3 (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0))))) (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse4) (select |v_#valid_160| .cse4))))) (< .cse1 |c_#StackHeapBarrier|) (< (mod .cse3 4294967296) 500)))) is different from false [2023-04-02 01:14:25,173 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|) 0))) (let ((.cse3 (select (select |c_#memory_int| .cse1) 0))) (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse0) (select |v_#valid_162| .cse0))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse1 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse1) (select |c_#memory_$Pointer$.base| .cse1)) (= .cse1 (select v_DerPreprocessor_30 0)))) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_main_~#prio_queue~0.base|) 0)) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|) (exists ((v_ArrVal_3308 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_append_to_queue_~#p.base_71| Int)) (let ((.cse2 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse2 |v_append_to_queue_~#p.base_71|) 0) (= |c_#valid| (store (store (store .cse2 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) .cse1 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327)) (= .cse3 (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0))))) (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse4) (select |v_#valid_160| .cse4))))) (< .cse1 |c_#StackHeapBarrier|) (< (mod .cse3 4294967296) 500)))) is different from true [2023-04-02 01:14:25,279 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|) 0))) (let ((.cse4 (select (select |c_#memory_int| .cse1) 0))) (and (= |c_main_~#prio_queue~0.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse0) (select |v_#valid_162| .cse0))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse1 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse1) (select |c_#memory_$Pointer$.base| .cse1)) (= .cse1 (select v_DerPreprocessor_30 0)))) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_main_~#prio_queue~0.base|) 0)) (exists ((v_ArrVal_3308 Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_append_to_queue_~#p.base_71| Int) (v_ArrVal_3331 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (let ((.cse2 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse2 |v_append_to_queue_~#p.base_71|) 0) (= |c_#valid| (store (store (store (store .cse2 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) .cse1 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331)) (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse3) (select |v_#valid_160| .cse3))) (= .cse4 (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0)) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_16|))))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|) (< .cse1 |c_#StackHeapBarrier|) (< (mod .cse4 4294967296) 500)))) is different from false [2023-04-02 01:14:25,283 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|) 0))) (let ((.cse4 (select (select |c_#memory_int| .cse1) 0))) (and (= |c_main_~#prio_queue~0.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse0) (select |v_#valid_162| .cse0))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse1 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse1) (select |c_#memory_$Pointer$.base| .cse1)) (= .cse1 (select v_DerPreprocessor_30 0)))) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_main_~#prio_queue~0.base|) 0)) (exists ((v_ArrVal_3308 Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_append_to_queue_~#p.base_71| Int) (v_ArrVal_3331 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (let ((.cse2 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse2 |v_append_to_queue_~#p.base_71|) 0) (= |c_#valid| (store (store (store (store .cse2 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) .cse1 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331)) (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse3) (select |v_#valid_160| .cse3))) (= .cse4 (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0)) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_16|))))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|) (< .cse1 |c_#StackHeapBarrier|) (< (mod .cse4 4294967296) 500)))) is different from true [2023-04-02 01:14:25,410 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|) 0))) (let ((.cse5 (select (select |c_#memory_int| .cse1) 0))) (and (= |c_main_~#prio_queue~0.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse0) (select |v_#valid_162| .cse0))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse1 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse1) (select |c_#memory_$Pointer$.base| .cse1)) (= .cse1 (select v_DerPreprocessor_30 0)))) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_main_~#prio_queue~0.base|) 0)) (exists ((v_ArrVal_3308 Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (v_ArrVal_3331 Int) (v_ArrVal_3332 Int) (|main_~#new_packet~0.base| Int) (|v_append_to_queue_~#p.base_71| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (let ((.cse2 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (let ((.cse3 (store (store (store (store .cse2 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) .cse1 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331))) (and (= (select .cse2 |v_append_to_queue_~#p.base_71|) 0) (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= |c_#valid| (store .cse3 |main_~#new_packet~0.base| v_ArrVal_3332)) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse4) (select |v_#valid_160| .cse4))) (= .cse5 (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0)) (= (select .cse3 |main_~#new_packet~0.base|) 0) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_16|)))))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|) (< .cse1 |c_#StackHeapBarrier|) (< (mod .cse5 4294967296) 500)))) is different from false [2023-04-02 01:14:25,413 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|) 0))) (let ((.cse5 (select (select |c_#memory_int| .cse1) 0))) (and (= |c_main_~#prio_queue~0.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse0) (select |v_#valid_162| .cse0))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse1 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse1) (select |c_#memory_$Pointer$.base| .cse1)) (= .cse1 (select v_DerPreprocessor_30 0)))) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_main_~#prio_queue~0.base|) 0)) (exists ((v_ArrVal_3308 Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (v_ArrVal_3331 Int) (v_ArrVal_3332 Int) (|main_~#new_packet~0.base| Int) (|v_append_to_queue_~#p.base_71| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (let ((.cse2 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (let ((.cse3 (store (store (store (store .cse2 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) .cse1 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331))) (and (= (select .cse2 |v_append_to_queue_~#p.base_71|) 0) (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= |c_#valid| (store .cse3 |main_~#new_packet~0.base| v_ArrVal_3332)) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse4) (select |v_#valid_160| .cse4))) (= .cse5 (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0)) (= (select .cse3 |main_~#new_packet~0.base|) 0) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_16|)))))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|) (< .cse1 |c_#StackHeapBarrier|) (< (mod .cse5 4294967296) 500)))) is different from true [2023-04-02 01:14:25,440 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:14:25,441 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 84 [2023-04-02 01:14:25,450 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 79 treesize of output 65 [2023-04-02 01:14:25,470 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-04-02 01:14:25,471 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2023-04-02 01:14:25,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-04-02 01:14:25,496 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 28 treesize of output 24 [2023-04-02 01:14:25,538 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse0) (select |v_#valid_162| .cse0))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (= |c_#valid| |c_old(#valid)|) (exists ((v_ArrVal_3308 Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int) (v_ArrVal_3331 Int) (|main_~#new_packet~0.base| Int) (v_arrayElimCell_295 Int) (|v_append_to_queue_~#p.base_71| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (let ((.cse1 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (= (select .cse1 |v_append_to_queue_~#p.base_71|) 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= (select (store (store (store (store .cse1 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse2) (select |v_#valid_160| .cse2))) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (< v_arrayElimCell_295 |c_#StackHeapBarrier|)))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from false [2023-04-02 01:14:25,542 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse0) (select |v_#valid_162| .cse0))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (= |c_#valid| |c_old(#valid)|) (exists ((v_ArrVal_3308 Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int) (v_ArrVal_3331 Int) (|main_~#new_packet~0.base| Int) (v_arrayElimCell_295 Int) (|v_append_to_queue_~#p.base_71| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (let ((.cse1 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (= (select .cse1 |v_append_to_queue_~#p.base_71|) 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= (select (store (store (store (store .cse1 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse2) (select |v_#valid_160| .cse2))) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (< v_arrayElimCell_295 |c_#StackHeapBarrier|)))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from true [2023-04-02 01:14:25,600 WARN L839 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse0) (select |v_#valid_162| .cse0))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (exists ((v_ArrVal_3308 Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int) (v_ArrVal_3331 Int) (|main_~#new_packet~0.base| Int) (v_arrayElimCell_295 Int) (|v_append_to_queue_~#p.base_71| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (let ((.cse1 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (= (select .cse1 |v_append_to_queue_~#p.base_71|) 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= (select (store (store (store (store .cse1 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse2) (select |v_#valid_160| .cse2))) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (< v_arrayElimCell_295 |c_#StackHeapBarrier|)))) (exists ((|v_receive_~#packet~0.base_100| Int) (v_ArrVal_3333 (Array Int Int)) (v_ArrVal_3336 (Array Int Int)) (v_ArrVal_3339 (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_receive_~#packet~0.base_100|) (= (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_100| v_ArrVal_3339) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_100| v_ArrVal_3336)) (= (select |c_old(#valid)| |v_receive_~#packet~0.base_100|) 0) (= |c_#memory_int| (store |c_old(#memory_int)| |v_receive_~#packet~0.base_100| v_ArrVal_3333))))) is different from false [2023-04-02 01:14:25,604 WARN L861 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse0) (select |v_#valid_162| .cse0))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (exists ((v_ArrVal_3308 Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int) (v_ArrVal_3331 Int) (|main_~#new_packet~0.base| Int) (v_arrayElimCell_295 Int) (|v_append_to_queue_~#p.base_71| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (let ((.cse1 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (= (select .cse1 |v_append_to_queue_~#p.base_71|) 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= (select (store (store (store (store .cse1 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse2) (select |v_#valid_160| .cse2))) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (< v_arrayElimCell_295 |c_#StackHeapBarrier|)))) (exists ((|v_receive_~#packet~0.base_100| Int) (v_ArrVal_3333 (Array Int Int)) (v_ArrVal_3336 (Array Int Int)) (v_ArrVal_3339 (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_receive_~#packet~0.base_100|) (= (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_100| v_ArrVal_3339) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_100| v_ArrVal_3336)) (= (select |c_old(#valid)| |v_receive_~#packet~0.base_100|) 0) (= |c_#memory_int| (store |c_old(#memory_int)| |v_receive_~#packet~0.base_100| v_ArrVal_3333))))) is different from true [2023-04-02 01:14:25,726 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-04-02 01:14:25,726 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 167 treesize of output 147 [2023-04-02 01:14:25,749 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 9 treesize of output 7 [2023-04-02 01:14:25,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:14:25,783 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-04-02 01:14:25,783 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 2 case distinctions, treesize of input 35 treesize of output 38 [2023-04-02 01:14:25,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:14:25,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-02 01:14:25,846 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 13 treesize of output 11 [2023-04-02 01:14:29,203 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|) 0))) (let ((.cse0 (+ .cse7 2)) (.cse13 (select (select |c_#memory_int| .cse7) 0))) (and (= |c_main_~#prio_queue~0.offset| 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_main_~#prio_queue~0.base|) 0)) (or (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int)) (and (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (exists ((|v_#valid_162| (Array Int Int)) (|v_receive_~#packet~0.base_101| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int)) (and (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (exists ((|v_main_~#new_packet~0.base_16| Int)) (and (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (exists ((|v_old(#valid)_AFTER_CALL_38| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (exists ((|v_#valid_160| (Array Int Int))) (and (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse1) (select |v_#valid_160| .cse1))) (exists ((|v_receive_~#packet~0.base_99| Int)) (and (exists ((v_ArrVal_3308 Int) (|v_append_to_queue_~#p.base_71| Int)) (let ((.cse2 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse2 |v_append_to_queue_~#p.base_71|) 0) (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_arrayElimCell_295 Int) (v_ArrVal_3327 Int) (v_ArrVal_3331 Int) (|main_~#new_packet~0.base| Int)) (let ((.cse3 (+ 2 v_arrayElimCell_295))) (and (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (<= .cse3 |c_main_~#prio_queue~0.base|) (= (select (store (store (store (store .cse2 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (exists ((|v_main_~#new_packet~0.base_17| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_main_~#prio_queue~0.base|) 1) (exists ((|v_#valid_166| (Array Int Int))) (and (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse4) (select |v_#valid_166| .cse4))) (exists ((|v_receive_~#packet~0.base_102| Int)) (and (exists ((|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3340 Int)) (let ((.cse6 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (and (<= .cse3 |v_append_to_queue_~#p.base_72|) (<= .cse0 |v_append_to_queue_~#p.base_72|) (exists ((|v_main_~#new_packet~0.base_18| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3332 Int) (v_ArrVal_3341 Int)) (let ((.cse5 (store (store (store (store .cse6 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) .cse7 v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344))) (and (= (select (store .cse5 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_append_to_queue_~#p.base_72|) 0) (= (select .cse5 |v_main_~#new_packet~0.base_18|) 0)))) (= (select .cse6 |v_append_to_queue_~#p.base_72|) 0)))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0))))))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)))) (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|))))))) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0))))))))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse8) (select |v_#valid_162| .cse8))))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0))))) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int)) (and (exists ((|v_#valid_162| (Array Int Int)) (|v_receive_~#packet~0.base_101| Int)) (and (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse9) (select |v_#valid_162| .cse9))) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int)) (and (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (exists ((|v_main_~#new_packet~0.base_16| Int)) (and (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (exists ((|v_old(#valid)_AFTER_CALL_38| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (exists ((|v_#valid_160| (Array Int Int))) (and (exists ((|v_receive_~#packet~0.base_99| Int)) (and (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (exists ((v_ArrVal_3308 Int) (|v_append_to_queue_~#p.base_71| Int)) (let ((.cse10 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse10 |v_append_to_queue_~#p.base_71|) 0) (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_arrayElimCell_295 Int) (v_ArrVal_3327 Int) (v_ArrVal_3331 Int) (|main_~#new_packet~0.base| Int)) (let ((.cse11 (+ 2 v_arrayElimCell_295))) (and (<= .cse11 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (<= .cse11 |c_main_~#prio_queue~0.base|) (= (select (store (store (store (store .cse10 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (<= .cse11 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (exists ((|v_main_~#new_packet~0.base_17| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_main_~#prio_queue~0.base|) 1) (exists ((|v_#valid_166| (Array Int Int))) (and (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse12) (select |v_#valid_166| .cse12))) (exists ((|v_receive_~#packet~0.base_102| Int)) (and (exists ((|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3340 Int)) (let ((.cse14 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (and (= .cse13 (select (select |c_#memory_int| |v_append_to_queue_~#p.base_72|) 0)) (= (select .cse14 |v_append_to_queue_~#p.base_72|) 0) (exists ((|v_main_~#new_packet~0.base_18| Int) (|v_receive_~#packet~0.base_100| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3332 Int) (v_ArrVal_3341 Int)) (let ((.cse15 (store (store (store (store .cse14 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) .cse7 v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344))) (and (= (select (store .cse15 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_receive_~#packet~0.base_100|) 0) (= (select .cse15 |v_main_~#new_packet~0.base_18|) 0) (<= .cse0 |v_receive_~#packet~0.base_100|) (<= .cse11 |v_receive_~#packet~0.base_100|))))))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0))))))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)))))))))))) (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse16) (select |v_#valid_160| .cse16))))))))))))))) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|)))) (<= .cse0 |c_main_~#prio_queue~0.base|) (< (mod .cse13 4294967296) 500)))) is different from false [2023-04-02 01:14:29,212 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|) 0))) (let ((.cse0 (+ .cse7 2)) (.cse13 (select (select |c_#memory_int| .cse7) 0))) (and (= |c_main_~#prio_queue~0.offset| 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_main_~#prio_queue~0.base|) 0)) (or (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int)) (and (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (exists ((|v_#valid_162| (Array Int Int)) (|v_receive_~#packet~0.base_101| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int)) (and (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (exists ((|v_main_~#new_packet~0.base_16| Int)) (and (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (exists ((|v_old(#valid)_AFTER_CALL_38| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (exists ((|v_#valid_160| (Array Int Int))) (and (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse1) (select |v_#valid_160| .cse1))) (exists ((|v_receive_~#packet~0.base_99| Int)) (and (exists ((v_ArrVal_3308 Int) (|v_append_to_queue_~#p.base_71| Int)) (let ((.cse2 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse2 |v_append_to_queue_~#p.base_71|) 0) (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_arrayElimCell_295 Int) (v_ArrVal_3327 Int) (v_ArrVal_3331 Int) (|main_~#new_packet~0.base| Int)) (let ((.cse3 (+ 2 v_arrayElimCell_295))) (and (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (<= .cse3 |c_main_~#prio_queue~0.base|) (= (select (store (store (store (store .cse2 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (exists ((|v_main_~#new_packet~0.base_17| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_main_~#prio_queue~0.base|) 1) (exists ((|v_#valid_166| (Array Int Int))) (and (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse4) (select |v_#valid_166| .cse4))) (exists ((|v_receive_~#packet~0.base_102| Int)) (and (exists ((|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3340 Int)) (let ((.cse6 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (and (<= .cse3 |v_append_to_queue_~#p.base_72|) (<= .cse0 |v_append_to_queue_~#p.base_72|) (exists ((|v_main_~#new_packet~0.base_18| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3332 Int) (v_ArrVal_3341 Int)) (let ((.cse5 (store (store (store (store .cse6 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) .cse7 v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344))) (and (= (select (store .cse5 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_append_to_queue_~#p.base_72|) 0) (= (select .cse5 |v_main_~#new_packet~0.base_18|) 0)))) (= (select .cse6 |v_append_to_queue_~#p.base_72|) 0)))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0))))))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)))) (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|))))))) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0))))))))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse8) (select |v_#valid_162| .cse8))))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0))))) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int)) (and (exists ((|v_#valid_162| (Array Int Int)) (|v_receive_~#packet~0.base_101| Int)) (and (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse9) (select |v_#valid_162| .cse9))) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int)) (and (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (exists ((|v_main_~#new_packet~0.base_16| Int)) (and (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (exists ((|v_old(#valid)_AFTER_CALL_38| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (exists ((|v_#valid_160| (Array Int Int))) (and (exists ((|v_receive_~#packet~0.base_99| Int)) (and (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (exists ((v_ArrVal_3308 Int) (|v_append_to_queue_~#p.base_71| Int)) (let ((.cse10 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse10 |v_append_to_queue_~#p.base_71|) 0) (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_arrayElimCell_295 Int) (v_ArrVal_3327 Int) (v_ArrVal_3331 Int) (|main_~#new_packet~0.base| Int)) (let ((.cse11 (+ 2 v_arrayElimCell_295))) (and (<= .cse11 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (<= .cse11 |c_main_~#prio_queue~0.base|) (= (select (store (store (store (store .cse10 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (<= .cse11 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (exists ((|v_main_~#new_packet~0.base_17| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_main_~#prio_queue~0.base|) 1) (exists ((|v_#valid_166| (Array Int Int))) (and (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse12) (select |v_#valid_166| .cse12))) (exists ((|v_receive_~#packet~0.base_102| Int)) (and (exists ((|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3340 Int)) (let ((.cse14 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (and (= .cse13 (select (select |c_#memory_int| |v_append_to_queue_~#p.base_72|) 0)) (= (select .cse14 |v_append_to_queue_~#p.base_72|) 0) (exists ((|v_main_~#new_packet~0.base_18| Int) (|v_receive_~#packet~0.base_100| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3332 Int) (v_ArrVal_3341 Int)) (let ((.cse15 (store (store (store (store .cse14 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) .cse7 v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344))) (and (= (select (store .cse15 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_receive_~#packet~0.base_100|) 0) (= (select .cse15 |v_main_~#new_packet~0.base_18|) 0) (<= .cse0 |v_receive_~#packet~0.base_100|) (<= .cse11 |v_receive_~#packet~0.base_100|))))))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0))))))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)))))))))))) (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse16) (select |v_#valid_160| .cse16))))))))))))))) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|)))) (<= .cse0 |c_main_~#prio_queue~0.base|) (< (mod .cse13 4294967296) 500)))) is different from true [2023-04-02 01:14:33,460 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 458 treesize of output 402 [2023-04-02 01:14:33,491 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-02 01:14:34,034 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_int| |c_main_#t~mem45.base|) 0))) (and (= |c_main_#t~mem45.offset| 0) (let ((.cse0 (+ 2 |c_main_#t~mem45.base|))) (or (exists ((|main_~#prio_queue~0.base| Int)) (and (<= .cse0 |main_~#prio_queue~0.base|) (exists ((v_ArrVal_3308 Int) (|v_main_~#new_packet~0.base_18| Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_17| Int) (|v_#valid_162| (Array Int Int)) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_#valid_166| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3340 Int) (v_ArrVal_3341 Int) (|v_receive_~#packet~0.base_101| Int) (|v_receive_~#packet~0.base_102| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_#valid_160| (Array Int Int)) (|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3331 Int) (v_ArrVal_3332 Int) (|main_~#new_packet~0.base| Int) (|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (v_arrayElimCell_295 Int) (|v_append_to_queue_~#p.base_71| Int) (|v_receive_~#packet~0.base_99| Int)) (let ((.cse7 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (let ((.cse3 (store (store (store (store .cse7 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) |c_main_#t~mem45.base| v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344)) (.cse4 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (.cse2 (+ 2 v_arrayElimCell_295))) (and (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse1) (select |v_#valid_166| .cse1))) (<= .cse2 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (= (select .cse3 |v_main_~#new_packet~0.base_18|) 0) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (<= .cse0 |v_append_to_queue_~#p.base_72|) (= (select .cse4 |v_append_to_queue_~#p.base_71|) 0) (<= .cse2 |v_append_to_queue_~#p.base_72|) (= (select (store .cse3 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_append_to_queue_~#p.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |main_~#prio_queue~0.base|) 1) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse5) (select |v_#valid_162| .cse5))) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (not (= |main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)) (<= .cse2 |main_~#prio_queue~0.base|) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (= (select (store (store (store (store .cse4 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse6) (select |v_#valid_160| .cse6))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (<= .cse2 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (= (select .cse7 |v_append_to_queue_~#p.base_72|) 0))))))) (exists ((|main_~#prio_queue~0.base| Int)) (and (<= .cse0 |main_~#prio_queue~0.base|) (exists ((v_prenex_180 (Array Int Int)) (v_prenex_189 (Array Int Int)) (v_prenex_178 Int) (v_prenex_179 Int) (|v_receive_~#packet~0.base_100| Int) (v_prenex_176 Int) (v_prenex_198 Int) (v_prenex_177 Int) (v_prenex_199 Int) (v_prenex_174 Int) (v_prenex_197 Int) (v_prenex_172 Int) (v_prenex_194 Int) (v_prenex_173 Int) (v_prenex_192 Int) (v_prenex_171 Int) (v_prenex_193 Int) (v_prenex_191 Int) (v_prenex_190 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_prenex_196 (Array Int Int)) (v_prenex_175 (Array Int Int)) (v_prenex_187 Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_183 Int) (v_prenex_184 Int) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse15 (store v_prenex_180 v_prenex_188 v_prenex_185))) (let ((.cse10 (store (store (store (store .cse15 v_prenex_191 v_prenex_186) |c_main_#t~mem45.base| v_prenex_183) v_prenex_191 v_prenex_184) v_prenex_174 v_prenex_182)) (.cse14 (store v_prenex_190 v_prenex_199 v_prenex_171)) (.cse8 (+ 2 v_prenex_197))) (and (<= .cse0 v_prenex_179) (<= .cse8 |main_~#prio_queue~0.base|) (= (select v_prenex_189 v_prenex_181) 1) (= (select v_prenex_195 v_prenex_179) 1) (<= .cse0 v_prenex_181) (= (select v_prenex_196 |main_~#prio_queue~0.base|) 1) (<= .cse0 |v_receive_~#packet~0.base_100|) (let ((.cse9 (@diff v_prenex_195 v_prenex_175))) (= (select v_prenex_195 .cse9) (select v_prenex_175 .cse9))) (= (select .cse10 v_prenex_172) 0) (= (select v_prenex_190 v_prenex_199) 0) (not (= v_prenex_176 v_prenex_181)) (not (= |main_~#prio_queue~0.base| v_prenex_174)) (<= .cse8 v_prenex_179) (= (select v_prenex_180 v_prenex_188) 0) (let ((.cse11 (@diff v_prenex_196 v_prenex_180))) (= (select v_prenex_180 .cse11) (select v_prenex_196 .cse11))) (= (select v_prenex_175 v_prenex_187) 0) (= 0 (select (store .cse10 v_prenex_172 v_prenex_193) |v_receive_~#packet~0.base_100|)) (= (select (select |c_#memory_int| v_prenex_191) 0) .cse12) (let ((.cse13 (@diff v_prenex_189 v_prenex_190))) (= (select v_prenex_189 .cse13) (select v_prenex_190 .cse13))) (<= .cse8 |v_receive_~#packet~0.base_100|) (= (select .cse14 v_prenex_198) 0) (= (select (store (store (store (store .cse14 v_prenex_198 v_prenex_173) v_prenex_197 v_prenex_177) v_prenex_198 v_prenex_178) v_prenex_176 v_prenex_192) v_prenex_194) 0) (<= .cse8 v_prenex_181) (= (select .cse15 v_prenex_191) 0))))))))) (< (mod .cse12 4294967296) 500))) is different from false [2023-04-02 01:14:34,045 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_int| |c_main_#t~mem45.base|) 0))) (and (= |c_main_#t~mem45.offset| 0) (let ((.cse0 (+ 2 |c_main_#t~mem45.base|))) (or (exists ((|main_~#prio_queue~0.base| Int)) (and (<= .cse0 |main_~#prio_queue~0.base|) (exists ((v_ArrVal_3308 Int) (|v_main_~#new_packet~0.base_18| Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_17| Int) (|v_#valid_162| (Array Int Int)) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_#valid_166| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3340 Int) (v_ArrVal_3341 Int) (|v_receive_~#packet~0.base_101| Int) (|v_receive_~#packet~0.base_102| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_#valid_160| (Array Int Int)) (|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3331 Int) (v_ArrVal_3332 Int) (|main_~#new_packet~0.base| Int) (|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (v_arrayElimCell_295 Int) (|v_append_to_queue_~#p.base_71| Int) (|v_receive_~#packet~0.base_99| Int)) (let ((.cse7 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (let ((.cse3 (store (store (store (store .cse7 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) |c_main_#t~mem45.base| v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344)) (.cse4 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (.cse2 (+ 2 v_arrayElimCell_295))) (and (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse1) (select |v_#valid_166| .cse1))) (<= .cse2 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (= (select .cse3 |v_main_~#new_packet~0.base_18|) 0) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (<= .cse0 |v_append_to_queue_~#p.base_72|) (= (select .cse4 |v_append_to_queue_~#p.base_71|) 0) (<= .cse2 |v_append_to_queue_~#p.base_72|) (= (select (store .cse3 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_append_to_queue_~#p.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |main_~#prio_queue~0.base|) 1) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse5) (select |v_#valid_162| .cse5))) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (not (= |main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)) (<= .cse2 |main_~#prio_queue~0.base|) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (= (select (store (store (store (store .cse4 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse6) (select |v_#valid_160| .cse6))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (<= .cse2 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (= (select .cse7 |v_append_to_queue_~#p.base_72|) 0))))))) (exists ((|main_~#prio_queue~0.base| Int)) (and (<= .cse0 |main_~#prio_queue~0.base|) (exists ((v_prenex_180 (Array Int Int)) (v_prenex_189 (Array Int Int)) (v_prenex_178 Int) (v_prenex_179 Int) (|v_receive_~#packet~0.base_100| Int) (v_prenex_176 Int) (v_prenex_198 Int) (v_prenex_177 Int) (v_prenex_199 Int) (v_prenex_174 Int) (v_prenex_197 Int) (v_prenex_172 Int) (v_prenex_194 Int) (v_prenex_173 Int) (v_prenex_192 Int) (v_prenex_171 Int) (v_prenex_193 Int) (v_prenex_191 Int) (v_prenex_190 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_prenex_196 (Array Int Int)) (v_prenex_175 (Array Int Int)) (v_prenex_187 Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_183 Int) (v_prenex_184 Int) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse15 (store v_prenex_180 v_prenex_188 v_prenex_185))) (let ((.cse10 (store (store (store (store .cse15 v_prenex_191 v_prenex_186) |c_main_#t~mem45.base| v_prenex_183) v_prenex_191 v_prenex_184) v_prenex_174 v_prenex_182)) (.cse14 (store v_prenex_190 v_prenex_199 v_prenex_171)) (.cse8 (+ 2 v_prenex_197))) (and (<= .cse0 v_prenex_179) (<= .cse8 |main_~#prio_queue~0.base|) (= (select v_prenex_189 v_prenex_181) 1) (= (select v_prenex_195 v_prenex_179) 1) (<= .cse0 v_prenex_181) (= (select v_prenex_196 |main_~#prio_queue~0.base|) 1) (<= .cse0 |v_receive_~#packet~0.base_100|) (let ((.cse9 (@diff v_prenex_195 v_prenex_175))) (= (select v_prenex_195 .cse9) (select v_prenex_175 .cse9))) (= (select .cse10 v_prenex_172) 0) (= (select v_prenex_190 v_prenex_199) 0) (not (= v_prenex_176 v_prenex_181)) (not (= |main_~#prio_queue~0.base| v_prenex_174)) (<= .cse8 v_prenex_179) (= (select v_prenex_180 v_prenex_188) 0) (let ((.cse11 (@diff v_prenex_196 v_prenex_180))) (= (select v_prenex_180 .cse11) (select v_prenex_196 .cse11))) (= (select v_prenex_175 v_prenex_187) 0) (= 0 (select (store .cse10 v_prenex_172 v_prenex_193) |v_receive_~#packet~0.base_100|)) (= (select (select |c_#memory_int| v_prenex_191) 0) .cse12) (let ((.cse13 (@diff v_prenex_189 v_prenex_190))) (= (select v_prenex_189 .cse13) (select v_prenex_190 .cse13))) (<= .cse8 |v_receive_~#packet~0.base_100|) (= (select .cse14 v_prenex_198) 0) (= (select (store (store (store (store .cse14 v_prenex_198 v_prenex_173) v_prenex_197 v_prenex_177) v_prenex_198 v_prenex_178) v_prenex_176 v_prenex_192) v_prenex_194) 0) (<= .cse8 v_prenex_181) (= (select .cse15 v_prenex_191) 0))))))))) (< (mod .cse12 4294967296) 500))) is different from true [2023-04-02 01:14:34,468 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_int| |c_process_prio_queue_#in~q.base|) 0))) (and (let ((.cse0 (+ |c_process_prio_queue_#in~q.base| 2))) (or (exists ((|main_~#prio_queue~0.base| Int)) (and (<= .cse0 |main_~#prio_queue~0.base|) (exists ((v_ArrVal_3308 Int) (|v_main_~#new_packet~0.base_18| Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_17| Int) (|v_#valid_162| (Array Int Int)) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_#valid_166| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3340 Int) (v_ArrVal_3341 Int) (|v_receive_~#packet~0.base_101| Int) (|v_receive_~#packet~0.base_102| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_#valid_160| (Array Int Int)) (|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3331 Int) (v_ArrVal_3332 Int) (|main_~#new_packet~0.base| Int) (|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (v_arrayElimCell_295 Int) (|v_append_to_queue_~#p.base_71| Int) (|v_receive_~#packet~0.base_99| Int)) (let ((.cse7 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (let ((.cse3 (store (store (store (store .cse7 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) |c_process_prio_queue_#in~q.base| v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344)) (.cse4 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (.cse2 (+ 2 v_arrayElimCell_295))) (and (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse1) (select |v_#valid_166| .cse1))) (<= .cse2 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select .cse3 |v_main_~#new_packet~0.base_18|) 0) (= (select .cse4 |v_append_to_queue_~#p.base_71|) 0) (<= .cse2 |v_append_to_queue_~#p.base_72|) (= (select |v_old(#valid)_AFTER_CALL_42| |main_~#prio_queue~0.base|) 1) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse5) (select |v_#valid_162| .cse5))) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (not (= |main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)) (<= .cse2 |main_~#prio_queue~0.base|) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (= (select (store .cse3 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_append_to_queue_~#p.base_72|) 0) (= (select (store (store (store (store .cse4 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (<= .cse0 |v_append_to_queue_~#p.base_72|) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse6) (select |v_#valid_160| .cse6))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0) (<= .cse2 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (= (select .cse7 |v_append_to_queue_~#p.base_72|) 0))))))) (exists ((|main_~#prio_queue~0.base| Int)) (and (exists ((v_prenex_180 (Array Int Int)) (v_prenex_189 (Array Int Int)) (v_prenex_178 Int) (v_prenex_179 Int) (|v_receive_~#packet~0.base_100| Int) (v_prenex_176 Int) (v_prenex_198 Int) (v_prenex_177 Int) (v_prenex_199 Int) (v_prenex_174 Int) (v_prenex_197 Int) (v_prenex_172 Int) (v_prenex_194 Int) (v_prenex_173 Int) (v_prenex_192 Int) (v_prenex_171 Int) (v_prenex_193 Int) (v_prenex_191 Int) (v_prenex_190 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_prenex_196 (Array Int Int)) (v_prenex_175 (Array Int Int)) (v_prenex_187 Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_183 Int) (v_prenex_184 Int) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse15 (store v_prenex_180 v_prenex_188 v_prenex_185))) (let ((.cse12 (store (store (store (store .cse15 v_prenex_191 v_prenex_186) |c_process_prio_queue_#in~q.base| v_prenex_183) v_prenex_191 v_prenex_184) v_prenex_174 v_prenex_182)) (.cse14 (store v_prenex_190 v_prenex_199 v_prenex_171)) (.cse9 (+ 2 v_prenex_197))) (and (= (select (select |c_#memory_int| v_prenex_191) 0) .cse8) (<= .cse0 v_prenex_181) (<= .cse9 |main_~#prio_queue~0.base|) (<= .cse0 |v_receive_~#packet~0.base_100|) (= (select v_prenex_189 v_prenex_181) 1) (= (select v_prenex_195 v_prenex_179) 1) (= (select v_prenex_196 |main_~#prio_queue~0.base|) 1) (let ((.cse10 (@diff v_prenex_195 v_prenex_175))) (= (select v_prenex_195 .cse10) (select v_prenex_175 .cse10))) (<= .cse0 v_prenex_179) (= (select v_prenex_190 v_prenex_199) 0) (not (= v_prenex_176 v_prenex_181)) (not (= |main_~#prio_queue~0.base| v_prenex_174)) (<= .cse9 v_prenex_179) (= (select v_prenex_180 v_prenex_188) 0) (let ((.cse11 (@diff v_prenex_196 v_prenex_180))) (= (select v_prenex_180 .cse11) (select v_prenex_196 .cse11))) (= (select (store .cse12 v_prenex_172 v_prenex_193) |v_receive_~#packet~0.base_100|) 0) (= (select v_prenex_175 v_prenex_187) 0) (= (select .cse12 v_prenex_172) 0) (let ((.cse13 (@diff v_prenex_189 v_prenex_190))) (= (select v_prenex_189 .cse13) (select v_prenex_190 .cse13))) (<= .cse9 |v_receive_~#packet~0.base_100|) (= (select .cse14 v_prenex_198) 0) (= (select (store (store (store (store .cse14 v_prenex_198 v_prenex_173) v_prenex_197 v_prenex_177) v_prenex_198 v_prenex_178) v_prenex_176 v_prenex_192) v_prenex_194) 0) (<= .cse9 v_prenex_181) (= (select .cse15 v_prenex_191) 0))))) (<= .cse0 |main_~#prio_queue~0.base|))))) (< (mod .cse8 4294967296) 500) (= |c_process_prio_queue_#in~q.offset| 0))) is different from false [2023-04-02 01:14:34,476 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_int| |c_process_prio_queue_#in~q.base|) 0))) (and (let ((.cse0 (+ |c_process_prio_queue_#in~q.base| 2))) (or (exists ((|main_~#prio_queue~0.base| Int)) (and (<= .cse0 |main_~#prio_queue~0.base|) (exists ((v_ArrVal_3308 Int) (|v_main_~#new_packet~0.base_18| Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_17| Int) (|v_#valid_162| (Array Int Int)) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_#valid_166| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3340 Int) (v_ArrVal_3341 Int) (|v_receive_~#packet~0.base_101| Int) (|v_receive_~#packet~0.base_102| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_#valid_160| (Array Int Int)) (|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3331 Int) (v_ArrVal_3332 Int) (|main_~#new_packet~0.base| Int) (|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (v_arrayElimCell_295 Int) (|v_append_to_queue_~#p.base_71| Int) (|v_receive_~#packet~0.base_99| Int)) (let ((.cse7 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (let ((.cse3 (store (store (store (store .cse7 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) |c_process_prio_queue_#in~q.base| v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344)) (.cse4 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (.cse2 (+ 2 v_arrayElimCell_295))) (and (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse1) (select |v_#valid_166| .cse1))) (<= .cse2 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select .cse3 |v_main_~#new_packet~0.base_18|) 0) (= (select .cse4 |v_append_to_queue_~#p.base_71|) 0) (<= .cse2 |v_append_to_queue_~#p.base_72|) (= (select |v_old(#valid)_AFTER_CALL_42| |main_~#prio_queue~0.base|) 1) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse5) (select |v_#valid_162| .cse5))) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (not (= |main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)) (<= .cse2 |main_~#prio_queue~0.base|) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (= (select (store .cse3 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_append_to_queue_~#p.base_72|) 0) (= (select (store (store (store (store .cse4 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (<= .cse0 |v_append_to_queue_~#p.base_72|) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse6) (select |v_#valid_160| .cse6))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0) (<= .cse2 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (= (select .cse7 |v_append_to_queue_~#p.base_72|) 0))))))) (exists ((|main_~#prio_queue~0.base| Int)) (and (exists ((v_prenex_180 (Array Int Int)) (v_prenex_189 (Array Int Int)) (v_prenex_178 Int) (v_prenex_179 Int) (|v_receive_~#packet~0.base_100| Int) (v_prenex_176 Int) (v_prenex_198 Int) (v_prenex_177 Int) (v_prenex_199 Int) (v_prenex_174 Int) (v_prenex_197 Int) (v_prenex_172 Int) (v_prenex_194 Int) (v_prenex_173 Int) (v_prenex_192 Int) (v_prenex_171 Int) (v_prenex_193 Int) (v_prenex_191 Int) (v_prenex_190 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_prenex_196 (Array Int Int)) (v_prenex_175 (Array Int Int)) (v_prenex_187 Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_183 Int) (v_prenex_184 Int) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse15 (store v_prenex_180 v_prenex_188 v_prenex_185))) (let ((.cse12 (store (store (store (store .cse15 v_prenex_191 v_prenex_186) |c_process_prio_queue_#in~q.base| v_prenex_183) v_prenex_191 v_prenex_184) v_prenex_174 v_prenex_182)) (.cse14 (store v_prenex_190 v_prenex_199 v_prenex_171)) (.cse9 (+ 2 v_prenex_197))) (and (= (select (select |c_#memory_int| v_prenex_191) 0) .cse8) (<= .cse0 v_prenex_181) (<= .cse9 |main_~#prio_queue~0.base|) (<= .cse0 |v_receive_~#packet~0.base_100|) (= (select v_prenex_189 v_prenex_181) 1) (= (select v_prenex_195 v_prenex_179) 1) (= (select v_prenex_196 |main_~#prio_queue~0.base|) 1) (let ((.cse10 (@diff v_prenex_195 v_prenex_175))) (= (select v_prenex_195 .cse10) (select v_prenex_175 .cse10))) (<= .cse0 v_prenex_179) (= (select v_prenex_190 v_prenex_199) 0) (not (= v_prenex_176 v_prenex_181)) (not (= |main_~#prio_queue~0.base| v_prenex_174)) (<= .cse9 v_prenex_179) (= (select v_prenex_180 v_prenex_188) 0) (let ((.cse11 (@diff v_prenex_196 v_prenex_180))) (= (select v_prenex_180 .cse11) (select v_prenex_196 .cse11))) (= (select (store .cse12 v_prenex_172 v_prenex_193) |v_receive_~#packet~0.base_100|) 0) (= (select v_prenex_175 v_prenex_187) 0) (= (select .cse12 v_prenex_172) 0) (let ((.cse13 (@diff v_prenex_189 v_prenex_190))) (= (select v_prenex_189 .cse13) (select v_prenex_190 .cse13))) (<= .cse9 |v_receive_~#packet~0.base_100|) (= (select .cse14 v_prenex_198) 0) (= (select (store (store (store (store .cse14 v_prenex_198 v_prenex_173) v_prenex_197 v_prenex_177) v_prenex_198 v_prenex_178) v_prenex_176 v_prenex_192) v_prenex_194) 0) (<= .cse9 v_prenex_181) (= (select .cse15 v_prenex_191) 0))))) (<= .cse0 |main_~#prio_queue~0.base|))))) (< (mod .cse8 4294967296) 500) (= |c_process_prio_queue_#in~q.offset| 0))) is different from true [2023-04-02 01:14:34,888 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_process_prio_queue_~node~1.base) 0))) (and (= c_process_prio_queue_~node~1.offset 0) (< (mod .cse0 4294967296) 500) (let ((.cse1 (+ c_process_prio_queue_~node~1.base 2))) (or (exists ((|main_~#prio_queue~0.base| Int)) (and (<= .cse1 |main_~#prio_queue~0.base|) (exists ((v_prenex_180 (Array Int Int)) (v_prenex_189 (Array Int Int)) (v_prenex_178 Int) (v_prenex_179 Int) (|v_receive_~#packet~0.base_100| Int) (v_prenex_176 Int) (v_prenex_198 Int) (v_prenex_177 Int) (v_prenex_199 Int) (v_prenex_174 Int) (v_prenex_197 Int) (v_prenex_172 Int) (v_prenex_194 Int) (v_prenex_173 Int) (v_prenex_192 Int) (v_prenex_171 Int) (v_prenex_193 Int) (v_prenex_191 Int) (v_prenex_190 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_prenex_196 (Array Int Int)) (v_prenex_175 (Array Int Int)) (v_prenex_187 Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_183 Int) (v_prenex_184 Int) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse8 (store v_prenex_180 v_prenex_188 v_prenex_185))) (let ((.cse2 (store (store (store (store .cse8 v_prenex_191 v_prenex_186) c_process_prio_queue_~node~1.base v_prenex_183) v_prenex_191 v_prenex_184) v_prenex_174 v_prenex_182)) (.cse7 (store v_prenex_190 v_prenex_199 v_prenex_171)) (.cse3 (+ 2 v_prenex_197))) (and (= (select .cse2 v_prenex_172) 0) (<= .cse1 v_prenex_181) (<= .cse3 |main_~#prio_queue~0.base|) (= (select v_prenex_189 v_prenex_181) 1) (= (select v_prenex_195 v_prenex_179) 1) (= (select v_prenex_196 |main_~#prio_queue~0.base|) 1) (let ((.cse4 (@diff v_prenex_195 v_prenex_175))) (= (select v_prenex_195 .cse4) (select v_prenex_175 .cse4))) (= (select v_prenex_190 v_prenex_199) 0) (not (= v_prenex_176 v_prenex_181)) (not (= |main_~#prio_queue~0.base| v_prenex_174)) (<= .cse3 v_prenex_179) (= (select v_prenex_180 v_prenex_188) 0) (let ((.cse5 (@diff v_prenex_196 v_prenex_180))) (= (select v_prenex_180 .cse5) (select v_prenex_196 .cse5))) (= (select v_prenex_175 v_prenex_187) 0) (<= .cse1 v_prenex_179) (= (select (store .cse2 v_prenex_172 v_prenex_193) |v_receive_~#packet~0.base_100|) 0) (let ((.cse6 (@diff v_prenex_189 v_prenex_190))) (= (select v_prenex_189 .cse6) (select v_prenex_190 .cse6))) (<= .cse3 |v_receive_~#packet~0.base_100|) (= (select .cse7 v_prenex_198) 0) (= (select (select |c_#memory_int| v_prenex_191) 0) .cse0) (<= .cse1 |v_receive_~#packet~0.base_100|) (= (select (store (store (store (store .cse7 v_prenex_198 v_prenex_173) v_prenex_197 v_prenex_177) v_prenex_198 v_prenex_178) v_prenex_176 v_prenex_192) v_prenex_194) 0) (<= .cse3 v_prenex_181) (= (select .cse8 v_prenex_191) 0))))))) (exists ((|main_~#prio_queue~0.base| Int)) (and (<= .cse1 |main_~#prio_queue~0.base|) (exists ((v_ArrVal_3308 Int) (|v_main_~#new_packet~0.base_18| Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_17| Int) (|v_#valid_162| (Array Int Int)) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_#valid_166| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3340 Int) (v_ArrVal_3341 Int) (|v_receive_~#packet~0.base_101| Int) (|v_receive_~#packet~0.base_102| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_#valid_160| (Array Int Int)) (|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3331 Int) (v_ArrVal_3332 Int) (|main_~#new_packet~0.base| Int) (|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (v_arrayElimCell_295 Int) (|v_append_to_queue_~#p.base_71| Int) (|v_receive_~#packet~0.base_99| Int)) (let ((.cse15 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (let ((.cse13 (store (store (store (store .cse15 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) c_process_prio_queue_~node~1.base v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344)) (.cse11 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (.cse10 (+ 2 v_arrayElimCell_295))) (and (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse9) (select |v_#valid_166| .cse9))) (<= .cse10 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (= (select .cse11 |v_append_to_queue_~#p.base_71|) 0) (<= .cse10 |v_append_to_queue_~#p.base_72|) (= (select |v_old(#valid)_AFTER_CALL_42| |main_~#prio_queue~0.base|) 1) (<= .cse1 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse12) (select |v_#valid_162| .cse12))) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (= (select (store .cse13 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_append_to_queue_~#p.base_72|) 0) (not (= |main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)) (<= .cse10 |main_~#prio_queue~0.base|) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (<= .cse1 |v_append_to_queue_~#p.base_72|) (= (select .cse13 |v_main_~#new_packet~0.base_18|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (= (select (store (store (store (store .cse11 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse14) (select |v_#valid_160| .cse14))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0) (<= .cse10 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (= (select .cse15 |v_append_to_queue_~#p.base_72|) 0) (<= .cse1 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|))))))))))) is different from false [2023-04-02 01:14:34,898 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_process_prio_queue_~node~1.base) 0))) (and (= c_process_prio_queue_~node~1.offset 0) (< (mod .cse0 4294967296) 500) (let ((.cse1 (+ c_process_prio_queue_~node~1.base 2))) (or (exists ((|main_~#prio_queue~0.base| Int)) (and (<= .cse1 |main_~#prio_queue~0.base|) (exists ((v_prenex_180 (Array Int Int)) (v_prenex_189 (Array Int Int)) (v_prenex_178 Int) (v_prenex_179 Int) (|v_receive_~#packet~0.base_100| Int) (v_prenex_176 Int) (v_prenex_198 Int) (v_prenex_177 Int) (v_prenex_199 Int) (v_prenex_174 Int) (v_prenex_197 Int) (v_prenex_172 Int) (v_prenex_194 Int) (v_prenex_173 Int) (v_prenex_192 Int) (v_prenex_171 Int) (v_prenex_193 Int) (v_prenex_191 Int) (v_prenex_190 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_prenex_196 (Array Int Int)) (v_prenex_175 (Array Int Int)) (v_prenex_187 Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_183 Int) (v_prenex_184 Int) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse8 (store v_prenex_180 v_prenex_188 v_prenex_185))) (let ((.cse2 (store (store (store (store .cse8 v_prenex_191 v_prenex_186) c_process_prio_queue_~node~1.base v_prenex_183) v_prenex_191 v_prenex_184) v_prenex_174 v_prenex_182)) (.cse7 (store v_prenex_190 v_prenex_199 v_prenex_171)) (.cse3 (+ 2 v_prenex_197))) (and (= (select .cse2 v_prenex_172) 0) (<= .cse1 v_prenex_181) (<= .cse3 |main_~#prio_queue~0.base|) (= (select v_prenex_189 v_prenex_181) 1) (= (select v_prenex_195 v_prenex_179) 1) (= (select v_prenex_196 |main_~#prio_queue~0.base|) 1) (let ((.cse4 (@diff v_prenex_195 v_prenex_175))) (= (select v_prenex_195 .cse4) (select v_prenex_175 .cse4))) (= (select v_prenex_190 v_prenex_199) 0) (not (= v_prenex_176 v_prenex_181)) (not (= |main_~#prio_queue~0.base| v_prenex_174)) (<= .cse3 v_prenex_179) (= (select v_prenex_180 v_prenex_188) 0) (let ((.cse5 (@diff v_prenex_196 v_prenex_180))) (= (select v_prenex_180 .cse5) (select v_prenex_196 .cse5))) (= (select v_prenex_175 v_prenex_187) 0) (<= .cse1 v_prenex_179) (= (select (store .cse2 v_prenex_172 v_prenex_193) |v_receive_~#packet~0.base_100|) 0) (let ((.cse6 (@diff v_prenex_189 v_prenex_190))) (= (select v_prenex_189 .cse6) (select v_prenex_190 .cse6))) (<= .cse3 |v_receive_~#packet~0.base_100|) (= (select .cse7 v_prenex_198) 0) (= (select (select |c_#memory_int| v_prenex_191) 0) .cse0) (<= .cse1 |v_receive_~#packet~0.base_100|) (= (select (store (store (store (store .cse7 v_prenex_198 v_prenex_173) v_prenex_197 v_prenex_177) v_prenex_198 v_prenex_178) v_prenex_176 v_prenex_192) v_prenex_194) 0) (<= .cse3 v_prenex_181) (= (select .cse8 v_prenex_191) 0))))))) (exists ((|main_~#prio_queue~0.base| Int)) (and (<= .cse1 |main_~#prio_queue~0.base|) (exists ((v_ArrVal_3308 Int) (|v_main_~#new_packet~0.base_18| Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_17| Int) (|v_#valid_162| (Array Int Int)) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_#valid_166| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3340 Int) (v_ArrVal_3341 Int) (|v_receive_~#packet~0.base_101| Int) (|v_receive_~#packet~0.base_102| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_#valid_160| (Array Int Int)) (|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3331 Int) (v_ArrVal_3332 Int) (|main_~#new_packet~0.base| Int) (|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (v_arrayElimCell_295 Int) (|v_append_to_queue_~#p.base_71| Int) (|v_receive_~#packet~0.base_99| Int)) (let ((.cse15 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (let ((.cse13 (store (store (store (store .cse15 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) c_process_prio_queue_~node~1.base v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344)) (.cse11 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (.cse10 (+ 2 v_arrayElimCell_295))) (and (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse9) (select |v_#valid_166| .cse9))) (<= .cse10 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (= (select .cse11 |v_append_to_queue_~#p.base_71|) 0) (<= .cse10 |v_append_to_queue_~#p.base_72|) (= (select |v_old(#valid)_AFTER_CALL_42| |main_~#prio_queue~0.base|) 1) (<= .cse1 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse12) (select |v_#valid_162| .cse12))) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (= (select (store .cse13 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_append_to_queue_~#p.base_72|) 0) (not (= |main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)) (<= .cse10 |main_~#prio_queue~0.base|) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (<= .cse1 |v_append_to_queue_~#p.base_72|) (= (select .cse13 |v_main_~#new_packet~0.base_18|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (= (select (store (store (store (store .cse11 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse14) (select |v_#valid_160| .cse14))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0) (<= .cse10 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (= (select .cse15 |v_append_to_queue_~#p.base_72|) 0) (<= .cse1 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|))))))))))) is different from true [2023-04-02 01:14:35,432 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:14:35,433 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 404 treesize of output 400 [2023-04-02 01:14:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2023-04-02 01:14:35,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:14:35,617 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3355 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3357 (Array Int Int)) (|v_receive_~#packet~0.base_108| Int)) (or (<= |v_receive_~#packet~0.base_108| |c_#StackHeapBarrier|) (< (mod (select (select (store |c_#memory_int| |v_receive_~#packet~0.base_108| v_ArrVal_3356) (select (select (store |c_#memory_$Pointer$.base| |v_receive_~#packet~0.base_108| v_ArrVal_3355) |c_main_~#prio_queue~0.base|) |c_main_~#prio_queue~0.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |v_receive_~#packet~0.base_108| v_ArrVal_3357) |c_main_~#prio_queue~0.base|) |c_main_~#prio_queue~0.offset|)) 4294967296) 500) (not (= (select |c_#valid| |v_receive_~#packet~0.base_108|) 0)))) is different from false [2023-04-02 01:14:35,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911235276] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:14:35,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:14:35,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 37 [2023-04-02 01:14:35,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103418086] [2023-04-02 01:14:35,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:14:35,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-04-02 01:14:35,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:14:35,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-04-02 01:14:35,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=577, Unknown=31, NotChecked=1008, Total=1722 [2023-04-02 01:14:35,620 INFO L87 Difference]: Start difference. First operand 145 states and 182 transitions. Second operand has 37 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 9 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 01:14:36,093 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse11 (store |c_old(#memory_$Pointer$.offset)| .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (.cse10 (store |c_old(#memory_$Pointer$.base)| .cse5 (select |c_#memory_$Pointer$.base| .cse5)))) (let ((.cse9 (@diff .cse10 |c_#memory_$Pointer$.base|)) (.cse12 (@diff .cse11 |c_#memory_$Pointer$.offset|))) (let ((.cse0 (store .cse11 .cse12 (select |c_#memory_$Pointer$.offset| .cse12))) (.cse6 (store .cse10 .cse9 (select |c_#memory_$Pointer$.base| .cse9)))) (let ((.cse7 (@diff .cse6 |c_#memory_$Pointer$.base|)) (.cse1 (@diff .cse0 |c_#memory_$Pointer$.offset|)) (.cse3 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (or (= |c_#memory_$Pointer$.offset| .cse0) (= (select |c_old(#valid)| .cse1) 0)) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (or (= |c_old(#memory_int)| |c_#memory_int|) (<= (+ |c_#StackHeapBarrier| 1) .cse3)) (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (= (select |c_#valid| .cse4) (select |c_old(#valid)| .cse4))) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= (select |c_old(#valid)| .cse5) 0)) (= |c_#memory_$Pointer$.base| (store .cse6 .cse7 (select |c_#memory_$Pointer$.base| .cse7))) (exists ((v_ArrVal_3308 Int) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (let ((.cse8 (@diff |c_old(#valid)| |v_#valid_160|))) (= (select |v_#valid_160| .cse8) (select |c_old(#valid)| .cse8))) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)))) (or (= |c_#memory_$Pointer$.base| .cse6) (= (select |c_old(#valid)| .cse7) 0)) (= |c_#memory_$Pointer$.offset| (store .cse0 .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (= (store |c_old(#memory_int)| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (or (= (select |c_old(#valid)| .cse9) 0) (= |c_#memory_$Pointer$.base| .cse10)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (or (= |c_#memory_$Pointer$.offset| .cse11) (= (select |c_old(#valid)| .cse12) 0)))))))) is different from false [2023-04-02 01:14:36,101 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse11 (store |c_old(#memory_$Pointer$.offset)| .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (.cse10 (store |c_old(#memory_$Pointer$.base)| .cse5 (select |c_#memory_$Pointer$.base| .cse5)))) (let ((.cse9 (@diff .cse10 |c_#memory_$Pointer$.base|)) (.cse12 (@diff .cse11 |c_#memory_$Pointer$.offset|))) (let ((.cse0 (store .cse11 .cse12 (select |c_#memory_$Pointer$.offset| .cse12))) (.cse6 (store .cse10 .cse9 (select |c_#memory_$Pointer$.base| .cse9)))) (let ((.cse7 (@diff .cse6 |c_#memory_$Pointer$.base|)) (.cse1 (@diff .cse0 |c_#memory_$Pointer$.offset|)) (.cse3 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (or (= |c_#memory_$Pointer$.offset| .cse0) (= (select |c_old(#valid)| .cse1) 0)) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (or (= |c_old(#memory_int)| |c_#memory_int|) (<= (+ |c_#StackHeapBarrier| 1) .cse3)) (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (= (select |c_#valid| .cse4) (select |c_old(#valid)| .cse4))) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= (select |c_old(#valid)| .cse5) 0)) (= |c_#memory_$Pointer$.base| (store .cse6 .cse7 (select |c_#memory_$Pointer$.base| .cse7))) (exists ((v_ArrVal_3308 Int) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (let ((.cse8 (@diff |c_old(#valid)| |v_#valid_160|))) (= (select |v_#valid_160| .cse8) (select |c_old(#valid)| .cse8))) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)))) (or (= |c_#memory_$Pointer$.base| .cse6) (= (select |c_old(#valid)| .cse7) 0)) (= |c_#memory_$Pointer$.offset| (store .cse0 .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (= (store |c_old(#memory_int)| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (or (= (select |c_old(#valid)| .cse9) 0) (= |c_#memory_$Pointer$.base| .cse10)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (or (= |c_#memory_$Pointer$.offset| .cse11) (= (select |c_old(#valid)| .cse12) 0)))))))) is different from true [2023-04-02 01:14:36,111 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse11 (store |c_old(#memory_$Pointer$.offset)| .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (.cse10 (store |c_old(#memory_$Pointer$.base)| .cse5 (select |c_#memory_$Pointer$.base| .cse5)))) (let ((.cse9 (@diff .cse10 |c_#memory_$Pointer$.base|)) (.cse12 (@diff .cse11 |c_#memory_$Pointer$.offset|))) (let ((.cse0 (store .cse11 .cse12 (select |c_#memory_$Pointer$.offset| .cse12))) (.cse6 (store .cse10 .cse9 (select |c_#memory_$Pointer$.base| .cse9)))) (let ((.cse7 (@diff .cse6 |c_#memory_$Pointer$.base|)) (.cse1 (@diff .cse0 |c_#memory_$Pointer$.offset|)) (.cse3 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (or (= |c_#memory_$Pointer$.offset| .cse0) (= (select |c_old(#valid)| .cse1) 0)) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (or (= |c_old(#memory_int)| |c_#memory_int|) (<= (+ |c_#StackHeapBarrier| 1) .cse3)) (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (= (select |c_#valid| .cse4) (select |c_old(#valid)| .cse4))) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= (select |c_old(#valid)| .cse5) 0)) (= |c_#memory_$Pointer$.base| (store .cse6 .cse7 (select |c_#memory_$Pointer$.base| .cse7))) (exists ((v_ArrVal_3308 Int) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (let ((.cse8 (@diff |c_old(#valid)| |v_#valid_160|))) (= (select |v_#valid_160| .cse8) (select |c_old(#valid)| .cse8))) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)))) (or (= |c_#memory_$Pointer$.base| .cse6) (= (select |c_old(#valid)| .cse7) 0)) (= |c_#memory_$Pointer$.offset| (store .cse0 .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (= (store |c_old(#memory_int)| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (or (= (select |c_old(#valid)| .cse9) 0) (= |c_#memory_$Pointer$.base| .cse10)) (or (= |c_#memory_$Pointer$.offset| .cse11) (= (select |c_old(#valid)| .cse12) 0)))))))) is different from false [2023-04-02 01:14:36,121 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse11 (store |c_old(#memory_$Pointer$.offset)| .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (.cse10 (store |c_old(#memory_$Pointer$.base)| .cse5 (select |c_#memory_$Pointer$.base| .cse5)))) (let ((.cse9 (@diff .cse10 |c_#memory_$Pointer$.base|)) (.cse12 (@diff .cse11 |c_#memory_$Pointer$.offset|))) (let ((.cse0 (store .cse11 .cse12 (select |c_#memory_$Pointer$.offset| .cse12))) (.cse6 (store .cse10 .cse9 (select |c_#memory_$Pointer$.base| .cse9)))) (let ((.cse7 (@diff .cse6 |c_#memory_$Pointer$.base|)) (.cse1 (@diff .cse0 |c_#memory_$Pointer$.offset|)) (.cse3 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (or (= |c_#memory_$Pointer$.offset| .cse0) (= (select |c_old(#valid)| .cse1) 0)) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (or (= |c_old(#memory_int)| |c_#memory_int|) (<= (+ |c_#StackHeapBarrier| 1) .cse3)) (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (= (select |c_#valid| .cse4) (select |c_old(#valid)| .cse4))) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= (select |c_old(#valid)| .cse5) 0)) (= |c_#memory_$Pointer$.base| (store .cse6 .cse7 (select |c_#memory_$Pointer$.base| .cse7))) (exists ((v_ArrVal_3308 Int) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (let ((.cse8 (@diff |c_old(#valid)| |v_#valid_160|))) (= (select |v_#valid_160| .cse8) (select |c_old(#valid)| .cse8))) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)))) (or (= |c_#memory_$Pointer$.base| .cse6) (= (select |c_old(#valid)| .cse7) 0)) (= |c_#memory_$Pointer$.offset| (store .cse0 .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (= (store |c_old(#memory_int)| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (or (= (select |c_old(#valid)| .cse9) 0) (= |c_#memory_$Pointer$.base| .cse10)) (or (= |c_#memory_$Pointer$.offset| .cse11) (= (select |c_old(#valid)| .cse12) 0)))))))) is different from true [2023-04-02 01:14:36,125 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 1) (exists ((v_ArrVal_3308 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse0) (select |v_#valid_160| .cse0))))) (<= (+ |c_#StackHeapBarrier| 1) |c_main_~#prio_queue~0.base|) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|)) is different from false [2023-04-02 01:14:36,127 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 1) (exists ((v_ArrVal_3308 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse0) (select |v_#valid_160| .cse0))))) (<= (+ |c_#StackHeapBarrier| 1) |c_main_~#prio_queue~0.base|) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|)) is different from true [2023-04-02 01:14:36,130 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (= (select (select |c_#memory_int| |c_main_~#new_packet~0.base|) |c_main_~#new_packet~0.offset|) |c_main_#t~mem33|) (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 1) (exists ((v_ArrVal_3308 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse0) (select |v_#valid_160| .cse0))))) (<= (+ |c_#StackHeapBarrier| 1) |c_main_~#prio_queue~0.base|) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|)) is different from false [2023-04-02 01:14:36,131 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (= (select (select |c_#memory_int| |c_main_~#new_packet~0.base|) |c_main_~#new_packet~0.offset|) |c_main_#t~mem33|) (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 1) (exists ((v_ArrVal_3308 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse0) (select |v_#valid_160| .cse0))))) (<= (+ |c_#StackHeapBarrier| 1) |c_main_~#prio_queue~0.base|) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|)) is different from true [2023-04-02 01:14:36,135 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 1) (exists ((v_ArrVal_3308 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse0) (select |v_#valid_160| .cse0))))) (<= (+ |c_#StackHeapBarrier| 1) |c_main_~#prio_queue~0.base|) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|) (let ((.cse1 (select (select |c_#memory_int| |c_main_~#new_packet~0.base|) |c_main_~#new_packet~0.offset|))) (<= (div .cse1 4294967296) (div (+ (- 1) .cse1) 4294967296)))) is different from false [2023-04-02 01:14:36,137 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 1) (exists ((v_ArrVal_3308 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse0) (select |v_#valid_160| .cse0))))) (<= (+ |c_#StackHeapBarrier| 1) |c_main_~#prio_queue~0.base|) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|) (let ((.cse1 (select (select |c_#memory_int| |c_main_~#new_packet~0.base|) |c_main_~#new_packet~0.offset|))) (<= (div .cse1 4294967296) (div (+ (- 1) .cse1) 4294967296)))) is different from true [2023-04-02 01:14:36,148 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_main_~#new_packet~0.base|) |c_main_~#new_packet~0.offset|))) (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (= .cse0 |c_main_#t~mem38|) (<= (+ .cse0 (* (div |c_main_#t~mem38| 4294967296) 4294967296)) (+ (* (div (+ (- 1) .cse0) 4294967296) 4294967296) |c_main_#t~mem38|)) (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 1) (exists ((v_ArrVal_3308 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse1) (select |v_#valid_160| .cse1))))) (<= (+ |c_#StackHeapBarrier| 1) |c_main_~#prio_queue~0.base|) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|))) is different from false [2023-04-02 01:14:36,150 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_main_~#new_packet~0.base|) |c_main_~#new_packet~0.offset|))) (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (= .cse0 |c_main_#t~mem38|) (<= (+ .cse0 (* (div |c_main_#t~mem38| 4294967296) 4294967296)) (+ (* (div (+ (- 1) .cse0) 4294967296) 4294967296) |c_main_#t~mem38|)) (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 1) (exists ((v_ArrVal_3308 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse1) (select |v_#valid_160| .cse1))))) (<= (+ |c_#StackHeapBarrier| 1) |c_main_~#prio_queue~0.base|) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|))) is different from true [2023-04-02 01:14:36,167 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (<= |c_main_#t~mem39| (+ 499 (* (div (+ (- 1) |c_main_#t~mem39|) 4294967296) 4294967296))) (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 1) (exists ((v_ArrVal_3308 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse0) (select |v_#valid_160| .cse0))))) (<= (+ |c_#StackHeapBarrier| 1) |c_main_~#prio_queue~0.base|) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|) (< (mod |c_main_#t~mem39| 4294967296) 500)) is different from false [2023-04-02 01:14:36,169 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (<= |c_main_#t~mem39| (+ 499 (* (div (+ (- 1) |c_main_#t~mem39|) 4294967296) 4294967296))) (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 1) (exists ((v_ArrVal_3308 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= |c_#valid| (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse0) (select |v_#valid_160| .cse0))))) (<= (+ |c_#StackHeapBarrier| 1) |c_main_~#prio_queue~0.base|) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|) (< (mod |c_main_#t~mem39| 4294967296) 500)) is different from true [2023-04-02 01:14:36,753 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse0) (select |v_#valid_160| .cse0)))))) is different from false [2023-04-02 01:14:36,755 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse0) (select |v_#valid_160| .cse0)))))) is different from true [2023-04-02 01:14:36,794 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|))) (let ((.cse2 (= (select |c_old(#valid)| |c_append_to_queue_#in~q.base|) 0)) (.cse3 (select |c_#memory_int| .cse5)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|))) (and (let ((.cse0 (= .cse5 |c_append_to_queue_#in~q.base|)) (.cse1 (= .cse6 0))) (or (and .cse0 (< |c_append_to_queue_#in~q.base| |c_#StackHeapBarrier|) .cse1 (or (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_append_to_queue_~#p.base_71| Int)) (and (= |c_append_to_queue_#in~p.size| (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0)) (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_71|) 0) (= |c_#valid| (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_71| v_ArrVal_3309) |c_append_to_queue_#in~q.base| v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327)))) (and .cse2 (exists ((v_ArrVal_3327 Int)) (= |c_#valid| (store |c_old(#valid)| |c_append_to_queue_#in~q.base| v_ArrVal_3327)))))) (and (let ((.cse4 (or (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_append_to_queue_~#p.base_71| Int)) (and (= |c_#valid| (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_71| v_ArrVal_3309) .cse5 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327)) (= |c_append_to_queue_#in~p.size| (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0)) (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_71|) 0))) (and .cse2 (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int)) (= |c_#valid| (store (store (store |c_old(#valid)| |c_append_to_queue_#in~q.base| v_ArrVal_3309) .cse5 v_ArrVal_3326) |c_append_to_queue_#in~q.base| v_ArrVal_3327))))))) (or (and (= (select .cse3 0) |c_append_to_queue_#in~p.size|) .cse4) (and .cse0 .cse4))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_29) |c_append_to_queue_#in~q.base| v_DerPreprocessor_30) .cse5 v_DerPreprocessor_29) |c_append_to_queue_#in~q.base| v_DerPreprocessor_30) .cse5) (select |c_#memory_$Pointer$.base| .cse5)) (= .cse5 (select v_DerPreprocessor_30 |c_append_to_queue_#in~q.offset|)))) (< .cse5 |c_#StackHeapBarrier|) (or (and .cse1 (not .cse0)) (and (exists ((v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int))) (and (= v_DerPreprocessor_27 (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_DerPreprocessor_27) |c_append_to_queue_#in~q.base| v_DerPreprocessor_28) .cse5 v_DerPreprocessor_27) |c_append_to_queue_#in~q.base| v_DerPreprocessor_28) .cse5)) (= (select v_DerPreprocessor_28 |c_append_to_queue_#in~q.offset|) 0))) .cse1))))) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse7) (select |v_#valid_160| .cse7))))) (or .cse2 (let ((.cse10 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse12 (store |c_old(#valid)| .cse10 (select |c_#valid| .cse10)))) (let ((.cse11 (@diff .cse12 |c_#valid|))) (let ((.cse9 (store .cse12 .cse11 (select |c_#valid| .cse11)))) (let ((.cse8 (@diff .cse9 |c_#valid|))) (and (or (= (select |c_old(#valid)| .cse8) 0) (= |c_#valid| .cse9)) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse10) 0)) (= |c_#valid| (store .cse9 .cse8 (select |c_#valid| .cse8))) (<= (+ .cse5 1) |c_#StackHeapBarrier|) (or (= (select |c_old(#valid)| .cse11) 0) (= |c_#valid| .cse12)) (= (select .cse3 .cse6) |c_append_to_queue_#in~p.size|))))))))))) is different from false [2023-04-02 01:14:36,801 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|))) (let ((.cse2 (= (select |c_old(#valid)| |c_append_to_queue_#in~q.base|) 0)) (.cse3 (select |c_#memory_int| .cse5)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|))) (and (let ((.cse0 (= .cse5 |c_append_to_queue_#in~q.base|)) (.cse1 (= .cse6 0))) (or (and .cse0 (< |c_append_to_queue_#in~q.base| |c_#StackHeapBarrier|) .cse1 (or (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_append_to_queue_~#p.base_71| Int)) (and (= |c_append_to_queue_#in~p.size| (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0)) (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_71|) 0) (= |c_#valid| (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_71| v_ArrVal_3309) |c_append_to_queue_#in~q.base| v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327)))) (and .cse2 (exists ((v_ArrVal_3327 Int)) (= |c_#valid| (store |c_old(#valid)| |c_append_to_queue_#in~q.base| v_ArrVal_3327)))))) (and (let ((.cse4 (or (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_append_to_queue_~#p.base_71| Int)) (and (= |c_#valid| (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_71| v_ArrVal_3309) .cse5 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327)) (= |c_append_to_queue_#in~p.size| (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0)) (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_71|) 0))) (and .cse2 (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int)) (= |c_#valid| (store (store (store |c_old(#valid)| |c_append_to_queue_#in~q.base| v_ArrVal_3309) .cse5 v_ArrVal_3326) |c_append_to_queue_#in~q.base| v_ArrVal_3327))))))) (or (and (= (select .cse3 0) |c_append_to_queue_#in~p.size|) .cse4) (and .cse0 .cse4))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_29) |c_append_to_queue_#in~q.base| v_DerPreprocessor_30) .cse5 v_DerPreprocessor_29) |c_append_to_queue_#in~q.base| v_DerPreprocessor_30) .cse5) (select |c_#memory_$Pointer$.base| .cse5)) (= .cse5 (select v_DerPreprocessor_30 |c_append_to_queue_#in~q.offset|)))) (< .cse5 |c_#StackHeapBarrier|) (or (and .cse1 (not .cse0)) (and (exists ((v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int))) (and (= v_DerPreprocessor_27 (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_DerPreprocessor_27) |c_append_to_queue_#in~q.base| v_DerPreprocessor_28) .cse5 v_DerPreprocessor_27) |c_append_to_queue_#in~q.base| v_DerPreprocessor_28) .cse5)) (= (select v_DerPreprocessor_28 |c_append_to_queue_#in~q.offset|) 0))) .cse1))))) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse7) (select |v_#valid_160| .cse7))))) (or .cse2 (let ((.cse10 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse12 (store |c_old(#valid)| .cse10 (select |c_#valid| .cse10)))) (let ((.cse11 (@diff .cse12 |c_#valid|))) (let ((.cse9 (store .cse12 .cse11 (select |c_#valid| .cse11)))) (let ((.cse8 (@diff .cse9 |c_#valid|))) (and (or (= (select |c_old(#valid)| .cse8) 0) (= |c_#valid| .cse9)) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse10) 0)) (= |c_#valid| (store .cse9 .cse8 (select |c_#valid| .cse8))) (<= (+ .cse5 1) |c_#StackHeapBarrier|) (or (= (select |c_old(#valid)| .cse11) 0) (= |c_#valid| .cse12)) (= (select .cse3 .cse6) |c_append_to_queue_#in~p.size|))))))))))) is different from true [2023-04-02 01:14:36,838 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (let ((.cse2 (select .cse8 0))) (let ((.cse0 (select .cse8 |c_main_~#prio_queue~0.offset|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_main_~#prio_queue~0.base|)) (.cse6 (select (select |c_#memory_int| .cse2) 0))) (and (= |c_main_~#prio_queue~0.offset| 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse1) (select |v_#valid_162| .cse1))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse2 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (= .cse2 (select v_DerPreprocessor_30 0)))) (= 0 (select .cse3 0)) (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 1) (let ((.cse4 (select (select |c_#memory_int| .cse0) (select .cse3 |c_main_~#prio_queue~0.offset|)))) (<= .cse4 (+ 499 (* (div (+ (- 1) .cse4) 4294967296) 4294967296)))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|) (exists ((v_ArrVal_3308 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_append_to_queue_~#p.base_71| Int)) (let ((.cse5 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse5 |v_append_to_queue_~#p.base_71|) 0) (= |c_#valid| (store (store (store .cse5 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) .cse2 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327)) (= .cse6 (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0))))) (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse7) (select |v_#valid_160| .cse7))))) (< .cse2 |c_#StackHeapBarrier|) (< (mod .cse6 4294967296) 500))))) is different from false [2023-04-02 01:14:36,850 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (let ((.cse2 (select .cse8 0))) (let ((.cse0 (select .cse8 |c_main_~#prio_queue~0.offset|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_main_~#prio_queue~0.base|)) (.cse6 (select (select |c_#memory_int| .cse2) 0))) (and (= |c_main_~#prio_queue~0.offset| 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse1) (select |v_#valid_162| .cse1))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse2 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (= .cse2 (select v_DerPreprocessor_30 0)))) (= 0 (select .cse3 0)) (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 1) (let ((.cse4 (select (select |c_#memory_int| .cse0) (select .cse3 |c_main_~#prio_queue~0.offset|)))) (<= .cse4 (+ 499 (* (div (+ (- 1) .cse4) 4294967296) 4294967296)))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|) (exists ((v_ArrVal_3308 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (and (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_append_to_queue_~#p.base_71| Int)) (let ((.cse5 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse5 |v_append_to_queue_~#p.base_71|) 0) (= |c_#valid| (store (store (store .cse5 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) .cse2 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327)) (= .cse6 (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0))))) (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse7) (select |v_#valid_160| .cse7))))) (< .cse2 |c_#StackHeapBarrier|) (< (mod .cse6 4294967296) 500))))) is different from true [2023-04-02 01:14:36,871 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (let ((.cse2 (select .cse8 0))) (let ((.cse0 (select .cse8 |c_main_~#prio_queue~0.offset|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_main_~#prio_queue~0.base|)) (.cse7 (select (select |c_#memory_int| .cse2) 0))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_main_~#prio_queue~0.offset| 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse1) (select |v_#valid_162| .cse1))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse2 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (= .cse2 (select v_DerPreprocessor_30 0)))) (= 0 (select .cse3 0)) (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 1) (let ((.cse4 (select (select |c_#memory_int| .cse0) (select .cse3 |c_main_~#prio_queue~0.offset|)))) (<= .cse4 (+ 499 (* (div (+ (- 1) .cse4) 4294967296) 4294967296)))) (exists ((v_ArrVal_3308 Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_append_to_queue_~#p.base_71| Int) (v_ArrVal_3331 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (let ((.cse5 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse5 |v_append_to_queue_~#p.base_71|) 0) (= |c_#valid| (store (store (store (store .cse5 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) .cse2 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331)) (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse6) (select |v_#valid_160| .cse6))) (= .cse7 (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0)) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_16|))))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|) (< .cse2 |c_#StackHeapBarrier|) (< (mod .cse7 4294967296) 500) (= |c_#NULL.offset| |c_old(#NULL.offset)|))))) is different from false [2023-04-02 01:14:36,874 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (let ((.cse2 (select .cse8 0))) (let ((.cse0 (select .cse8 |c_main_~#prio_queue~0.offset|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_main_~#prio_queue~0.base|)) (.cse7 (select (select |c_#memory_int| .cse2) 0))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_main_~#prio_queue~0.offset| 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse1) (select |v_#valid_162| .cse1))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse2 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (= .cse2 (select v_DerPreprocessor_30 0)))) (= 0 (select .cse3 0)) (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 1) (let ((.cse4 (select (select |c_#memory_int| .cse0) (select .cse3 |c_main_~#prio_queue~0.offset|)))) (<= .cse4 (+ 499 (* (div (+ (- 1) .cse4) 4294967296) 4294967296)))) (exists ((v_ArrVal_3308 Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_append_to_queue_~#p.base_71| Int) (v_ArrVal_3331 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (let ((.cse5 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse5 |v_append_to_queue_~#p.base_71|) 0) (= |c_#valid| (store (store (store (store .cse5 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) .cse2 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331)) (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse6) (select |v_#valid_160| .cse6))) (= .cse7 (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0)) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_16|))))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|) (< .cse2 |c_#StackHeapBarrier|) (< (mod .cse7 4294967296) 500) (= |c_#NULL.offset| |c_old(#NULL.offset)|))))) is different from true [2023-04-02 01:14:36,895 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (let ((.cse2 (select .cse8 0))) (let ((.cse0 (select .cse8 |c_main_~#prio_queue~0.offset|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_main_~#prio_queue~0.base|)) (.cse7 (select (select |c_#memory_int| .cse2) 0))) (and (= |c_main_~#prio_queue~0.offset| 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse1) (select |v_#valid_162| .cse1))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse2 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (= .cse2 (select v_DerPreprocessor_30 0)))) (= 0 (select .cse3 0)) (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 1) (let ((.cse4 (select (select |c_#memory_int| .cse0) (select .cse3 |c_main_~#prio_queue~0.offset|)))) (<= .cse4 (+ 499 (* (div (+ (- 1) .cse4) 4294967296) 4294967296)))) (exists ((v_ArrVal_3308 Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_append_to_queue_~#p.base_71| Int) (v_ArrVal_3331 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (let ((.cse5 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse5 |v_append_to_queue_~#p.base_71|) 0) (= |c_#valid| (store (store (store (store .cse5 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) .cse2 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331)) (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse6) (select |v_#valid_160| .cse6))) (= .cse7 (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0)) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_16|))))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|) (< .cse2 |c_#StackHeapBarrier|) (< (mod .cse7 4294967296) 500))))) is different from false [2023-04-02 01:14:36,898 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (let ((.cse2 (select .cse8 0))) (let ((.cse0 (select .cse8 |c_main_~#prio_queue~0.offset|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_main_~#prio_queue~0.base|)) (.cse7 (select (select |c_#memory_int| .cse2) 0))) (and (= |c_main_~#prio_queue~0.offset| 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse1) (select |v_#valid_162| .cse1))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse2 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (= .cse2 (select v_DerPreprocessor_30 0)))) (= 0 (select .cse3 0)) (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 1) (let ((.cse4 (select (select |c_#memory_int| .cse0) (select .cse3 |c_main_~#prio_queue~0.offset|)))) (<= .cse4 (+ 499 (* (div (+ (- 1) .cse4) 4294967296) 4294967296)))) (exists ((v_ArrVal_3308 Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_append_to_queue_~#p.base_71| Int) (v_ArrVal_3331 Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (let ((.cse5 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse5 |v_append_to_queue_~#p.base_71|) 0) (= |c_#valid| (store (store (store (store .cse5 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) .cse2 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331)) (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse6) (select |v_#valid_160| .cse6))) (= .cse7 (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0)) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_16|))))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|) (< .cse2 |c_#StackHeapBarrier|) (< (mod .cse7 4294967296) 500))))) is different from true [2023-04-02 01:14:36,918 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (let ((.cse2 (select .cse9 0))) (let ((.cse0 (select .cse9 |c_main_~#prio_queue~0.offset|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_main_~#prio_queue~0.base|)) (.cse7 (select (select |c_#memory_int| .cse2) 0))) (and (= |c_main_~#prio_queue~0.offset| 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse1) (select |v_#valid_162| .cse1))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse2 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (= .cse2 (select v_DerPreprocessor_30 0)))) (= 0 (select .cse3 0)) (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 1) (exists ((v_ArrVal_3308 Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (v_ArrVal_3331 Int) (v_ArrVal_3332 Int) (|main_~#new_packet~0.base| Int) (|v_append_to_queue_~#p.base_71| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (let ((.cse4 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (let ((.cse5 (store (store (store (store .cse4 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) .cse2 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331))) (and (= (select .cse4 |v_append_to_queue_~#p.base_71|) 0) (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= |c_#valid| (store .cse5 |main_~#new_packet~0.base| v_ArrVal_3332)) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse6) (select |v_#valid_160| .cse6))) (= .cse7 (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0)) (= (select .cse5 |main_~#new_packet~0.base|) 0) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_16|)))))) (let ((.cse8 (select (select |c_#memory_int| .cse0) (select .cse3 |c_main_~#prio_queue~0.offset|)))) (<= .cse8 (+ 499 (* (div (+ (- 1) .cse8) 4294967296) 4294967296)))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|) (< .cse2 |c_#StackHeapBarrier|) (< (mod .cse7 4294967296) 500))))) is different from false [2023-04-02 01:14:36,922 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (let ((.cse2 (select .cse9 0))) (let ((.cse0 (select .cse9 |c_main_~#prio_queue~0.offset|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_main_~#prio_queue~0.base|)) (.cse7 (select (select |c_#memory_int| .cse2) 0))) (and (= |c_main_~#prio_queue~0.offset| 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse1) (select |v_#valid_162| .cse1))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse2 v_DerPreprocessor_29) |c_main_~#prio_queue~0.base| v_DerPreprocessor_30) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (= .cse2 (select v_DerPreprocessor_30 0)))) (= 0 (select .cse3 0)) (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 1) (exists ((v_ArrVal_3308 Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (v_ArrVal_3331 Int) (v_ArrVal_3332 Int) (|main_~#new_packet~0.base| Int) (|v_append_to_queue_~#p.base_71| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (let ((.cse4 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (let ((.cse5 (store (store (store (store .cse4 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) .cse2 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331))) (and (= (select .cse4 |v_append_to_queue_~#p.base_71|) 0) (= (select |v_old(#valid)_AFTER_CALL_38| |c_main_~#prio_queue~0.base|) 1) (= |c_#valid| (store .cse5 |main_~#new_packet~0.base| v_ArrVal_3332)) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse6) (select |v_#valid_160| .cse6))) (= .cse7 (select (select |c_#memory_int| |v_append_to_queue_~#p.base_71|) 0)) (= (select .cse5 |main_~#new_packet~0.base|) 0) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_16|)))))) (let ((.cse8 (select (select |c_#memory_int| .cse0) (select .cse3 |c_main_~#prio_queue~0.offset|)))) (<= .cse8 (+ 499 (* (div (+ (- 1) .cse8) 4294967296) 4294967296)))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|) (< .cse2 |c_#StackHeapBarrier|) (< (mod .cse7 4294967296) 500))))) is different from true [2023-04-02 01:14:36,938 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse0) (select |v_#valid_162| .cse0))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (= |c_#valid| |c_old(#valid)|) (exists ((v_ArrVal_3308 Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int) (v_ArrVal_3331 Int) (|main_~#new_packet~0.base| Int) (v_arrayElimCell_295 Int) (|v_append_to_queue_~#p.base_71| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (let ((.cse1 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (= (select .cse1 |v_append_to_queue_~#p.base_71|) 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= (select (store (store (store (store .cse1 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse2) (select |v_#valid_160| .cse2))) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (< v_arrayElimCell_295 |c_#StackHeapBarrier|)))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|)) is different from false [2023-04-02 01:14:36,941 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse0) (select |v_#valid_162| .cse0))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (= |c_#valid| |c_old(#valid)|) (exists ((v_ArrVal_3308 Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int) (v_ArrVal_3331 Int) (|main_~#new_packet~0.base| Int) (v_arrayElimCell_295 Int) (|v_append_to_queue_~#p.base_71| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (let ((.cse1 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (= (select .cse1 |v_append_to_queue_~#p.base_71|) 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= (select (store (store (store (store .cse1 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse2) (select |v_#valid_160| .cse2))) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (< v_arrayElimCell_295 |c_#StackHeapBarrier|)))) (= |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-02 01:14:36,972 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse13 (store |c_old(#memory_$Pointer$.offset)| .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (.cse12 (store |c_old(#memory_$Pointer$.base)| .cse6 (select |c_#memory_$Pointer$.base| .cse6)))) (let ((.cse11 (@diff .cse12 |c_#memory_$Pointer$.base|)) (.cse14 (@diff .cse13 |c_#memory_$Pointer$.offset|))) (let ((.cse0 (store .cse13 .cse14 (select |c_#memory_$Pointer$.offset| .cse14))) (.cse7 (store .cse12 .cse11 (select |c_#memory_$Pointer$.base| .cse11)))) (let ((.cse8 (@diff .cse7 |c_#memory_$Pointer$.base|)) (.cse1 (@diff .cse0 |c_#memory_$Pointer$.offset|)) (.cse3 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (or (= |c_#memory_$Pointer$.offset| .cse0) (= (select |c_old(#valid)| .cse1) 0)) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (or (= |c_old(#memory_int)| |c_#memory_int|) (<= (+ |c_#StackHeapBarrier| 1) .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse4) (select |v_#valid_162| .cse4))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (= (select |c_#valid| .cse5) (select |c_old(#valid)| .cse5))) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= (select |c_old(#valid)| .cse6) 0)) (= |c_#memory_$Pointer$.base| (store .cse7 .cse8 (select |c_#memory_$Pointer$.base| .cse8))) (exists ((v_ArrVal_3308 Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int) (v_ArrVal_3331 Int) (|main_~#new_packet~0.base| Int) (v_arrayElimCell_295 Int) (|v_append_to_queue_~#p.base_71| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (let ((.cse9 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (= (select .cse9 |v_append_to_queue_~#p.base_71|) 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= (select (store (store (store (store .cse9 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse10) (select |v_#valid_160| .cse10))) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (< v_arrayElimCell_295 |c_#StackHeapBarrier|)))) (or (= |c_#memory_$Pointer$.base| .cse7) (= (select |c_old(#valid)| .cse8) 0)) (= |c_#memory_$Pointer$.offset| (store .cse0 .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (= (store |c_old(#memory_int)| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (or (= (select |c_old(#valid)| .cse11) 0) (= |c_#memory_$Pointer$.base| .cse12)) (exists ((|v_receive_~#packet~0.base_100| Int) (v_ArrVal_3333 (Array Int Int)) (v_ArrVal_3336 (Array Int Int)) (v_ArrVal_3339 (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_receive_~#packet~0.base_100|) (= (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_100| v_ArrVal_3339) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_100| v_ArrVal_3336)) (= (select |c_old(#valid)| |v_receive_~#packet~0.base_100|) 0) (= |c_#memory_int| (store |c_old(#memory_int)| |v_receive_~#packet~0.base_100| v_ArrVal_3333)))) (or (= |c_#memory_$Pointer$.offset| .cse13) (= (select |c_old(#valid)| .cse14) 0)))))))) is different from false [2023-04-02 01:14:36,984 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse6 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse13 (store |c_old(#memory_$Pointer$.offset)| .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (.cse12 (store |c_old(#memory_$Pointer$.base)| .cse6 (select |c_#memory_$Pointer$.base| .cse6)))) (let ((.cse11 (@diff .cse12 |c_#memory_$Pointer$.base|)) (.cse14 (@diff .cse13 |c_#memory_$Pointer$.offset|))) (let ((.cse0 (store .cse13 .cse14 (select |c_#memory_$Pointer$.offset| .cse14))) (.cse7 (store .cse12 .cse11 (select |c_#memory_$Pointer$.base| .cse11)))) (let ((.cse8 (@diff .cse7 |c_#memory_$Pointer$.base|)) (.cse1 (@diff .cse0 |c_#memory_$Pointer$.offset|)) (.cse3 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (or (= |c_#memory_$Pointer$.offset| .cse0) (= (select |c_old(#valid)| .cse1) 0)) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (or (= |c_old(#memory_int)| |c_#memory_int|) (<= (+ |c_#StackHeapBarrier| 1) .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_162| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_receive_~#packet~0.base_101| Int)) (and (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse4) (select |v_#valid_162| .cse4))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (= (select |c_#valid| .cse5) (select |c_old(#valid)| .cse5))) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= (select |c_old(#valid)| .cse6) 0)) (= |c_#memory_$Pointer$.base| (store .cse7 .cse8 (select |c_#memory_$Pointer$.base| .cse8))) (exists ((v_ArrVal_3308 Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int) (v_ArrVal_3331 Int) (|main_~#new_packet~0.base| Int) (v_arrayElimCell_295 Int) (|v_append_to_queue_~#p.base_71| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_receive_~#packet~0.base_99| Int) (|v_#valid_160| (Array Int Int))) (let ((.cse9 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (= (select .cse9 |v_append_to_queue_~#p.base_71|) 0) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= (select (store (store (store (store .cse9 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse10) (select |v_#valid_160| .cse10))) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (< v_arrayElimCell_295 |c_#StackHeapBarrier|)))) (or (= |c_#memory_$Pointer$.base| .cse7) (= (select |c_old(#valid)| .cse8) 0)) (= |c_#memory_$Pointer$.offset| (store .cse0 .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (= (store |c_old(#memory_int)| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (or (= (select |c_old(#valid)| .cse11) 0) (= |c_#memory_$Pointer$.base| .cse12)) (exists ((|v_receive_~#packet~0.base_100| Int) (v_ArrVal_3333 (Array Int Int)) (v_ArrVal_3336 (Array Int Int)) (v_ArrVal_3339 (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_receive_~#packet~0.base_100|) (= (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_100| v_ArrVal_3339) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_100| v_ArrVal_3336)) (= (select |c_old(#valid)| |v_receive_~#packet~0.base_100|) 0) (= |c_#memory_int| (store |c_old(#memory_int)| |v_receive_~#packet~0.base_100| v_ArrVal_3333)))) (or (= |c_#memory_$Pointer$.offset| .cse13) (= (select |c_old(#valid)| .cse14) 0)))))))) is different from true [2023-04-02 01:14:37,059 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (let ((.cse10 (select .cse2 0))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_main_~#prio_queue~0.base|)) (.cse3 (+ .cse10 2)) (.cse16 (select (select |c_#memory_int| .cse10) 0))) (and (= |c_main_~#prio_queue~0.offset| 0) (= 0 (select .cse0 0)) (let ((.cse1 (select (select |c_#memory_int| (select .cse2 |c_main_~#prio_queue~0.offset|)) (select .cse0 |c_main_~#prio_queue~0.offset|)))) (<= .cse1 (+ 499 (* (div (+ (- 1) .cse1) 4294967296) 4294967296)))) (or (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int)) (and (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (exists ((|v_#valid_162| (Array Int Int)) (|v_receive_~#packet~0.base_101| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int)) (and (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (exists ((|v_main_~#new_packet~0.base_16| Int)) (and (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (exists ((|v_old(#valid)_AFTER_CALL_38| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (exists ((|v_#valid_160| (Array Int Int))) (and (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse4) (select |v_#valid_160| .cse4))) (exists ((|v_receive_~#packet~0.base_99| Int)) (and (exists ((v_ArrVal_3308 Int) (|v_append_to_queue_~#p.base_71| Int)) (let ((.cse5 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse5 |v_append_to_queue_~#p.base_71|) 0) (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_arrayElimCell_295 Int) (v_ArrVal_3327 Int) (v_ArrVal_3331 Int) (|main_~#new_packet~0.base| Int)) (let ((.cse6 (+ 2 v_arrayElimCell_295))) (and (<= .cse6 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (<= .cse6 |c_main_~#prio_queue~0.base|) (= (select (store (store (store (store .cse5 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (exists ((|v_main_~#new_packet~0.base_17| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_main_~#prio_queue~0.base|) 1) (exists ((|v_#valid_166| (Array Int Int))) (and (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse7) (select |v_#valid_166| .cse7))) (exists ((|v_receive_~#packet~0.base_102| Int)) (and (exists ((|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3340 Int)) (let ((.cse9 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (and (<= .cse6 |v_append_to_queue_~#p.base_72|) (<= .cse3 |v_append_to_queue_~#p.base_72|) (exists ((|v_main_~#new_packet~0.base_18| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3332 Int) (v_ArrVal_3341 Int)) (let ((.cse8 (store (store (store (store .cse9 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) .cse10 v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344))) (and (= (select (store .cse8 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_append_to_queue_~#p.base_72|) 0) (= (select .cse8 |v_main_~#new_packet~0.base_18|) 0)))) (= (select .cse9 |v_append_to_queue_~#p.base_72|) 0)))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0))))))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)))) (<= .cse6 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|))))))) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0))))))))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse11) (select |v_#valid_162| .cse11))))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0))))) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int)) (and (exists ((|v_#valid_162| (Array Int Int)) (|v_receive_~#packet~0.base_101| Int)) (and (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse12) (select |v_#valid_162| .cse12))) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int)) (and (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (exists ((|v_main_~#new_packet~0.base_16| Int)) (and (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (exists ((|v_old(#valid)_AFTER_CALL_38| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (exists ((|v_#valid_160| (Array Int Int))) (and (exists ((|v_receive_~#packet~0.base_99| Int)) (and (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (exists ((v_ArrVal_3308 Int) (|v_append_to_queue_~#p.base_71| Int)) (let ((.cse13 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse13 |v_append_to_queue_~#p.base_71|) 0) (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_arrayElimCell_295 Int) (v_ArrVal_3327 Int) (v_ArrVal_3331 Int) (|main_~#new_packet~0.base| Int)) (let ((.cse14 (+ 2 v_arrayElimCell_295))) (and (<= .cse14 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (<= .cse14 |c_main_~#prio_queue~0.base|) (= (select (store (store (store (store .cse13 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (<= .cse14 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (exists ((|v_main_~#new_packet~0.base_17| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_main_~#prio_queue~0.base|) 1) (exists ((|v_#valid_166| (Array Int Int))) (and (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse15) (select |v_#valid_166| .cse15))) (exists ((|v_receive_~#packet~0.base_102| Int)) (and (exists ((|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3340 Int)) (let ((.cse17 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (and (= .cse16 (select (select |c_#memory_int| |v_append_to_queue_~#p.base_72|) 0)) (= (select .cse17 |v_append_to_queue_~#p.base_72|) 0) (exists ((|v_main_~#new_packet~0.base_18| Int) (|v_receive_~#packet~0.base_100| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3332 Int) (v_ArrVal_3341 Int)) (let ((.cse18 (store (store (store (store .cse17 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) .cse10 v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344))) (and (= (select (store .cse18 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_receive_~#packet~0.base_100|) 0) (= (select .cse18 |v_main_~#new_packet~0.base_18|) 0) (<= .cse3 |v_receive_~#packet~0.base_100|) (<= .cse14 |v_receive_~#packet~0.base_100|))))))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0))))))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)))))))))))) (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse19) (select |v_#valid_160| .cse19))))))))))))))) (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|)))) (<= .cse3 |c_main_~#prio_queue~0.base|) (< (mod .cse16 4294967296) 500))))) is different from false [2023-04-02 01:14:37,068 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (let ((.cse10 (select .cse2 0))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_main_~#prio_queue~0.base|)) (.cse3 (+ .cse10 2)) (.cse16 (select (select |c_#memory_int| .cse10) 0))) (and (= |c_main_~#prio_queue~0.offset| 0) (= 0 (select .cse0 0)) (let ((.cse1 (select (select |c_#memory_int| (select .cse2 |c_main_~#prio_queue~0.offset|)) (select .cse0 |c_main_~#prio_queue~0.offset|)))) (<= .cse1 (+ 499 (* (div (+ (- 1) .cse1) 4294967296) 4294967296)))) (or (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int)) (and (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (exists ((|v_#valid_162| (Array Int Int)) (|v_receive_~#packet~0.base_101| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int)) (and (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (exists ((|v_main_~#new_packet~0.base_16| Int)) (and (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (exists ((|v_old(#valid)_AFTER_CALL_38| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (exists ((|v_#valid_160| (Array Int Int))) (and (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse4) (select |v_#valid_160| .cse4))) (exists ((|v_receive_~#packet~0.base_99| Int)) (and (exists ((v_ArrVal_3308 Int) (|v_append_to_queue_~#p.base_71| Int)) (let ((.cse5 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse5 |v_append_to_queue_~#p.base_71|) 0) (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_arrayElimCell_295 Int) (v_ArrVal_3327 Int) (v_ArrVal_3331 Int) (|main_~#new_packet~0.base| Int)) (let ((.cse6 (+ 2 v_arrayElimCell_295))) (and (<= .cse6 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (<= .cse6 |c_main_~#prio_queue~0.base|) (= (select (store (store (store (store .cse5 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (exists ((|v_main_~#new_packet~0.base_17| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_main_~#prio_queue~0.base|) 1) (exists ((|v_#valid_166| (Array Int Int))) (and (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse7) (select |v_#valid_166| .cse7))) (exists ((|v_receive_~#packet~0.base_102| Int)) (and (exists ((|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3340 Int)) (let ((.cse9 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (and (<= .cse6 |v_append_to_queue_~#p.base_72|) (<= .cse3 |v_append_to_queue_~#p.base_72|) (exists ((|v_main_~#new_packet~0.base_18| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3332 Int) (v_ArrVal_3341 Int)) (let ((.cse8 (store (store (store (store .cse9 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) .cse10 v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344))) (and (= (select (store .cse8 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_append_to_queue_~#p.base_72|) 0) (= (select .cse8 |v_main_~#new_packet~0.base_18|) 0)))) (= (select .cse9 |v_append_to_queue_~#p.base_72|) 0)))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0))))))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)))) (<= .cse6 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|))))))) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0))))))))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse11) (select |v_#valid_162| .cse11))))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0))))) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int)) (and (exists ((|v_#valid_162| (Array Int Int)) (|v_receive_~#packet~0.base_101| Int)) (and (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse12) (select |v_#valid_162| .cse12))) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int)) (and (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (exists ((|v_main_~#new_packet~0.base_16| Int)) (and (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (exists ((|v_old(#valid)_AFTER_CALL_38| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (exists ((|v_#valid_160| (Array Int Int))) (and (exists ((|v_receive_~#packet~0.base_99| Int)) (and (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (exists ((v_ArrVal_3308 Int) (|v_append_to_queue_~#p.base_71| Int)) (let ((.cse13 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse13 |v_append_to_queue_~#p.base_71|) 0) (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_arrayElimCell_295 Int) (v_ArrVal_3327 Int) (v_ArrVal_3331 Int) (|main_~#new_packet~0.base| Int)) (let ((.cse14 (+ 2 v_arrayElimCell_295))) (and (<= .cse14 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (<= .cse14 |c_main_~#prio_queue~0.base|) (= (select (store (store (store (store .cse13 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (<= .cse14 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (exists ((|v_main_~#new_packet~0.base_17| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_main_~#prio_queue~0.base|) 1) (exists ((|v_#valid_166| (Array Int Int))) (and (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse15) (select |v_#valid_166| .cse15))) (exists ((|v_receive_~#packet~0.base_102| Int)) (and (exists ((|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3340 Int)) (let ((.cse17 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (and (= .cse16 (select (select |c_#memory_int| |v_append_to_queue_~#p.base_72|) 0)) (= (select .cse17 |v_append_to_queue_~#p.base_72|) 0) (exists ((|v_main_~#new_packet~0.base_18| Int) (|v_receive_~#packet~0.base_100| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3332 Int) (v_ArrVal_3341 Int)) (let ((.cse18 (store (store (store (store .cse17 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) .cse10 v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344))) (and (= (select (store .cse18 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_receive_~#packet~0.base_100|) 0) (= (select .cse18 |v_main_~#new_packet~0.base_18|) 0) (<= .cse3 |v_receive_~#packet~0.base_100|) (<= .cse14 |v_receive_~#packet~0.base_100|))))))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0))))))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)))))))))))) (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse19) (select |v_#valid_160| .cse19))))))))))))))) (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|)))) (<= .cse3 |c_main_~#prio_queue~0.base|) (< (mod .cse16 4294967296) 500))))) is different from true [2023-04-02 01:14:37,181 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (let ((.cse10 (select .cse2 0))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_main_~#prio_queue~0.base|)) (.cse3 (+ .cse10 2)) (.cse16 (select (select |c_#memory_int| .cse10) 0))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_main_~#prio_queue~0.offset| 0) (= 0 (select .cse0 0)) (let ((.cse1 (select (select |c_#memory_int| (select .cse2 |c_main_~#prio_queue~0.offset|)) (select .cse0 |c_main_~#prio_queue~0.offset|)))) (<= .cse1 (+ 499 (* (div (+ (- 1) .cse1) 4294967296) 4294967296)))) (or (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int)) (and (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (exists ((|v_#valid_162| (Array Int Int)) (|v_receive_~#packet~0.base_101| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int)) (and (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (exists ((|v_main_~#new_packet~0.base_16| Int)) (and (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (exists ((|v_old(#valid)_AFTER_CALL_38| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (exists ((|v_#valid_160| (Array Int Int))) (and (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse4) (select |v_#valid_160| .cse4))) (exists ((|v_receive_~#packet~0.base_99| Int)) (and (exists ((v_ArrVal_3308 Int) (|v_append_to_queue_~#p.base_71| Int)) (let ((.cse5 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse5 |v_append_to_queue_~#p.base_71|) 0) (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_arrayElimCell_295 Int) (v_ArrVal_3327 Int) (v_ArrVal_3331 Int) (|main_~#new_packet~0.base| Int)) (let ((.cse6 (+ 2 v_arrayElimCell_295))) (and (<= .cse6 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (<= .cse6 |c_main_~#prio_queue~0.base|) (= (select (store (store (store (store .cse5 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (exists ((|v_main_~#new_packet~0.base_17| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_main_~#prio_queue~0.base|) 1) (exists ((|v_#valid_166| (Array Int Int))) (and (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse7) (select |v_#valid_166| .cse7))) (exists ((|v_receive_~#packet~0.base_102| Int)) (and (exists ((|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3340 Int)) (let ((.cse9 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (and (<= .cse6 |v_append_to_queue_~#p.base_72|) (<= .cse3 |v_append_to_queue_~#p.base_72|) (exists ((|v_main_~#new_packet~0.base_18| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3332 Int) (v_ArrVal_3341 Int)) (let ((.cse8 (store (store (store (store .cse9 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) .cse10 v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344))) (and (= (select (store .cse8 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_append_to_queue_~#p.base_72|) 0) (= (select .cse8 |v_main_~#new_packet~0.base_18|) 0)))) (= (select .cse9 |v_append_to_queue_~#p.base_72|) 0)))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0))))))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)))) (<= .cse6 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|))))))) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0))))))))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse11) (select |v_#valid_162| .cse11))))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0))))) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int)) (and (exists ((|v_#valid_162| (Array Int Int)) (|v_receive_~#packet~0.base_101| Int)) (and (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse12) (select |v_#valid_162| .cse12))) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int)) (and (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (exists ((|v_main_~#new_packet~0.base_16| Int)) (and (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (exists ((|v_old(#valid)_AFTER_CALL_38| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (exists ((|v_#valid_160| (Array Int Int))) (and (exists ((|v_receive_~#packet~0.base_99| Int)) (and (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (exists ((v_ArrVal_3308 Int) (|v_append_to_queue_~#p.base_71| Int)) (let ((.cse13 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse13 |v_append_to_queue_~#p.base_71|) 0) (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_arrayElimCell_295 Int) (v_ArrVal_3327 Int) (v_ArrVal_3331 Int) (|main_~#new_packet~0.base| Int)) (let ((.cse14 (+ 2 v_arrayElimCell_295))) (and (<= .cse14 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (<= .cse14 |c_main_~#prio_queue~0.base|) (= (select (store (store (store (store .cse13 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (<= .cse14 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (exists ((|v_main_~#new_packet~0.base_17| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_main_~#prio_queue~0.base|) 1) (exists ((|v_#valid_166| (Array Int Int))) (and (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse15) (select |v_#valid_166| .cse15))) (exists ((|v_receive_~#packet~0.base_102| Int)) (and (exists ((|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3340 Int)) (let ((.cse17 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (and (= .cse16 (select (select |c_#memory_int| |v_append_to_queue_~#p.base_72|) 0)) (= (select .cse17 |v_append_to_queue_~#p.base_72|) 0) (exists ((|v_main_~#new_packet~0.base_18| Int) (|v_receive_~#packet~0.base_100| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3332 Int) (v_ArrVal_3341 Int)) (let ((.cse18 (store (store (store (store .cse17 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) .cse10 v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344))) (and (= (select (store .cse18 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_receive_~#packet~0.base_100|) 0) (= (select .cse18 |v_main_~#new_packet~0.base_18|) 0) (<= .cse3 |v_receive_~#packet~0.base_100|) (<= .cse14 |v_receive_~#packet~0.base_100|))))))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0))))))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)))))))))))) (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse19) (select |v_#valid_160| .cse19))))))))))))))) (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|)))) (<= .cse3 |c_main_~#prio_queue~0.base|) (< (mod .cse16 4294967296) 500) (= |c_#NULL.offset| |c_old(#NULL.offset)|))))) is different from false [2023-04-02 01:14:37,191 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (let ((.cse10 (select .cse2 0))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_main_~#prio_queue~0.base|)) (.cse3 (+ .cse10 2)) (.cse16 (select (select |c_#memory_int| .cse10) 0))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_main_~#prio_queue~0.offset| 0) (= 0 (select .cse0 0)) (let ((.cse1 (select (select |c_#memory_int| (select .cse2 |c_main_~#prio_queue~0.offset|)) (select .cse0 |c_main_~#prio_queue~0.offset|)))) (<= .cse1 (+ 499 (* (div (+ (- 1) .cse1) 4294967296) 4294967296)))) (or (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int)) (and (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (exists ((|v_#valid_162| (Array Int Int)) (|v_receive_~#packet~0.base_101| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int)) (and (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (exists ((|v_main_~#new_packet~0.base_16| Int)) (and (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (exists ((|v_old(#valid)_AFTER_CALL_38| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (exists ((|v_#valid_160| (Array Int Int))) (and (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse4) (select |v_#valid_160| .cse4))) (exists ((|v_receive_~#packet~0.base_99| Int)) (and (exists ((v_ArrVal_3308 Int) (|v_append_to_queue_~#p.base_71| Int)) (let ((.cse5 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse5 |v_append_to_queue_~#p.base_71|) 0) (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_arrayElimCell_295 Int) (v_ArrVal_3327 Int) (v_ArrVal_3331 Int) (|main_~#new_packet~0.base| Int)) (let ((.cse6 (+ 2 v_arrayElimCell_295))) (and (<= .cse6 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (<= .cse6 |c_main_~#prio_queue~0.base|) (= (select (store (store (store (store .cse5 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (exists ((|v_main_~#new_packet~0.base_17| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_main_~#prio_queue~0.base|) 1) (exists ((|v_#valid_166| (Array Int Int))) (and (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse7) (select |v_#valid_166| .cse7))) (exists ((|v_receive_~#packet~0.base_102| Int)) (and (exists ((|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3340 Int)) (let ((.cse9 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (and (<= .cse6 |v_append_to_queue_~#p.base_72|) (<= .cse3 |v_append_to_queue_~#p.base_72|) (exists ((|v_main_~#new_packet~0.base_18| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3332 Int) (v_ArrVal_3341 Int)) (let ((.cse8 (store (store (store (store .cse9 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) .cse10 v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344))) (and (= (select (store .cse8 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_append_to_queue_~#p.base_72|) 0) (= (select .cse8 |v_main_~#new_packet~0.base_18|) 0)))) (= (select .cse9 |v_append_to_queue_~#p.base_72|) 0)))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0))))))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)))) (<= .cse6 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|))))))) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0))))))))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1))) (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse11) (select |v_#valid_162| .cse11))))) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0))))) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int)) (and (exists ((|v_#valid_162| (Array Int Int)) (|v_receive_~#packet~0.base_101| Int)) (and (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse12) (select |v_#valid_162| .cse12))) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int)) (and (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (exists ((|v_main_~#new_packet~0.base_16| Int)) (and (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (exists ((|v_old(#valid)_AFTER_CALL_38| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (exists ((|v_#valid_160| (Array Int Int))) (and (exists ((|v_receive_~#packet~0.base_99| Int)) (and (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (exists ((v_ArrVal_3308 Int) (|v_append_to_queue_~#p.base_71| Int)) (let ((.cse13 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308))) (and (= (select .cse13 |v_append_to_queue_~#p.base_71|) 0) (exists ((v_ArrVal_3309 Int) (v_ArrVal_3326 Int) (v_arrayElimCell_295 Int) (v_ArrVal_3327 Int) (v_ArrVal_3331 Int) (|main_~#new_packet~0.base| Int)) (let ((.cse14 (+ 2 v_arrayElimCell_295))) (and (<= .cse14 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (<= .cse14 |c_main_~#prio_queue~0.base|) (= (select (store (store (store (store .cse13 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (<= .cse14 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (exists ((|v_main_~#new_packet~0.base_17| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_main_~#prio_queue~0.base|) 1) (exists ((|v_#valid_166| (Array Int Int))) (and (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse15) (select |v_#valid_166| .cse15))) (exists ((|v_receive_~#packet~0.base_102| Int)) (and (exists ((|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3340 Int)) (let ((.cse17 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (and (= .cse16 (select (select |c_#memory_int| |v_append_to_queue_~#p.base_72|) 0)) (= (select .cse17 |v_append_to_queue_~#p.base_72|) 0) (exists ((|v_main_~#new_packet~0.base_18| Int) (|v_receive_~#packet~0.base_100| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3332 Int) (v_ArrVal_3341 Int)) (let ((.cse18 (store (store (store (store .cse17 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) .cse10 v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344))) (and (= (select (store .cse18 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_receive_~#packet~0.base_100|) 0) (= (select .cse18 |v_main_~#new_packet~0.base_18|) 0) (<= .cse3 |v_receive_~#packet~0.base_100|) (<= .cse14 |v_receive_~#packet~0.base_100|))))))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0))))))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)))))))))))) (let ((.cse19 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse19) (select |v_#valid_160| .cse19))))))))))))))) (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|)))) (<= .cse3 |c_main_~#prio_queue~0.base|) (< (mod .cse16 4294967296) 500) (= |c_#NULL.offset| |c_old(#NULL.offset)|))))) is different from true [2023-04-02 01:14:37,546 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_main_#t~mem45.base|))) (let ((.cse12 (select .cse17 0))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_main_#t~mem45.offset| 0) (let ((.cse0 (+ 2 |c_main_#t~mem45.base|))) (or (exists ((|main_~#prio_queue~0.base| Int)) (and (<= .cse0 |main_~#prio_queue~0.base|) (exists ((v_ArrVal_3308 Int) (|v_main_~#new_packet~0.base_18| Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_17| Int) (|v_#valid_162| (Array Int Int)) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_#valid_166| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3340 Int) (v_ArrVal_3341 Int) (|v_receive_~#packet~0.base_101| Int) (|v_receive_~#packet~0.base_102| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_#valid_160| (Array Int Int)) (|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3331 Int) (v_ArrVal_3332 Int) (|main_~#new_packet~0.base| Int) (|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (v_arrayElimCell_295 Int) (|v_append_to_queue_~#p.base_71| Int) (|v_receive_~#packet~0.base_99| Int)) (let ((.cse7 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (let ((.cse3 (store (store (store (store .cse7 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) |c_main_#t~mem45.base| v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344)) (.cse4 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (.cse2 (+ 2 v_arrayElimCell_295))) (and (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse1) (select |v_#valid_166| .cse1))) (<= .cse2 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (= (select .cse3 |v_main_~#new_packet~0.base_18|) 0) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (<= .cse0 |v_append_to_queue_~#p.base_72|) (= (select .cse4 |v_append_to_queue_~#p.base_71|) 0) (<= .cse2 |v_append_to_queue_~#p.base_72|) (= (select (store .cse3 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_append_to_queue_~#p.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |main_~#prio_queue~0.base|) 1) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse5) (select |v_#valid_162| .cse5))) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (not (= |main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)) (<= .cse2 |main_~#prio_queue~0.base|) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (= (select (store (store (store (store .cse4 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse6) (select |v_#valid_160| .cse6))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (<= .cse2 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (= (select .cse7 |v_append_to_queue_~#p.base_72|) 0))))))) (exists ((|main_~#prio_queue~0.base| Int)) (and (<= .cse0 |main_~#prio_queue~0.base|) (exists ((v_prenex_180 (Array Int Int)) (v_prenex_189 (Array Int Int)) (v_prenex_178 Int) (v_prenex_179 Int) (|v_receive_~#packet~0.base_100| Int) (v_prenex_176 Int) (v_prenex_198 Int) (v_prenex_177 Int) (v_prenex_199 Int) (v_prenex_174 Int) (v_prenex_197 Int) (v_prenex_172 Int) (v_prenex_194 Int) (v_prenex_173 Int) (v_prenex_192 Int) (v_prenex_171 Int) (v_prenex_193 Int) (v_prenex_191 Int) (v_prenex_190 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_prenex_196 (Array Int Int)) (v_prenex_175 (Array Int Int)) (v_prenex_187 Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_183 Int) (v_prenex_184 Int) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse15 (store v_prenex_180 v_prenex_188 v_prenex_185))) (let ((.cse10 (store (store (store (store .cse15 v_prenex_191 v_prenex_186) |c_main_#t~mem45.base| v_prenex_183) v_prenex_191 v_prenex_184) v_prenex_174 v_prenex_182)) (.cse14 (store v_prenex_190 v_prenex_199 v_prenex_171)) (.cse8 (+ 2 v_prenex_197))) (and (<= .cse0 v_prenex_179) (<= .cse8 |main_~#prio_queue~0.base|) (= (select v_prenex_189 v_prenex_181) 1) (= (select v_prenex_195 v_prenex_179) 1) (<= .cse0 v_prenex_181) (= (select v_prenex_196 |main_~#prio_queue~0.base|) 1) (<= .cse0 |v_receive_~#packet~0.base_100|) (let ((.cse9 (@diff v_prenex_195 v_prenex_175))) (= (select v_prenex_195 .cse9) (select v_prenex_175 .cse9))) (= (select .cse10 v_prenex_172) 0) (= (select v_prenex_190 v_prenex_199) 0) (not (= v_prenex_176 v_prenex_181)) (not (= |main_~#prio_queue~0.base| v_prenex_174)) (<= .cse8 v_prenex_179) (= (select v_prenex_180 v_prenex_188) 0) (let ((.cse11 (@diff v_prenex_196 v_prenex_180))) (= (select v_prenex_180 .cse11) (select v_prenex_196 .cse11))) (= (select v_prenex_175 v_prenex_187) 0) (= 0 (select (store .cse10 v_prenex_172 v_prenex_193) |v_receive_~#packet~0.base_100|)) (= (select (select |c_#memory_int| v_prenex_191) 0) .cse12) (let ((.cse13 (@diff v_prenex_189 v_prenex_190))) (= (select v_prenex_189 .cse13) (select v_prenex_190 .cse13))) (<= .cse8 |v_receive_~#packet~0.base_100|) (= (select .cse14 v_prenex_198) 0) (= (select (store (store (store (store .cse14 v_prenex_198 v_prenex_173) v_prenex_197 v_prenex_177) v_prenex_198 v_prenex_178) v_prenex_176 v_prenex_192) v_prenex_194) 0) (<= .cse8 v_prenex_181) (= (select .cse15 v_prenex_191) 0))))))))) (< (mod .cse12 4294967296) 500) (let ((.cse16 (select .cse17 |c_main_#t~mem45.offset|))) (<= .cse16 (+ 499 (* (div (+ (- 1) .cse16) 4294967296) 4294967296)))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)))) is different from false [2023-04-02 01:14:37,554 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_main_#t~mem45.base|))) (let ((.cse12 (select .cse17 0))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_main_#t~mem45.offset| 0) (let ((.cse0 (+ 2 |c_main_#t~mem45.base|))) (or (exists ((|main_~#prio_queue~0.base| Int)) (and (<= .cse0 |main_~#prio_queue~0.base|) (exists ((v_ArrVal_3308 Int) (|v_main_~#new_packet~0.base_18| Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_17| Int) (|v_#valid_162| (Array Int Int)) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_#valid_166| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3340 Int) (v_ArrVal_3341 Int) (|v_receive_~#packet~0.base_101| Int) (|v_receive_~#packet~0.base_102| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_#valid_160| (Array Int Int)) (|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3331 Int) (v_ArrVal_3332 Int) (|main_~#new_packet~0.base| Int) (|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (v_arrayElimCell_295 Int) (|v_append_to_queue_~#p.base_71| Int) (|v_receive_~#packet~0.base_99| Int)) (let ((.cse7 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (let ((.cse3 (store (store (store (store .cse7 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) |c_main_#t~mem45.base| v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344)) (.cse4 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (.cse2 (+ 2 v_arrayElimCell_295))) (and (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse1) (select |v_#valid_166| .cse1))) (<= .cse2 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (= (select .cse3 |v_main_~#new_packet~0.base_18|) 0) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (<= .cse0 |v_append_to_queue_~#p.base_72|) (= (select .cse4 |v_append_to_queue_~#p.base_71|) 0) (<= .cse2 |v_append_to_queue_~#p.base_72|) (= (select (store .cse3 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_append_to_queue_~#p.base_72|) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |main_~#prio_queue~0.base|) 1) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse5) (select |v_#valid_162| .cse5))) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (not (= |main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)) (<= .cse2 |main_~#prio_queue~0.base|) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (= (select (store (store (store (store .cse4 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse6) (select |v_#valid_160| .cse6))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (<= .cse2 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (= (select .cse7 |v_append_to_queue_~#p.base_72|) 0))))))) (exists ((|main_~#prio_queue~0.base| Int)) (and (<= .cse0 |main_~#prio_queue~0.base|) (exists ((v_prenex_180 (Array Int Int)) (v_prenex_189 (Array Int Int)) (v_prenex_178 Int) (v_prenex_179 Int) (|v_receive_~#packet~0.base_100| Int) (v_prenex_176 Int) (v_prenex_198 Int) (v_prenex_177 Int) (v_prenex_199 Int) (v_prenex_174 Int) (v_prenex_197 Int) (v_prenex_172 Int) (v_prenex_194 Int) (v_prenex_173 Int) (v_prenex_192 Int) (v_prenex_171 Int) (v_prenex_193 Int) (v_prenex_191 Int) (v_prenex_190 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_prenex_196 (Array Int Int)) (v_prenex_175 (Array Int Int)) (v_prenex_187 Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_183 Int) (v_prenex_184 Int) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse15 (store v_prenex_180 v_prenex_188 v_prenex_185))) (let ((.cse10 (store (store (store (store .cse15 v_prenex_191 v_prenex_186) |c_main_#t~mem45.base| v_prenex_183) v_prenex_191 v_prenex_184) v_prenex_174 v_prenex_182)) (.cse14 (store v_prenex_190 v_prenex_199 v_prenex_171)) (.cse8 (+ 2 v_prenex_197))) (and (<= .cse0 v_prenex_179) (<= .cse8 |main_~#prio_queue~0.base|) (= (select v_prenex_189 v_prenex_181) 1) (= (select v_prenex_195 v_prenex_179) 1) (<= .cse0 v_prenex_181) (= (select v_prenex_196 |main_~#prio_queue~0.base|) 1) (<= .cse0 |v_receive_~#packet~0.base_100|) (let ((.cse9 (@diff v_prenex_195 v_prenex_175))) (= (select v_prenex_195 .cse9) (select v_prenex_175 .cse9))) (= (select .cse10 v_prenex_172) 0) (= (select v_prenex_190 v_prenex_199) 0) (not (= v_prenex_176 v_prenex_181)) (not (= |main_~#prio_queue~0.base| v_prenex_174)) (<= .cse8 v_prenex_179) (= (select v_prenex_180 v_prenex_188) 0) (let ((.cse11 (@diff v_prenex_196 v_prenex_180))) (= (select v_prenex_180 .cse11) (select v_prenex_196 .cse11))) (= (select v_prenex_175 v_prenex_187) 0) (= 0 (select (store .cse10 v_prenex_172 v_prenex_193) |v_receive_~#packet~0.base_100|)) (= (select (select |c_#memory_int| v_prenex_191) 0) .cse12) (let ((.cse13 (@diff v_prenex_189 v_prenex_190))) (= (select v_prenex_189 .cse13) (select v_prenex_190 .cse13))) (<= .cse8 |v_receive_~#packet~0.base_100|) (= (select .cse14 v_prenex_198) 0) (= (select (store (store (store (store .cse14 v_prenex_198 v_prenex_173) v_prenex_197 v_prenex_177) v_prenex_198 v_prenex_178) v_prenex_176 v_prenex_192) v_prenex_194) 0) (<= .cse8 v_prenex_181) (= (select .cse15 v_prenex_191) 0))))))))) (< (mod .cse12 4294967296) 500) (let ((.cse16 (select .cse17 |c_main_#t~mem45.offset|))) (<= .cse16 (+ 499 (* (div (+ (- 1) .cse16) 4294967296) 4294967296)))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)))) is different from true [2023-04-02 01:14:37,660 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_process_prio_queue_#in~q.base|))) (let ((.cse8 (select .cse17 0))) (and (let ((.cse0 (+ |c_process_prio_queue_#in~q.base| 2))) (or (exists ((|main_~#prio_queue~0.base| Int)) (and (<= .cse0 |main_~#prio_queue~0.base|) (exists ((v_ArrVal_3308 Int) (|v_main_~#new_packet~0.base_18| Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_17| Int) (|v_#valid_162| (Array Int Int)) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_#valid_166| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3340 Int) (v_ArrVal_3341 Int) (|v_receive_~#packet~0.base_101| Int) (|v_receive_~#packet~0.base_102| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_#valid_160| (Array Int Int)) (|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3331 Int) (v_ArrVal_3332 Int) (|main_~#new_packet~0.base| Int) (|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (v_arrayElimCell_295 Int) (|v_append_to_queue_~#p.base_71| Int) (|v_receive_~#packet~0.base_99| Int)) (let ((.cse7 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (let ((.cse3 (store (store (store (store .cse7 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) |c_process_prio_queue_#in~q.base| v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344)) (.cse4 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (.cse2 (+ 2 v_arrayElimCell_295))) (and (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse1) (select |v_#valid_166| .cse1))) (<= .cse2 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select .cse3 |v_main_~#new_packet~0.base_18|) 0) (= (select .cse4 |v_append_to_queue_~#p.base_71|) 0) (<= .cse2 |v_append_to_queue_~#p.base_72|) (= (select |v_old(#valid)_AFTER_CALL_42| |main_~#prio_queue~0.base|) 1) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse5) (select |v_#valid_162| .cse5))) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (not (= |main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)) (<= .cse2 |main_~#prio_queue~0.base|) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (= (select (store .cse3 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_append_to_queue_~#p.base_72|) 0) (= (select (store (store (store (store .cse4 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (<= .cse0 |v_append_to_queue_~#p.base_72|) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse6) (select |v_#valid_160| .cse6))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0) (<= .cse2 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (= (select .cse7 |v_append_to_queue_~#p.base_72|) 0))))))) (exists ((|main_~#prio_queue~0.base| Int)) (and (exists ((v_prenex_180 (Array Int Int)) (v_prenex_189 (Array Int Int)) (v_prenex_178 Int) (v_prenex_179 Int) (|v_receive_~#packet~0.base_100| Int) (v_prenex_176 Int) (v_prenex_198 Int) (v_prenex_177 Int) (v_prenex_199 Int) (v_prenex_174 Int) (v_prenex_197 Int) (v_prenex_172 Int) (v_prenex_194 Int) (v_prenex_173 Int) (v_prenex_192 Int) (v_prenex_171 Int) (v_prenex_193 Int) (v_prenex_191 Int) (v_prenex_190 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_prenex_196 (Array Int Int)) (v_prenex_175 (Array Int Int)) (v_prenex_187 Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_183 Int) (v_prenex_184 Int) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse15 (store v_prenex_180 v_prenex_188 v_prenex_185))) (let ((.cse12 (store (store (store (store .cse15 v_prenex_191 v_prenex_186) |c_process_prio_queue_#in~q.base| v_prenex_183) v_prenex_191 v_prenex_184) v_prenex_174 v_prenex_182)) (.cse14 (store v_prenex_190 v_prenex_199 v_prenex_171)) (.cse9 (+ 2 v_prenex_197))) (and (= (select (select |c_#memory_int| v_prenex_191) 0) .cse8) (<= .cse0 v_prenex_181) (<= .cse9 |main_~#prio_queue~0.base|) (<= .cse0 |v_receive_~#packet~0.base_100|) (= (select v_prenex_189 v_prenex_181) 1) (= (select v_prenex_195 v_prenex_179) 1) (= (select v_prenex_196 |main_~#prio_queue~0.base|) 1) (let ((.cse10 (@diff v_prenex_195 v_prenex_175))) (= (select v_prenex_195 .cse10) (select v_prenex_175 .cse10))) (<= .cse0 v_prenex_179) (= (select v_prenex_190 v_prenex_199) 0) (not (= v_prenex_176 v_prenex_181)) (not (= |main_~#prio_queue~0.base| v_prenex_174)) (<= .cse9 v_prenex_179) (= (select v_prenex_180 v_prenex_188) 0) (let ((.cse11 (@diff v_prenex_196 v_prenex_180))) (= (select v_prenex_180 .cse11) (select v_prenex_196 .cse11))) (= (select (store .cse12 v_prenex_172 v_prenex_193) |v_receive_~#packet~0.base_100|) 0) (= (select v_prenex_175 v_prenex_187) 0) (= (select .cse12 v_prenex_172) 0) (let ((.cse13 (@diff v_prenex_189 v_prenex_190))) (= (select v_prenex_189 .cse13) (select v_prenex_190 .cse13))) (<= .cse9 |v_receive_~#packet~0.base_100|) (= (select .cse14 v_prenex_198) 0) (= (select (store (store (store (store .cse14 v_prenex_198 v_prenex_173) v_prenex_197 v_prenex_177) v_prenex_198 v_prenex_178) v_prenex_176 v_prenex_192) v_prenex_194) 0) (<= .cse9 v_prenex_181) (= (select .cse15 v_prenex_191) 0))))) (<= .cse0 |main_~#prio_queue~0.base|))))) (< (mod .cse8 4294967296) 500) (let ((.cse16 (select .cse17 |c_process_prio_queue_#in~q.offset|))) (<= .cse16 (+ 499 (* 4294967296 (div (+ (- 1) .cse16) 4294967296))))) (= |c_process_prio_queue_#in~q.offset| 0)))) is different from false [2023-04-02 01:14:37,671 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_process_prio_queue_#in~q.base|))) (let ((.cse8 (select .cse17 0))) (and (let ((.cse0 (+ |c_process_prio_queue_#in~q.base| 2))) (or (exists ((|main_~#prio_queue~0.base| Int)) (and (<= .cse0 |main_~#prio_queue~0.base|) (exists ((v_ArrVal_3308 Int) (|v_main_~#new_packet~0.base_18| Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_17| Int) (|v_#valid_162| (Array Int Int)) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_#valid_166| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3340 Int) (v_ArrVal_3341 Int) (|v_receive_~#packet~0.base_101| Int) (|v_receive_~#packet~0.base_102| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_#valid_160| (Array Int Int)) (|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3331 Int) (v_ArrVal_3332 Int) (|main_~#new_packet~0.base| Int) (|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (v_arrayElimCell_295 Int) (|v_append_to_queue_~#p.base_71| Int) (|v_receive_~#packet~0.base_99| Int)) (let ((.cse7 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (let ((.cse3 (store (store (store (store .cse7 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) |c_process_prio_queue_#in~q.base| v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344)) (.cse4 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (.cse2 (+ 2 v_arrayElimCell_295))) (and (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse1) (select |v_#valid_166| .cse1))) (<= .cse2 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select .cse3 |v_main_~#new_packet~0.base_18|) 0) (= (select .cse4 |v_append_to_queue_~#p.base_71|) 0) (<= .cse2 |v_append_to_queue_~#p.base_72|) (= (select |v_old(#valid)_AFTER_CALL_42| |main_~#prio_queue~0.base|) 1) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse5) (select |v_#valid_162| .cse5))) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (not (= |main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)) (<= .cse2 |main_~#prio_queue~0.base|) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (= (select (store .cse3 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_append_to_queue_~#p.base_72|) 0) (= (select (store (store (store (store .cse4 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (<= .cse0 |v_append_to_queue_~#p.base_72|) (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse6) (select |v_#valid_160| .cse6))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0) (<= .cse2 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (= (select .cse7 |v_append_to_queue_~#p.base_72|) 0))))))) (exists ((|main_~#prio_queue~0.base| Int)) (and (exists ((v_prenex_180 (Array Int Int)) (v_prenex_189 (Array Int Int)) (v_prenex_178 Int) (v_prenex_179 Int) (|v_receive_~#packet~0.base_100| Int) (v_prenex_176 Int) (v_prenex_198 Int) (v_prenex_177 Int) (v_prenex_199 Int) (v_prenex_174 Int) (v_prenex_197 Int) (v_prenex_172 Int) (v_prenex_194 Int) (v_prenex_173 Int) (v_prenex_192 Int) (v_prenex_171 Int) (v_prenex_193 Int) (v_prenex_191 Int) (v_prenex_190 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_prenex_196 (Array Int Int)) (v_prenex_175 (Array Int Int)) (v_prenex_187 Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_183 Int) (v_prenex_184 Int) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse15 (store v_prenex_180 v_prenex_188 v_prenex_185))) (let ((.cse12 (store (store (store (store .cse15 v_prenex_191 v_prenex_186) |c_process_prio_queue_#in~q.base| v_prenex_183) v_prenex_191 v_prenex_184) v_prenex_174 v_prenex_182)) (.cse14 (store v_prenex_190 v_prenex_199 v_prenex_171)) (.cse9 (+ 2 v_prenex_197))) (and (= (select (select |c_#memory_int| v_prenex_191) 0) .cse8) (<= .cse0 v_prenex_181) (<= .cse9 |main_~#prio_queue~0.base|) (<= .cse0 |v_receive_~#packet~0.base_100|) (= (select v_prenex_189 v_prenex_181) 1) (= (select v_prenex_195 v_prenex_179) 1) (= (select v_prenex_196 |main_~#prio_queue~0.base|) 1) (let ((.cse10 (@diff v_prenex_195 v_prenex_175))) (= (select v_prenex_195 .cse10) (select v_prenex_175 .cse10))) (<= .cse0 v_prenex_179) (= (select v_prenex_190 v_prenex_199) 0) (not (= v_prenex_176 v_prenex_181)) (not (= |main_~#prio_queue~0.base| v_prenex_174)) (<= .cse9 v_prenex_179) (= (select v_prenex_180 v_prenex_188) 0) (let ((.cse11 (@diff v_prenex_196 v_prenex_180))) (= (select v_prenex_180 .cse11) (select v_prenex_196 .cse11))) (= (select (store .cse12 v_prenex_172 v_prenex_193) |v_receive_~#packet~0.base_100|) 0) (= (select v_prenex_175 v_prenex_187) 0) (= (select .cse12 v_prenex_172) 0) (let ((.cse13 (@diff v_prenex_189 v_prenex_190))) (= (select v_prenex_189 .cse13) (select v_prenex_190 .cse13))) (<= .cse9 |v_receive_~#packet~0.base_100|) (= (select .cse14 v_prenex_198) 0) (= (select (store (store (store (store .cse14 v_prenex_198 v_prenex_173) v_prenex_197 v_prenex_177) v_prenex_198 v_prenex_178) v_prenex_176 v_prenex_192) v_prenex_194) 0) (<= .cse9 v_prenex_181) (= (select .cse15 v_prenex_191) 0))))) (<= .cse0 |main_~#prio_queue~0.base|))))) (< (mod .cse8 4294967296) 500) (let ((.cse16 (select .cse17 |c_process_prio_queue_#in~q.offset|))) (<= .cse16 (+ 499 (* 4294967296 (div (+ (- 1) .cse16) 4294967296))))) (= |c_process_prio_queue_#in~q.offset| 0)))) is different from true [2023-04-02 01:14:37,781 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_process_prio_queue_~node~1.base))) (let ((.cse2 (select .cse1 0))) (and (let ((.cse0 (select .cse1 c_process_prio_queue_~node~1.offset))) (<= .cse0 (+ 499 (* (div (+ (- 1) .cse0) 4294967296) 4294967296)))) (= c_process_prio_queue_~node~1.offset 0) (< (mod .cse2 4294967296) 500) (let ((.cse3 (+ c_process_prio_queue_~node~1.base 2))) (or (exists ((|main_~#prio_queue~0.base| Int)) (and (<= .cse3 |main_~#prio_queue~0.base|) (exists ((v_prenex_180 (Array Int Int)) (v_prenex_189 (Array Int Int)) (v_prenex_178 Int) (v_prenex_179 Int) (|v_receive_~#packet~0.base_100| Int) (v_prenex_176 Int) (v_prenex_198 Int) (v_prenex_177 Int) (v_prenex_199 Int) (v_prenex_174 Int) (v_prenex_197 Int) (v_prenex_172 Int) (v_prenex_194 Int) (v_prenex_173 Int) (v_prenex_192 Int) (v_prenex_171 Int) (v_prenex_193 Int) (v_prenex_191 Int) (v_prenex_190 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_prenex_196 (Array Int Int)) (v_prenex_175 (Array Int Int)) (v_prenex_187 Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_183 Int) (v_prenex_184 Int) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse10 (store v_prenex_180 v_prenex_188 v_prenex_185))) (let ((.cse4 (store (store (store (store .cse10 v_prenex_191 v_prenex_186) c_process_prio_queue_~node~1.base v_prenex_183) v_prenex_191 v_prenex_184) v_prenex_174 v_prenex_182)) (.cse9 (store v_prenex_190 v_prenex_199 v_prenex_171)) (.cse5 (+ 2 v_prenex_197))) (and (= (select .cse4 v_prenex_172) 0) (<= .cse3 v_prenex_181) (<= .cse5 |main_~#prio_queue~0.base|) (= (select v_prenex_189 v_prenex_181) 1) (= (select v_prenex_195 v_prenex_179) 1) (= (select v_prenex_196 |main_~#prio_queue~0.base|) 1) (let ((.cse6 (@diff v_prenex_195 v_prenex_175))) (= (select v_prenex_195 .cse6) (select v_prenex_175 .cse6))) (= (select v_prenex_190 v_prenex_199) 0) (not (= v_prenex_176 v_prenex_181)) (not (= |main_~#prio_queue~0.base| v_prenex_174)) (<= .cse5 v_prenex_179) (= (select v_prenex_180 v_prenex_188) 0) (let ((.cse7 (@diff v_prenex_196 v_prenex_180))) (= (select v_prenex_180 .cse7) (select v_prenex_196 .cse7))) (= (select v_prenex_175 v_prenex_187) 0) (<= .cse3 v_prenex_179) (= (select (store .cse4 v_prenex_172 v_prenex_193) |v_receive_~#packet~0.base_100|) 0) (let ((.cse8 (@diff v_prenex_189 v_prenex_190))) (= (select v_prenex_189 .cse8) (select v_prenex_190 .cse8))) (<= .cse5 |v_receive_~#packet~0.base_100|) (= (select .cse9 v_prenex_198) 0) (= (select (select |c_#memory_int| v_prenex_191) 0) .cse2) (<= .cse3 |v_receive_~#packet~0.base_100|) (= (select (store (store (store (store .cse9 v_prenex_198 v_prenex_173) v_prenex_197 v_prenex_177) v_prenex_198 v_prenex_178) v_prenex_176 v_prenex_192) v_prenex_194) 0) (<= .cse5 v_prenex_181) (= (select .cse10 v_prenex_191) 0))))))) (exists ((|main_~#prio_queue~0.base| Int)) (and (<= .cse3 |main_~#prio_queue~0.base|) (exists ((v_ArrVal_3308 Int) (|v_main_~#new_packet~0.base_18| Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_17| Int) (|v_#valid_162| (Array Int Int)) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_#valid_166| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3340 Int) (v_ArrVal_3341 Int) (|v_receive_~#packet~0.base_101| Int) (|v_receive_~#packet~0.base_102| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_#valid_160| (Array Int Int)) (|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3331 Int) (v_ArrVal_3332 Int) (|main_~#new_packet~0.base| Int) (|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (v_arrayElimCell_295 Int) (|v_append_to_queue_~#p.base_71| Int) (|v_receive_~#packet~0.base_99| Int)) (let ((.cse17 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (let ((.cse15 (store (store (store (store .cse17 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) c_process_prio_queue_~node~1.base v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344)) (.cse13 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (.cse12 (+ 2 v_arrayElimCell_295))) (and (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse11) (select |v_#valid_166| .cse11))) (<= .cse12 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (= (select .cse13 |v_append_to_queue_~#p.base_71|) 0) (<= .cse12 |v_append_to_queue_~#p.base_72|) (= (select |v_old(#valid)_AFTER_CALL_42| |main_~#prio_queue~0.base|) 1) (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse14) (select |v_#valid_162| .cse14))) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (= (select (store .cse15 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_append_to_queue_~#p.base_72|) 0) (not (= |main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)) (<= .cse12 |main_~#prio_queue~0.base|) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (<= .cse3 |v_append_to_queue_~#p.base_72|) (= (select .cse15 |v_main_~#new_packet~0.base_18|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (= (select (store (store (store (store .cse13 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse16) (select |v_#valid_160| .cse16))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0) (<= .cse12 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (= (select .cse17 |v_append_to_queue_~#p.base_72|) 0) (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|)))))))))))) is different from false [2023-04-02 01:14:37,792 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_process_prio_queue_~node~1.base))) (let ((.cse2 (select .cse1 0))) (and (let ((.cse0 (select .cse1 c_process_prio_queue_~node~1.offset))) (<= .cse0 (+ 499 (* (div (+ (- 1) .cse0) 4294967296) 4294967296)))) (= c_process_prio_queue_~node~1.offset 0) (< (mod .cse2 4294967296) 500) (let ((.cse3 (+ c_process_prio_queue_~node~1.base 2))) (or (exists ((|main_~#prio_queue~0.base| Int)) (and (<= .cse3 |main_~#prio_queue~0.base|) (exists ((v_prenex_180 (Array Int Int)) (v_prenex_189 (Array Int Int)) (v_prenex_178 Int) (v_prenex_179 Int) (|v_receive_~#packet~0.base_100| Int) (v_prenex_176 Int) (v_prenex_198 Int) (v_prenex_177 Int) (v_prenex_199 Int) (v_prenex_174 Int) (v_prenex_197 Int) (v_prenex_172 Int) (v_prenex_194 Int) (v_prenex_173 Int) (v_prenex_192 Int) (v_prenex_171 Int) (v_prenex_193 Int) (v_prenex_191 Int) (v_prenex_190 (Array Int Int)) (v_prenex_195 (Array Int Int)) (v_prenex_196 (Array Int Int)) (v_prenex_175 (Array Int Int)) (v_prenex_187 Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_183 Int) (v_prenex_184 Int) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse10 (store v_prenex_180 v_prenex_188 v_prenex_185))) (let ((.cse4 (store (store (store (store .cse10 v_prenex_191 v_prenex_186) c_process_prio_queue_~node~1.base v_prenex_183) v_prenex_191 v_prenex_184) v_prenex_174 v_prenex_182)) (.cse9 (store v_prenex_190 v_prenex_199 v_prenex_171)) (.cse5 (+ 2 v_prenex_197))) (and (= (select .cse4 v_prenex_172) 0) (<= .cse3 v_prenex_181) (<= .cse5 |main_~#prio_queue~0.base|) (= (select v_prenex_189 v_prenex_181) 1) (= (select v_prenex_195 v_prenex_179) 1) (= (select v_prenex_196 |main_~#prio_queue~0.base|) 1) (let ((.cse6 (@diff v_prenex_195 v_prenex_175))) (= (select v_prenex_195 .cse6) (select v_prenex_175 .cse6))) (= (select v_prenex_190 v_prenex_199) 0) (not (= v_prenex_176 v_prenex_181)) (not (= |main_~#prio_queue~0.base| v_prenex_174)) (<= .cse5 v_prenex_179) (= (select v_prenex_180 v_prenex_188) 0) (let ((.cse7 (@diff v_prenex_196 v_prenex_180))) (= (select v_prenex_180 .cse7) (select v_prenex_196 .cse7))) (= (select v_prenex_175 v_prenex_187) 0) (<= .cse3 v_prenex_179) (= (select (store .cse4 v_prenex_172 v_prenex_193) |v_receive_~#packet~0.base_100|) 0) (let ((.cse8 (@diff v_prenex_189 v_prenex_190))) (= (select v_prenex_189 .cse8) (select v_prenex_190 .cse8))) (<= .cse5 |v_receive_~#packet~0.base_100|) (= (select .cse9 v_prenex_198) 0) (= (select (select |c_#memory_int| v_prenex_191) 0) .cse2) (<= .cse3 |v_receive_~#packet~0.base_100|) (= (select (store (store (store (store .cse9 v_prenex_198 v_prenex_173) v_prenex_197 v_prenex_177) v_prenex_198 v_prenex_178) v_prenex_176 v_prenex_192) v_prenex_194) 0) (<= .cse5 v_prenex_181) (= (select .cse10 v_prenex_191) 0))))))) (exists ((|main_~#prio_queue~0.base| Int)) (and (<= .cse3 |main_~#prio_queue~0.base|) (exists ((v_ArrVal_3308 Int) (|v_main_~#new_packet~0.base_18| Int) (v_ArrVal_3309 Int) (|v_main_~#new_packet~0.base_17| Int) (|v_#valid_162| (Array Int Int)) (|v_main_~#new_packet~0.base_16| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_18| Int) (|v_#valid_166| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_19| Int) (v_ArrVal_3344 Int) (v_ArrVal_3342 Int) (v_ArrVal_3343 Int) (v_ArrVal_3340 Int) (v_ArrVal_3341 Int) (|v_receive_~#packet~0.base_101| Int) (|v_receive_~#packet~0.base_102| Int) (|v_old(#valid)_AFTER_CALL_38| (Array Int Int)) (|v_#valid_160| (Array Int Int)) (|v_append_to_queue_~#p.base_72| Int) (v_ArrVal_3331 Int) (v_ArrVal_3332 Int) (|main_~#new_packet~0.base| Int) (|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (v_arrayElimCell_295 Int) (|v_append_to_queue_~#p.base_71| Int) (|v_receive_~#packet~0.base_99| Int)) (let ((.cse17 (store |v_#valid_166| |v_receive_~#packet~0.base_102| v_ArrVal_3340))) (let ((.cse15 (store (store (store (store .cse17 |v_append_to_queue_~#p.base_72| v_ArrVal_3341) c_process_prio_queue_~node~1.base v_ArrVal_3342) |v_append_to_queue_~#p.base_72| v_ArrVal_3343) |v_main_~#new_packet~0.base_17| v_ArrVal_3344)) (.cse13 (store |v_#valid_160| |v_receive_~#packet~0.base_99| v_ArrVal_3308)) (.cse12 (+ 2 v_arrayElimCell_295))) (and (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_166|))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse11) (select |v_#valid_166| .cse11))) (<= .cse12 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) (= (select |v_old(#valid)_AFTER_CALL_38| |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) 1) (= (select .cse13 |v_append_to_queue_~#p.base_71|) 0) (<= .cse12 |v_append_to_queue_~#p.base_72|) (= (select |v_old(#valid)_AFTER_CALL_42| |main_~#prio_queue~0.base|) 1) (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_162|))) (= (select |v_old(#valid)_AFTER_CALL_40| .cse14) (select |v_#valid_162| .cse14))) (not (= |v_main_~#prio_queue~0.base_BEFORE_CALL_19| |v_main_~#new_packet~0.base_16|)) (= (select (store .cse15 |v_main_~#new_packet~0.base_18| v_ArrVal_3332) |v_append_to_queue_~#p.base_72|) 0) (not (= |main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_17|)) (<= .cse12 |main_~#prio_queue~0.base|) (= (select |v_#valid_162| |v_receive_~#packet~0.base_101|) 0) (= (select |v_#valid_160| |v_receive_~#packet~0.base_99|) 0) (<= .cse3 |v_append_to_queue_~#p.base_72|) (= (select .cse15 |v_main_~#new_packet~0.base_18|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |v_main_~#prio_queue~0.base_BEFORE_CALL_18|) 1) (= (select (store (store (store (store .cse13 |v_append_to_queue_~#p.base_71| v_ArrVal_3309) v_arrayElimCell_295 v_ArrVal_3326) |v_append_to_queue_~#p.base_71| v_ArrVal_3327) |v_main_~#new_packet~0.base_16| v_ArrVal_3331) |main_~#new_packet~0.base|) 0) (let ((.cse16 (@diff |v_old(#valid)_AFTER_CALL_38| |v_#valid_160|))) (= (select |v_old(#valid)_AFTER_CALL_38| .cse16) (select |v_#valid_160| .cse16))) (= (select |v_#valid_166| |v_receive_~#packet~0.base_102|) 0) (<= .cse12 |v_main_~#prio_queue~0.base_BEFORE_CALL_19|) (= (select .cse17 |v_append_to_queue_~#p.base_72|) 0) (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_18|)))))))))))) is different from true [2023-04-02 01:14:39,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:14:39,002 INFO L93 Difference]: Finished difference Result 236 states and 302 transitions. [2023-04-02 01:14:39,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-04-02 01:14:39,002 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 9 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 40 [2023-04-02 01:14:39,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:14:39,004 INFO L225 Difference]: With dead ends: 236 [2023-04-02 01:14:39,004 INFO L226 Difference]: Without dead ends: 234 [2023-04-02 01:14:39,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 36 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=217, Invalid=1116, Unknown=71, NotChecked=3708, Total=5112 [2023-04-02 01:14:39,006 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 181 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 4418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3472 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-04-02 01:14:39,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 59 Invalid, 4418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 883 Invalid, 0 Unknown, 3472 Unchecked, 1.8s Time] [2023-04-02 01:14:39,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-04-02 01:14:39,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 184. [2023-04-02 01:14:39,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 141 states have (on average 1.24822695035461) internal successors, (176), 147 states have internal predecessors, (176), 29 states have call successors, (29), 17 states have call predecessors, (29), 12 states have return successors, (29), 19 states have call predecessors, (29), 26 states have call successors, (29) [2023-04-02 01:14:39,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 234 transitions. [2023-04-02 01:14:39,065 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 234 transitions. Word has length 40 [2023-04-02 01:14:39,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:14:39,065 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 234 transitions. [2023-04-02 01:14:39,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 9 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 01:14:39,065 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 234 transitions. [2023-04-02 01:14:39,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-04-02 01:14:39,066 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:14:39,066 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:14:39,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-04-02 01:14:39,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-04-02 01:14:39,273 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:14:39,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:14:39,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1617243827, now seen corresponding path program 1 times [2023-04-02 01:14:39,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:14:39,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145027501] [2023-04-02 01:14:39,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:14:39,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:14:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:14:39,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:14:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:14:40,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 01:14:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:14:40,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-04-02 01:14:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:14:45,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-04-02 01:14:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:14:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 01:14:45,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:14:45,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145027501] [2023-04-02 01:14:45,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145027501] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:14:45,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081175660] [2023-04-02 01:14:45,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:14:45,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:14:45,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:14:45,822 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:14:45,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-04-02 01:14:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:14:46,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 106 conjunts are in the unsatisfiable core [2023-04-02 01:14:46,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:14:46,193 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 01:14:46,193 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-02 01:14:46,229 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 01:14:46,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-04-02 01:14:46,244 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-02 01:14:46,248 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-02 01:14:46,251 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-02 01:14:46,284 WARN L861 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3690 (Array Int Int)) (v_ArrVal_3692 (Array Int Int)) (v_ArrVal_3696 Int) (|v_receive_~#packet~0.base_115| Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_115| v_ArrVal_3690)) (= |c_#valid| (store |c_old(#valid)| |v_receive_~#packet~0.base_115| v_ArrVal_3696)) (= (select |c_old(#valid)| |v_receive_~#packet~0.base_115|) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_115| v_ArrVal_3692)) (= (select (select |c_#memory_$Pointer$.offset| |v_receive_~#packet~0.base_115|) 8) |c_receive_#res.payload.offset|))) is different from true [2023-04-02 01:14:46,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:14:46,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-02 01:14:46,323 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 01:14:46,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-02 01:14:46,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-02 01:14:46,561 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-04-02 01:14:46,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 7 [2023-04-02 01:14:46,565 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-02 01:14:46,568 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-02 01:14:46,578 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2023-04-02 01:14:46,595 WARN L861 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3715 Int) (v_arrayElimArr_49 (Array Int Int)) (v_ArrVal_3697 Int) (v_ArrVal_3710 (Array Int Int)) (v_ArrVal_3700 (Array Int Int)) (append_to_queue_~node~0.base Int) (|v_append_to_queue_~#p.base_76| Int) (v_ArrVal_3714 (Array Int Int)) (v_ArrVal_3709 Int) (v_ArrVal_3703 (Array Int Int)) (v_ArrVal_3704 (Array Int Int))) (and (= (select v_arrayElimArr_49 8) |c_append_to_queue_#in~p.payload.offset|) (= (store (store (store |c_old(#memory_$Pointer$.offset)| |v_append_to_queue_~#p.base_76| v_arrayElimArr_49) append_to_queue_~node~0.base v_ArrVal_3714) |c_append_to_queue_#in~q.base| v_ArrVal_3700) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store (store (store |c_old(#memory_$Pointer$.base)| |v_append_to_queue_~#p.base_76| v_ArrVal_3704) append_to_queue_~node~0.base v_ArrVal_3703) |c_append_to_queue_#in~q.base| v_ArrVal_3710)) (= |c_#valid| (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_76| v_ArrVal_3697) append_to_queue_~node~0.base v_ArrVal_3715) |v_append_to_queue_~#p.base_76| v_ArrVal_3709)) (< append_to_queue_~node~0.base |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |v_append_to_queue_~#p.base_76|)))) is different from true [2023-04-02 01:14:46,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:14:46,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:14:46,657 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-04-02 01:14:46,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 37 [2023-04-02 01:14:46,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:14:46,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:14:46,737 INFO L321 Elim1Store]: treesize reduction 111, result has 35.1 percent of original size [2023-04-02 01:14:46,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 93 [2023-04-02 01:14:46,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:14:46,803 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2023-04-02 01:14:46,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 30 [2023-04-02 01:14:46,827 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 9 treesize of output 7 [2023-04-02 01:14:46,842 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 9 treesize of output 7 [2023-04-02 01:14:46,851 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 9 treesize of output 7 [2023-04-02 01:14:46,862 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 9 treesize of output 7 [2023-04-02 01:14:46,869 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 9 treesize of output 7 [2023-04-02 01:14:47,015 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 7 [2023-04-02 01:14:47,028 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 7 [2023-04-02 01:14:47,039 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-04-02 01:14:47,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 11 treesize of output 7 [2023-04-02 01:14:47,152 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 7 [2023-04-02 01:14:47,156 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-04-02 01:14:47,184 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 7 [2023-04-02 01:14:47,192 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 23 treesize of output 15 [2023-04-02 01:14:47,200 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-04-02 01:14:47,206 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 7 [2023-04-02 01:14:47,218 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 7 [2023-04-02 01:14:47,227 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 23 treesize of output 15 [2023-04-02 01:14:47,237 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 7 [2023-04-02 01:14:47,242 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-04-02 01:14:47,252 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-04-02 01:14:47,258 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 23 treesize of output 15 [2023-04-02 01:14:47,271 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 7 [2023-04-02 01:14:47,276 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 7 [2023-04-02 01:14:47,328 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:14:47,329 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 21 treesize of output 11 [2023-04-02 01:14:47,361 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:14:47,361 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 21 treesize of output 11 [2023-04-02 01:14:47,418 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:14:47,419 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 21 treesize of output 11 [2023-04-02 01:14:47,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-04-02 01:14:47,728 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 01:14:47,728 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 12 treesize of output 14 [2023-04-02 01:14:47,774 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-02 01:14:47,778 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-02 01:14:47,780 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-02 01:14:47,792 WARN L861 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3721 (Array Int Int)) (|v_receive_~#packet~0.base_116| Int) (v_ArrVal_3724 (Array Int Int))) (and (= (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_116| v_ArrVal_3721) |c_#memory_$Pointer$.base|) (= (select |c_old(#valid)| |v_receive_~#packet~0.base_116|) 0) (< |c_#StackHeapBarrier| |v_receive_~#packet~0.base_116|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_116| v_ArrVal_3724)))) is different from true [2023-04-02 01:14:47,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:14:47,806 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-02 01:14:47,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:14:47,811 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-02 01:14:47,816 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-02 01:14:47,817 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-02 01:14:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-04-02 01:14:47,843 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:14:48,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081175660] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:14:48,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:14:48,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 25 [2023-04-02 01:14:48,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108843629] [2023-04-02 01:14:48,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:14:48,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-02 01:14:48,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:14:48,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-02 01:14:48,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=401, Unknown=3, NotChecked=132, Total=650 [2023-04-02 01:14:48,457 INFO L87 Difference]: Start difference. First operand 184 states and 234 transitions. Second operand has 25 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 20 states have internal predecessors, (45), 7 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-04-02 01:15:00,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:15:00,348 INFO L93 Difference]: Finished difference Result 319 states and 416 transitions. [2023-04-02 01:15:00,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-04-02 01:15:00,349 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 20 states have internal predecessors, (45), 7 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 40 [2023-04-02 01:15:00,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:15:00,350 INFO L225 Difference]: With dead ends: 319 [2023-04-02 01:15:00,350 INFO L226 Difference]: Without dead ends: 292 [2023-04-02 01:15:00,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=322, Invalid=1409, Unknown=3, NotChecked=246, Total=1980 [2023-04-02 01:15:00,354 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 203 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 501 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-04-02 01:15:00,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 13 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 751 Invalid, 0 Unknown, 501 Unchecked, 4.7s Time] [2023-04-02 01:15:00,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-04-02 01:15:00,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 205. [2023-04-02 01:15:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 157 states have (on average 1.2547770700636942) internal successors, (197), 165 states have internal predecessors, (197), 33 states have call successors, (33), 18 states have call predecessors, (33), 13 states have return successors, (33), 21 states have call predecessors, (33), 30 states have call successors, (33) [2023-04-02 01:15:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 263 transitions. [2023-04-02 01:15:00,422 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 263 transitions. Word has length 40 [2023-04-02 01:15:00,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:15:00,422 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 263 transitions. [2023-04-02 01:15:00,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 20 states have internal predecessors, (45), 7 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-04-02 01:15:00,423 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 263 transitions. [2023-04-02 01:15:00,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-04-02 01:15:00,424 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:15:00,424 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:15:00,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-04-02 01:15:00,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-04-02 01:15:00,633 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:15:00,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:15:00,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1021347264, now seen corresponding path program 1 times [2023-04-02 01:15:00,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:15:00,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308397293] [2023-04-02 01:15:00,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:15:00,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:15:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:15:01,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:15:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:15:01,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 01:15:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:15:01,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 01:15:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:15:01,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 01:15:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:15:01,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-04-02 01:15:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:15:01,532 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 01:15:01,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:15:01,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308397293] [2023-04-02 01:15:01,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308397293] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:15:01,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890542561] [2023-04-02 01:15:01,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:15:01,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:15:01,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:15:01,534 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:15:01,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-04-02 01:15:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:15:01,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 60 conjunts are in the unsatisfiable core [2023-04-02 01:15:01,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:15:01,943 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 01:15:01,944 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-02 01:15:01,994 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 01:15:01,995 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-02 01:15:02,026 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-02 01:15:02,051 WARN L839 $PredicateComparison]: unable to prove that (exists ((|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int)) (and (= |c_#valid| (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067)) (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_188|))) (= (select |c_old(#valid)| .cse0) (select |v_#valid_188| .cse0))))) is different from false [2023-04-02 01:15:02,053 WARN L861 $PredicateComparison]: unable to prove that (exists ((|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int)) (and (= |c_#valid| (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067)) (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_188|))) (= (select |c_old(#valid)| .cse0) (select |v_#valid_188| .cse0))))) is different from true [2023-04-02 01:15:02,078 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (exists ((|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int)) (and (= |c_#valid| (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067)) (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) (select |v_#valid_188| .cse0))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|)) is different from false [2023-04-02 01:15:02,081 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (exists ((|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int)) (and (= |c_#valid| (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067)) (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) (select |v_#valid_188| .cse0))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|)) is different from true [2023-04-02 01:15:02,131 WARN L839 $PredicateComparison]: unable to prove that (and (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int)) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) (select |v_#valid_188| .cse0))) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|))) (= |c_#valid| |c_old(#valid)|)) is different from false [2023-04-02 01:15:02,133 WARN L861 $PredicateComparison]: unable to prove that (and (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int)) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) (select |v_#valid_188| .cse0))) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|))) (= |c_#valid| |c_old(#valid)|)) is different from true [2023-04-02 01:15:02,162 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-04-02 01:15:02,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 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-02 01:15:02,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02 01:15:02,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02 01:15:02,194 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:15:02,195 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 51 treesize of output 9 [2023-04-02 01:15:02,199 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 9 treesize of output 7 [2023-04-02 01:15:02,248 WARN L839 $PredicateComparison]: unable to prove that (and (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int)) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) (select |v_#valid_188| .cse0))) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|))) (or (and (not (= .cse1 0)) (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int)) (and (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_80|) 0) (= |c_#valid| (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse1 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072)))) (< .cse1 |c_#StackHeapBarrier|)) (exists ((|v_append_to_queue_~#p.base_80| Int)) (and (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_80|) 0) (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse2 (select v_DerPreprocessor_33 |c_append_to_queue_#in~q.offset|))) (and (not (= .cse2 |c_append_to_queue_#in~q.base|)) (< .cse2 |c_#StackHeapBarrier|) (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_32) |c_append_to_queue_#in~q.base| v_DerPreprocessor_33) .cse2 v_DerPreprocessor_32) |c_append_to_queue_#in~q.base| v_DerPreprocessor_33) .cse2)) (not (= .cse2 0)) (= |c_#valid| (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse2 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072)) (= .cse2 .cse1))))))))) is different from false [2023-04-02 01:15:02,251 WARN L861 $PredicateComparison]: unable to prove that (and (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int)) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) (select |v_#valid_188| .cse0))) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|))) (or (and (not (= .cse1 0)) (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int)) (and (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_80|) 0) (= |c_#valid| (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse1 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072)))) (< .cse1 |c_#StackHeapBarrier|)) (exists ((|v_append_to_queue_~#p.base_80| Int)) (and (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_80|) 0) (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse2 (select v_DerPreprocessor_33 |c_append_to_queue_#in~q.offset|))) (and (not (= .cse2 |c_append_to_queue_#in~q.base|)) (< .cse2 |c_#StackHeapBarrier|) (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_32) |c_append_to_queue_#in~q.base| v_DerPreprocessor_33) .cse2 v_DerPreprocessor_32) |c_append_to_queue_#in~q.base| v_DerPreprocessor_33) .cse2)) (not (= .cse2 0)) (= |c_#valid| (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse2 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072)) (= .cse2 .cse1))))))))) is different from true [2023-04-02 01:15:02,770 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|) 0))) (or (let ((.cse0 (+ .cse2 2))) (and (<= .cse0 |c_main_~#prio_queue~0.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse1) (select |v_old(#valid)_AFTER_CALL_50| .cse1))))) (not (= .cse2 0)) (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int)) (let ((.cse3 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= |c_#valid| (store (store (store .cse3 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse2 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072)) (= (select .cse3 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) (select |v_#valid_188| .cse4))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1)))))) (exists ((|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int))) (and (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (v_DerPreprocessor_32 (Array Int Int)) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_ArrVal_4067 Int)) (let ((.cse7 (select v_DerPreprocessor_33 0))) (let ((.cse5 (+ .cse7 2)) (.cse6 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (<= .cse5 |c_main_~#prio_queue~0.base|) (= |c_#valid| (store (store (store .cse6 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse7 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072)) (<= .cse5 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (= (select .cse6 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse8) (select |v_#valid_188| .cse8))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1) (not (= .cse7 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse7 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse7) (select |c_#memory_$Pointer$.base| .cse7)) (= .cse7 .cse2))))))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse9) (select |v_old(#valid)_AFTER_CALL_50| .cse9)))))))))) is different from false [2023-04-02 01:15:02,773 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|) 0))) (or (let ((.cse0 (+ .cse2 2))) (and (<= .cse0 |c_main_~#prio_queue~0.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse1) (select |v_old(#valid)_AFTER_CALL_50| .cse1))))) (not (= .cse2 0)) (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int)) (let ((.cse3 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= |c_#valid| (store (store (store .cse3 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse2 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072)) (= (select .cse3 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) (select |v_#valid_188| .cse4))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1)))))) (exists ((|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int))) (and (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (v_DerPreprocessor_32 (Array Int Int)) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_ArrVal_4067 Int)) (let ((.cse7 (select v_DerPreprocessor_33 0))) (let ((.cse5 (+ .cse7 2)) (.cse6 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (<= .cse5 |c_main_~#prio_queue~0.base|) (= |c_#valid| (store (store (store .cse6 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse7 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072)) (<= .cse5 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (= (select .cse6 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse8) (select |v_#valid_188| .cse8))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1) (not (= .cse7 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse7 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse7) (select |c_#memory_$Pointer$.base| .cse7)) (= .cse7 .cse2))))))) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse9) (select |v_old(#valid)_AFTER_CALL_50| .cse9)))))))))) is different from true [2023-04-02 01:15:03,059 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|) 0))) (or (exists ((|v_main_~#new_packet~0.base_20| Int)) (and (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (v_ArrVal_4075 Int) (|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_receive_~#packet~0.base_131| Int) (v_DerPreprocessor_32 (Array Int Int)) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_190| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse2 (select v_DerPreprocessor_33 0))) (let ((.cse0 (+ .cse2 2)) (.cse1 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (<= .cse0 |c_main_~#prio_queue~0.base|) (= |c_#valid| (store (store (store (store .cse1 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse2 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075)) (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (= (select .cse1 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) (select |v_#valid_188| .cse3))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1) (not (= .cse2 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse2 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse4) (select |v_old(#valid)_AFTER_CALL_50| .cse4))) (= .cse2 .cse5))))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)))) (let ((.cse8 (+ .cse5 2))) (and (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (v_ArrVal_4075 Int)) (let ((.cse6 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select .cse6 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse7) (select |v_#valid_188| .cse7))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1) (= |c_#valid| (store (store (store (store .cse6 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse5 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075))))) (<= .cse8 |c_main_~#prio_queue~0.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse8 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse9) (select |v_old(#valid)_AFTER_CALL_50| .cse9))))) (not (= .cse5 0))))))) is different from false [2023-04-02 01:15:03,063 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|) 0))) (or (exists ((|v_main_~#new_packet~0.base_20| Int)) (and (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (v_ArrVal_4075 Int) (|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_receive_~#packet~0.base_131| Int) (v_DerPreprocessor_32 (Array Int Int)) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_190| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse2 (select v_DerPreprocessor_33 0))) (let ((.cse0 (+ .cse2 2)) (.cse1 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (<= .cse0 |c_main_~#prio_queue~0.base|) (= |c_#valid| (store (store (store (store .cse1 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse2 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075)) (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse0 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (= (select .cse1 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) (select |v_#valid_188| .cse3))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1) (not (= .cse2 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse2 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse4) (select |v_old(#valid)_AFTER_CALL_50| .cse4))) (= .cse2 .cse5))))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)))) (let ((.cse8 (+ .cse5 2))) (and (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (v_ArrVal_4075 Int)) (let ((.cse6 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select .cse6 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse7) (select |v_#valid_188| .cse7))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1) (= |c_#valid| (store (store (store (store .cse6 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse5 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075))))) (<= .cse8 |c_main_~#prio_queue~0.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse8 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse9) (select |v_old(#valid)_AFTER_CALL_50| .cse9))))) (not (= .cse5 0))))))) is different from true [2023-04-02 01:15:03,319 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|) 0))) (or (let ((.cse3 (+ .cse1 2))) (and (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (|main_~#new_packet~0.base| Int) (v_ArrVal_4075 Int)) (let ((.cse0 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= |c_#valid| (store (store (store (store (store .cse0 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse1 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075) |main_~#new_packet~0.base| 1)) (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select .cse0 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) (select |v_#valid_188| .cse2))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1)))) (<= .cse3 |c_main_~#prio_queue~0.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse4) (select |v_old(#valid)_AFTER_CALL_50| .cse4))))) (not (= .cse1 0)))) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (|main_~#new_packet~0.base| Int) (v_ArrVal_4075 Int) (|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_receive_~#packet~0.base_131| Int) (v_DerPreprocessor_32 (Array Int Int)) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_190| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_33 0))) (let ((.cse5 (+ .cse8 2)) (.cse6 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (<= .cse5 |c_main_~#prio_queue~0.base|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse5 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (= (select .cse6 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse7) (select |v_#valid_188| .cse7))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1) (not (= .cse8 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse8 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse8) (select |c_#memory_$Pointer$.base| .cse8)) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse9) (select |v_old(#valid)_AFTER_CALL_50| .cse9))) (= |c_#valid| (store (store (store (store (store .cse6 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse8 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075) |main_~#new_packet~0.base| 1)) (= .cse8 .cse1)))))))) is different from false [2023-04-02 01:15:03,323 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|) 0))) (or (let ((.cse3 (+ .cse1 2))) (and (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (|main_~#new_packet~0.base| Int) (v_ArrVal_4075 Int)) (let ((.cse0 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= |c_#valid| (store (store (store (store (store .cse0 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse1 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075) |main_~#new_packet~0.base| 1)) (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select .cse0 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) (select |v_#valid_188| .cse2))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1)))) (<= .cse3 |c_main_~#prio_queue~0.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse3 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse4) (select |v_old(#valid)_AFTER_CALL_50| .cse4))))) (not (= .cse1 0)))) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (|main_~#new_packet~0.base| Int) (v_ArrVal_4075 Int) (|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_receive_~#packet~0.base_131| Int) (v_DerPreprocessor_32 (Array Int Int)) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_190| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_33 0))) (let ((.cse5 (+ .cse8 2)) (.cse6 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (<= .cse5 |c_main_~#prio_queue~0.base|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse5 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (= (select .cse6 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse7) (select |v_#valid_188| .cse7))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1) (not (= .cse8 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse8 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse8) (select |c_#memory_$Pointer$.base| .cse8)) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse9) (select |v_old(#valid)_AFTER_CALL_50| .cse9))) (= |c_#valid| (store (store (store (store (store .cse6 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse8 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075) |main_~#new_packet~0.base| 1)) (= .cse8 .cse1)))))))) is different from true [2023-04-02 01:15:03,370 WARN L861 $PredicateComparison]: unable to prove that (exists ((|v_receive_~#packet~0.base_130| Int) (v_ArrVal_4079 (Array Int Int))) (and (= (select |c_old(#valid)| |v_receive_~#packet~0.base_130|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_130| v_ArrVal_4079)))) is different from true [2023-04-02 01:15:03,438 INFO L321 Elim1Store]: treesize reduction 38, result has 33.3 percent of original size [2023-04-02 01:15:03,438 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 249 treesize of output 248 [2023-04-02 01:15:03,447 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 231 treesize of output 217 [2023-04-02 01:15:03,652 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|) 0))) (let ((.cse5 (+ .cse1 2))) (let ((.cse3 (<= .cse5 |c_main_~#prio_queue~0.base|)) (.cse6 (not (= .cse1 0)))) (or (and (exists ((v_prenex_294 (Array Int Int)) (v_prenex_307 Int) (v_prenex_304 Int) (v_prenex_306 (Array Int Int)) (v_prenex_301 Int) (|v_receive_~#packet~0.base_130| Int) (v_prenex_302 Int) (v_prenex_300 Int) (v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_295 Int) (v_prenex_296 Int)) (let ((.cse0 (store v_prenex_294 v_prenex_295 v_prenex_296))) (and (= (select (store (store (store (store (store .cse0 v_prenex_304 v_prenex_300) .cse1 v_prenex_301) v_prenex_304 v_prenex_302) v_prenex_307 v_prenex_298) v_prenex_297 1) |v_receive_~#packet~0.base_130|) 0) (= (select v_prenex_294 v_prenex_295) 0) (not (= v_prenex_307 |c_main_~#prio_queue~0.base|)) (let ((.cse2 (@diff v_prenex_306 v_prenex_294))) (= (select v_prenex_306 .cse2) (select v_prenex_294 .cse2))) (= (select v_prenex_306 |c_main_~#prio_queue~0.base|) 1) (= (select .cse0 v_prenex_304) 0)))) .cse3 (exists ((v_prenex_305 (Array Int Int)) (v_prenex_303 Int) (v_prenex_293 Int) (v_prenex_299 (Array Int Int))) (and (let ((.cse4 (@diff v_prenex_299 v_prenex_305))) (= (select v_prenex_305 .cse4) (select v_prenex_299 .cse4))) (<= .cse5 v_prenex_293) (= (select v_prenex_299 v_prenex_293) 1) (= (select v_prenex_305 v_prenex_303) 0))) .cse6) (and (exists ((|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (|main_~#new_packet~0.base| Int) (v_ArrVal_4075 Int) (v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (|v_receive_~#packet~0.base_130| Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int)) (let ((.cse7 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select (store (store (store (store (store .cse7 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse1 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075) |main_~#new_packet~0.base| 1) |v_receive_~#packet~0.base_130|) 0) (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select .cse7 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse8) (select |v_#valid_188| .cse8))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1)))) .cse3 (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse5 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse9) (select |v_old(#valid)_AFTER_CALL_50| .cse9))))) .cse6)))))) is different from false [2023-04-02 01:15:03,658 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|) 0))) (let ((.cse5 (+ .cse1 2))) (let ((.cse3 (<= .cse5 |c_main_~#prio_queue~0.base|)) (.cse6 (not (= .cse1 0)))) (or (and (exists ((v_prenex_294 (Array Int Int)) (v_prenex_307 Int) (v_prenex_304 Int) (v_prenex_306 (Array Int Int)) (v_prenex_301 Int) (|v_receive_~#packet~0.base_130| Int) (v_prenex_302 Int) (v_prenex_300 Int) (v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_295 Int) (v_prenex_296 Int)) (let ((.cse0 (store v_prenex_294 v_prenex_295 v_prenex_296))) (and (= (select (store (store (store (store (store .cse0 v_prenex_304 v_prenex_300) .cse1 v_prenex_301) v_prenex_304 v_prenex_302) v_prenex_307 v_prenex_298) v_prenex_297 1) |v_receive_~#packet~0.base_130|) 0) (= (select v_prenex_294 v_prenex_295) 0) (not (= v_prenex_307 |c_main_~#prio_queue~0.base|)) (let ((.cse2 (@diff v_prenex_306 v_prenex_294))) (= (select v_prenex_306 .cse2) (select v_prenex_294 .cse2))) (= (select v_prenex_306 |c_main_~#prio_queue~0.base|) 1) (= (select .cse0 v_prenex_304) 0)))) .cse3 (exists ((v_prenex_305 (Array Int Int)) (v_prenex_303 Int) (v_prenex_293 Int) (v_prenex_299 (Array Int Int))) (and (let ((.cse4 (@diff v_prenex_299 v_prenex_305))) (= (select v_prenex_305 .cse4) (select v_prenex_299 .cse4))) (<= .cse5 v_prenex_293) (= (select v_prenex_299 v_prenex_293) 1) (= (select v_prenex_305 v_prenex_303) 0))) .cse6) (and (exists ((|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (|main_~#new_packet~0.base| Int) (v_ArrVal_4075 Int) (v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (|v_receive_~#packet~0.base_130| Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int)) (let ((.cse7 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select (store (store (store (store (store .cse7 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse1 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075) |main_~#new_packet~0.base| 1) |v_receive_~#packet~0.base_130|) 0) (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select .cse7 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse8) (select |v_#valid_188| .cse8))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1)))) .cse3 (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse5 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse9) (select |v_old(#valid)_AFTER_CALL_50| .cse9))))) .cse6)))))) is different from true [2023-04-02 01:15:04,032 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 225 treesize of output 189 [2023-04-02 01:15:04,097 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (not (= |c_main_#t~mem45.base| 0))) (.cse1 (+ 2 |c_main_#t~mem45.base|))) (or (and (exists ((v_prenex_294 (Array Int Int)) (v_prenex_307 Int) (v_prenex_308 Int) (|main_~#prio_queue~0.base| Int) (v_prenex_304 Int) (v_prenex_306 (Array Int Int)) (v_prenex_301 Int) (v_prenex_302 Int) (v_prenex_300 Int) (v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_295 Int) (v_prenex_296 Int)) (let ((.cse0 (store v_prenex_294 v_prenex_295 v_prenex_296))) (and (= 0 (select (store (store (store (store (store .cse0 v_prenex_304 v_prenex_300) |c_main_#t~mem45.base| v_prenex_301) v_prenex_304 v_prenex_302) v_prenex_307 v_prenex_298) v_prenex_297 1) v_prenex_308)) (not (= |main_~#prio_queue~0.base| v_prenex_307)) (<= .cse1 |main_~#prio_queue~0.base|) (= (select v_prenex_294 v_prenex_295) 0) (= (select v_prenex_306 |main_~#prio_queue~0.base|) 1) (let ((.cse2 (@diff v_prenex_306 v_prenex_294))) (= (select v_prenex_306 .cse2) (select v_prenex_294 .cse2))) (= (select .cse0 v_prenex_304) 0)))) (exists ((v_prenex_305 (Array Int Int)) (v_prenex_303 Int) (v_prenex_299 (Array Int Int)) (v_prenex_293 Int)) (and (let ((.cse3 (@diff v_prenex_299 v_prenex_305))) (= (select v_prenex_305 .cse3) (select v_prenex_299 .cse3))) (<= .cse1 v_prenex_293) (= (select v_prenex_299 v_prenex_293) 1) (= (select v_prenex_305 v_prenex_303) 0))) .cse4) (and (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (<= .cse1 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse5) (select |v_old(#valid)_AFTER_CALL_50| .cse5))))) .cse4 (exists ((|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (|main_~#new_packet~0.base| Int) (v_ArrVal_4075 Int) (|main_~#prio_queue~0.base| Int) (v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (|v_receive_~#packet~0.base_130| Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int)) (let ((.cse6 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (<= .cse1 |main_~#prio_queue~0.base|) (= (select |v_old(#valid)_AFTER_CALL_48| |main_~#prio_queue~0.base|) 1) (not (= |main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select .cse6 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse7) (select |v_#valid_188| .cse7))) (= (select (store (store (store (store (store .cse6 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) |c_main_#t~mem45.base| v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075) |main_~#new_packet~0.base| 1) |v_receive_~#packet~0.base_130|) 0))))))) is different from false [2023-04-02 01:15:04,102 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse4 (not (= |c_main_#t~mem45.base| 0))) (.cse1 (+ 2 |c_main_#t~mem45.base|))) (or (and (exists ((v_prenex_294 (Array Int Int)) (v_prenex_307 Int) (v_prenex_308 Int) (|main_~#prio_queue~0.base| Int) (v_prenex_304 Int) (v_prenex_306 (Array Int Int)) (v_prenex_301 Int) (v_prenex_302 Int) (v_prenex_300 Int) (v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_295 Int) (v_prenex_296 Int)) (let ((.cse0 (store v_prenex_294 v_prenex_295 v_prenex_296))) (and (= 0 (select (store (store (store (store (store .cse0 v_prenex_304 v_prenex_300) |c_main_#t~mem45.base| v_prenex_301) v_prenex_304 v_prenex_302) v_prenex_307 v_prenex_298) v_prenex_297 1) v_prenex_308)) (not (= |main_~#prio_queue~0.base| v_prenex_307)) (<= .cse1 |main_~#prio_queue~0.base|) (= (select v_prenex_294 v_prenex_295) 0) (= (select v_prenex_306 |main_~#prio_queue~0.base|) 1) (let ((.cse2 (@diff v_prenex_306 v_prenex_294))) (= (select v_prenex_306 .cse2) (select v_prenex_294 .cse2))) (= (select .cse0 v_prenex_304) 0)))) (exists ((v_prenex_305 (Array Int Int)) (v_prenex_303 Int) (v_prenex_299 (Array Int Int)) (v_prenex_293 Int)) (and (let ((.cse3 (@diff v_prenex_299 v_prenex_305))) (= (select v_prenex_305 .cse3) (select v_prenex_299 .cse3))) (<= .cse1 v_prenex_293) (= (select v_prenex_299 v_prenex_293) 1) (= (select v_prenex_305 v_prenex_303) 0))) .cse4) (and (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (<= .cse1 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse5) (select |v_old(#valid)_AFTER_CALL_50| .cse5))))) .cse4 (exists ((|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (|main_~#new_packet~0.base| Int) (v_ArrVal_4075 Int) (|main_~#prio_queue~0.base| Int) (v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (|v_receive_~#packet~0.base_130| Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int)) (let ((.cse6 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (<= .cse1 |main_~#prio_queue~0.base|) (= (select |v_old(#valid)_AFTER_CALL_48| |main_~#prio_queue~0.base|) 1) (not (= |main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select .cse6 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse7) (select |v_#valid_188| .cse7))) (= (select (store (store (store (store (store .cse6 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) |c_main_#t~mem45.base| v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075) |main_~#new_packet~0.base| 1) |v_receive_~#packet~0.base_130|) 0))))))) is different from true [2023-04-02 01:15:04,135 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2023-04-02 01:15:04,135 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:15:04,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890542561] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:15:04,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:15:04,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 28 [2023-04-02 01:15:04,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179646431] [2023-04-02 01:15:04,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:15:04,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-04-02 01:15:04,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:15:04,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-04-02 01:15:04,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=329, Unknown=20, NotChecked=450, Total=870 [2023-04-02 01:15:04,232 INFO L87 Difference]: Start difference. First operand 205 states and 263 transitions. Second operand has 28 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 9 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-02 01:15:04,476 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (let ((.cse6 (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2)))) (let ((.cse5 (@diff .cse6 |c_#memory_$Pointer$.base|))) (let ((.cse3 (store .cse6 .cse5 (select |c_#memory_$Pointer$.base| .cse5)))) (let ((.cse4 (@diff .cse3 |c_#memory_$Pointer$.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (exists ((|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int)) (and (= |c_#valid| (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067)) (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_188|))) (= (select |c_old(#valid)| .cse0) (select |v_#valid_188| .cse0))))) (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (= (select |c_#valid| .cse1) (select |c_old(#valid)| .cse1))) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= (select |c_old(#valid)| .cse2) 0)) (= |c_#memory_$Pointer$.base| (store .cse3 .cse4 (select |c_#memory_$Pointer$.base| .cse4))) (exists ((|v_receive_~#packet~0.base_130| Int) (v_ArrVal_4079 (Array Int Int))) (and (= (select |c_old(#valid)| |v_receive_~#packet~0.base_130|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_130| v_ArrVal_4079)))) (or (= |c_#memory_$Pointer$.base| .cse3) (= (select |c_old(#valid)| .cse4) 0)) (or (= (select |c_old(#valid)| .cse5) 0) (= |c_#memory_$Pointer$.base| .cse6)) (= |c_#NULL.offset| |c_old(#NULL.offset)|))))))) is different from false [2023-04-02 01:15:04,480 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (let ((.cse6 (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2)))) (let ((.cse5 (@diff .cse6 |c_#memory_$Pointer$.base|))) (let ((.cse3 (store .cse6 .cse5 (select |c_#memory_$Pointer$.base| .cse5)))) (let ((.cse4 (@diff .cse3 |c_#memory_$Pointer$.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (exists ((|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int)) (and (= |c_#valid| (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067)) (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_188|))) (= (select |c_old(#valid)| .cse0) (select |v_#valid_188| .cse0))))) (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (= (select |c_#valid| .cse1) (select |c_old(#valid)| .cse1))) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= (select |c_old(#valid)| .cse2) 0)) (= |c_#memory_$Pointer$.base| (store .cse3 .cse4 (select |c_#memory_$Pointer$.base| .cse4))) (exists ((|v_receive_~#packet~0.base_130| Int) (v_ArrVal_4079 (Array Int Int))) (and (= (select |c_old(#valid)| |v_receive_~#packet~0.base_130|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_130| v_ArrVal_4079)))) (or (= |c_#memory_$Pointer$.base| .cse3) (= (select |c_old(#valid)| .cse4) 0)) (or (= (select |c_old(#valid)| .cse5) 0) (= |c_#memory_$Pointer$.base| .cse6)) (= |c_#NULL.offset| |c_old(#NULL.offset)|))))))) is different from true [2023-04-02 01:15:04,484 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (let ((.cse6 (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2)))) (let ((.cse5 (@diff .cse6 |c_#memory_$Pointer$.base|))) (let ((.cse3 (store .cse6 .cse5 (select |c_#memory_$Pointer$.base| .cse5)))) (let ((.cse4 (@diff .cse3 |c_#memory_$Pointer$.base|))) (and (exists ((|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int)) (and (= |c_#valid| (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067)) (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_188|))) (= (select |c_old(#valid)| .cse0) (select |v_#valid_188| .cse0))))) (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (= (select |c_#valid| .cse1) (select |c_old(#valid)| .cse1))) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= (select |c_old(#valid)| .cse2) 0)) (= |c_#memory_$Pointer$.base| (store .cse3 .cse4 (select |c_#memory_$Pointer$.base| .cse4))) (exists ((|v_receive_~#packet~0.base_130| Int) (v_ArrVal_4079 (Array Int Int))) (and (= (select |c_old(#valid)| |v_receive_~#packet~0.base_130|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_130| v_ArrVal_4079)))) (or (= |c_#memory_$Pointer$.base| .cse3) (= (select |c_old(#valid)| .cse4) 0)) (or (= (select |c_old(#valid)| .cse5) 0) (= |c_#memory_$Pointer$.base| .cse6)))))))) is different from false [2023-04-02 01:15:04,488 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (let ((.cse6 (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2)))) (let ((.cse5 (@diff .cse6 |c_#memory_$Pointer$.base|))) (let ((.cse3 (store .cse6 .cse5 (select |c_#memory_$Pointer$.base| .cse5)))) (let ((.cse4 (@diff .cse3 |c_#memory_$Pointer$.base|))) (and (exists ((|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int)) (and (= |c_#valid| (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067)) (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_188|))) (= (select |c_old(#valid)| .cse0) (select |v_#valid_188| .cse0))))) (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (= (select |c_#valid| .cse1) (select |c_old(#valid)| .cse1))) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= (select |c_old(#valid)| .cse2) 0)) (= |c_#memory_$Pointer$.base| (store .cse3 .cse4 (select |c_#memory_$Pointer$.base| .cse4))) (exists ((|v_receive_~#packet~0.base_130| Int) (v_ArrVal_4079 (Array Int Int))) (and (= (select |c_old(#valid)| |v_receive_~#packet~0.base_130|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_130| v_ArrVal_4079)))) (or (= |c_#memory_$Pointer$.base| .cse3) (= (select |c_old(#valid)| .cse4) 0)) (or (= (select |c_old(#valid)| .cse5) 0) (= |c_#memory_$Pointer$.base| .cse6)))))))) is different from true [2023-04-02 01:15:04,491 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 1) (not (= |c_main_~#normal_queue~0.base| |c_main_~#prio_queue~0.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_main_~#prio_queue~0.base|) (exists ((|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int)) (and (= |c_#valid| (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067)) (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) (select |v_#valid_188| .cse0))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|)) is different from false [2023-04-02 01:15:04,493 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 1) (not (= |c_main_~#normal_queue~0.base| |c_main_~#prio_queue~0.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_main_~#prio_queue~0.base|) (exists ((|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int)) (and (= |c_#valid| (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067)) (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) (select |v_#valid_188| .cse0))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1))) (< |c_#StackHeapBarrier| |c_main_~#prio_queue~0.base|)) is different from true [2023-04-02 01:15:04,506 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int)) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) (select |v_#valid_188| .cse0))) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|)) is different from false [2023-04-02 01:15:04,507 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int)) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse0) (select |v_#valid_188| .cse0))) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|))) (= |c_#valid| |c_old(#valid)|) (= |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-02 01:15:04,555 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse11))) (let ((.cse10 (store |c_old(#valid)| .cse11 .cse7))) (let ((.cse9 (@diff .cse10 |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse9))) (let ((.cse1 (store .cse10 .cse9 .cse8))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|)) (.cse4 (@diff .cse1 |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse4)) (.cse3 (not (= .cse5 0)))) (and (or (not (= .cse0 0)) (= |c_#valid| .cse1)) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int)) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) (select |v_#valid_188| .cse2))) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|))) .cse3 (= |c_#valid| (store .cse1 .cse4 .cse0)) (or (and .cse3 (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int)) (and (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_80|) 0) (= |c_#valid| (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse5 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072)))) (< .cse5 |c_#StackHeapBarrier|)) (exists ((|v_append_to_queue_~#p.base_80| Int)) (and (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_80|) 0) (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_33 |c_append_to_queue_#in~q.offset|))) (and (not (= .cse6 |c_append_to_queue_#in~q.base|)) (< .cse6 |c_#StackHeapBarrier|) (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_32) |c_append_to_queue_#in~q.base| v_DerPreprocessor_33) .cse6 v_DerPreprocessor_32) |c_append_to_queue_#in~q.base| v_DerPreprocessor_33) .cse6)) (not (= .cse6 0)) (= |c_#valid| (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse6 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072)) (= .cse6 .cse5))))))) (or (= |c_#valid| |c_old(#valid)|) (not (= .cse7 0))) (or (not (= .cse8 0)) (= (select |c_old(#valid)| .cse9) 0))))))))))) is different from false [2023-04-02 01:15:04,562 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse11 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse11))) (let ((.cse10 (store |c_old(#valid)| .cse11 .cse7))) (let ((.cse9 (@diff .cse10 |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse9))) (let ((.cse1 (store .cse10 .cse9 .cse8))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|)) (.cse4 (@diff .cse1 |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse4)) (.cse3 (not (= .cse5 0)))) (and (or (not (= .cse0 0)) (= |c_#valid| .cse1)) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int)) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse2) (select |v_#valid_188| .cse2))) (< |c_#StackHeapBarrier| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|))) .cse3 (= |c_#valid| (store .cse1 .cse4 .cse0)) (or (and .cse3 (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int)) (and (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_80|) 0) (= |c_#valid| (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse5 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072)))) (< .cse5 |c_#StackHeapBarrier|)) (exists ((|v_append_to_queue_~#p.base_80| Int)) (and (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_80|) 0) (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_33 |c_append_to_queue_#in~q.offset|))) (and (not (= .cse6 |c_append_to_queue_#in~q.base|)) (< .cse6 |c_#StackHeapBarrier|) (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_32) |c_append_to_queue_#in~q.base| v_DerPreprocessor_33) .cse6 v_DerPreprocessor_32) |c_append_to_queue_#in~q.base| v_DerPreprocessor_33) .cse6)) (not (= .cse6 0)) (= |c_#valid| (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse6 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072)) (= .cse6 .cse5))))))) (or (= |c_#valid| |c_old(#valid)|) (not (= .cse7 0))) (or (not (= .cse8 0)) (= (select |c_old(#valid)| .cse9) 0))))))))))) is different from true [2023-04-02 01:15:05,065 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (not (= (select .cse0 |c_main_~#prio_queue~0.offset|) 0)) (let ((.cse3 (select .cse0 0))) (or (let ((.cse1 (+ .cse3 2))) (and (<= .cse1 |c_main_~#prio_queue~0.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse1 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse2) (select |v_old(#valid)_AFTER_CALL_50| .cse2))))) (not (= .cse3 0)) (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int)) (let ((.cse4 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= |c_#valid| (store (store (store .cse4 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse3 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072)) (= (select .cse4 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse5) (select |v_#valid_188| .cse5))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1)))))) (exists ((|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int))) (and (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (v_DerPreprocessor_32 (Array Int Int)) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_ArrVal_4067 Int)) (let ((.cse8 (select v_DerPreprocessor_33 0))) (let ((.cse6 (+ .cse8 2)) (.cse7 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (<= .cse6 |c_main_~#prio_queue~0.base|) (= |c_#valid| (store (store (store .cse7 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse8 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072)) (<= .cse6 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (= (select .cse7 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse9) (select |v_#valid_188| .cse9))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1) (not (= .cse8 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse8 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse8) (select |c_#memory_$Pointer$.base| .cse8)) (= .cse8 .cse3))))))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse10) (select |v_old(#valid)_AFTER_CALL_50| .cse10))))))))) (not (= |c_main_~#normal_queue~0.base| |c_main_~#prio_queue~0.base|)) (not (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 0)))) is different from false [2023-04-02 01:15:05,069 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (and (= |c_main_~#prio_queue~0.offset| 0) (not (= |c_main_~#prio_queue~0.base| |c_main_~#new_packet~0.base|)) (not (= (select .cse0 |c_main_~#prio_queue~0.offset|) 0)) (let ((.cse3 (select .cse0 0))) (or (let ((.cse1 (+ .cse3 2))) (and (<= .cse1 |c_main_~#prio_queue~0.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse1 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse2) (select |v_old(#valid)_AFTER_CALL_50| .cse2))))) (not (= .cse3 0)) (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int)) (let ((.cse4 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= |c_#valid| (store (store (store .cse4 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse3 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072)) (= (select .cse4 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse5) (select |v_#valid_188| .cse5))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1)))))) (exists ((|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int))) (and (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (v_DerPreprocessor_32 (Array Int Int)) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_ArrVal_4067 Int)) (let ((.cse8 (select v_DerPreprocessor_33 0))) (let ((.cse6 (+ .cse8 2)) (.cse7 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (<= .cse6 |c_main_~#prio_queue~0.base|) (= |c_#valid| (store (store (store .cse7 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse8 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072)) (<= .cse6 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (= (select .cse7 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse9) (select |v_#valid_188| .cse9))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1) (not (= .cse8 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse8 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse8) (select |c_#memory_$Pointer$.base| .cse8)) (= .cse8 .cse3))))))) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse10) (select |v_old(#valid)_AFTER_CALL_50| .cse10))))))))) (not (= |c_main_~#normal_queue~0.base| |c_main_~#prio_queue~0.base|)) (not (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 0)))) is different from true [2023-04-02 01:15:05,121 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_main_~#prio_queue~0.offset| 0) (not (= (select .cse0 |c_main_~#prio_queue~0.offset|) 0)) (not (= |c_main_~#normal_queue~0.base| |c_main_~#prio_queue~0.base|)) (let ((.cse6 (select .cse0 0))) (or (exists ((|v_main_~#new_packet~0.base_20| Int)) (and (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (v_ArrVal_4075 Int) (|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_receive_~#packet~0.base_131| Int) (v_DerPreprocessor_32 (Array Int Int)) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_190| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse3 (select v_DerPreprocessor_33 0))) (let ((.cse1 (+ .cse3 2)) (.cse2 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (<= .cse1 |c_main_~#prio_queue~0.base|) (= |c_#valid| (store (store (store (store .cse2 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse3 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075)) (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse1 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (= (select .cse2 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) (select |v_#valid_188| .cse4))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1) (not (= .cse3 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse3 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse3) (select |c_#memory_$Pointer$.base| .cse3)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse5) (select |v_old(#valid)_AFTER_CALL_50| .cse5))) (= .cse3 .cse6))))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)))) (let ((.cse9 (+ .cse6 2))) (and (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (v_ArrVal_4075 Int)) (let ((.cse7 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select .cse7 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse8) (select |v_#valid_188| .cse8))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1) (= |c_#valid| (store (store (store (store .cse7 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse6 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075))))) (<= .cse9 |c_main_~#prio_queue~0.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse9 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse10) (select |v_old(#valid)_AFTER_CALL_50| .cse10))))) (not (= .cse6 0)))))) (not (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2023-04-02 01:15:05,125 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_main_~#prio_queue~0.offset| 0) (not (= (select .cse0 |c_main_~#prio_queue~0.offset|) 0)) (not (= |c_main_~#normal_queue~0.base| |c_main_~#prio_queue~0.base|)) (let ((.cse6 (select .cse0 0))) (or (exists ((|v_main_~#new_packet~0.base_20| Int)) (and (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (v_ArrVal_4075 Int) (|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_receive_~#packet~0.base_131| Int) (v_DerPreprocessor_32 (Array Int Int)) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_190| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse3 (select v_DerPreprocessor_33 0))) (let ((.cse1 (+ .cse3 2)) (.cse2 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (<= .cse1 |c_main_~#prio_queue~0.base|) (= |c_#valid| (store (store (store (store .cse2 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse3 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075)) (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse1 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (= (select .cse2 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) (select |v_#valid_188| .cse4))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1) (not (= .cse3 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse3 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse3) (select |c_#memory_$Pointer$.base| .cse3)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse5) (select |v_old(#valid)_AFTER_CALL_50| .cse5))) (= .cse3 .cse6))))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)))) (let ((.cse9 (+ .cse6 2))) (and (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (v_ArrVal_4075 Int)) (let ((.cse7 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select .cse7 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse8) (select |v_#valid_188| .cse8))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1) (= |c_#valid| (store (store (store (store .cse7 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse6 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075))))) (<= .cse9 |c_main_~#prio_queue~0.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse9 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse10) (select |v_old(#valid)_AFTER_CALL_50| .cse10))))) (not (= .cse6 0)))))) (not (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from true [2023-04-02 01:15:05,150 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (and (= |c_main_~#prio_queue~0.offset| 0) (not (= (select .cse0 |c_main_~#prio_queue~0.offset|) 0)) (not (= |c_main_~#normal_queue~0.base| |c_main_~#prio_queue~0.base|)) (let ((.cse6 (select .cse0 0))) (or (exists ((|v_main_~#new_packet~0.base_20| Int)) (and (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (v_ArrVal_4075 Int) (|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_receive_~#packet~0.base_131| Int) (v_DerPreprocessor_32 (Array Int Int)) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_190| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse3 (select v_DerPreprocessor_33 0))) (let ((.cse1 (+ .cse3 2)) (.cse2 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (<= .cse1 |c_main_~#prio_queue~0.base|) (= |c_#valid| (store (store (store (store .cse2 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse3 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075)) (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse1 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (= (select .cse2 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) (select |v_#valid_188| .cse4))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1) (not (= .cse3 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse3 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse3) (select |c_#memory_$Pointer$.base| .cse3)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse5) (select |v_old(#valid)_AFTER_CALL_50| .cse5))) (= .cse3 .cse6))))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)))) (let ((.cse9 (+ .cse6 2))) (and (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (v_ArrVal_4075 Int)) (let ((.cse7 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select .cse7 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse8) (select |v_#valid_188| .cse8))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1) (= |c_#valid| (store (store (store (store .cse7 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse6 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075))))) (<= .cse9 |c_main_~#prio_queue~0.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse9 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse10) (select |v_old(#valid)_AFTER_CALL_50| .cse10))))) (not (= .cse6 0)))))) (not (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 0)))) is different from false [2023-04-02 01:15:05,154 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (and (= |c_main_~#prio_queue~0.offset| 0) (not (= (select .cse0 |c_main_~#prio_queue~0.offset|) 0)) (not (= |c_main_~#normal_queue~0.base| |c_main_~#prio_queue~0.base|)) (let ((.cse6 (select .cse0 0))) (or (exists ((|v_main_~#new_packet~0.base_20| Int)) (and (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (v_ArrVal_4075 Int) (|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_receive_~#packet~0.base_131| Int) (v_DerPreprocessor_32 (Array Int Int)) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_190| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse3 (select v_DerPreprocessor_33 0))) (let ((.cse1 (+ .cse3 2)) (.cse2 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (<= .cse1 |c_main_~#prio_queue~0.base|) (= |c_#valid| (store (store (store (store .cse2 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse3 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075)) (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse1 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (= (select .cse2 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse4) (select |v_#valid_188| .cse4))) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1) (not (= .cse3 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse3 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse3) (select |c_#memory_$Pointer$.base| .cse3)) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse5) (select |v_old(#valid)_AFTER_CALL_50| .cse5))) (= .cse3 .cse6))))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)))) (let ((.cse9 (+ .cse6 2))) (and (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (v_ArrVal_4075 Int)) (let ((.cse7 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select .cse7 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse8) (select |v_#valid_188| .cse8))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1) (= |c_#valid| (store (store (store (store .cse7 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse6 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075))))) (<= .cse9 |c_main_~#prio_queue~0.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse9 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse10) (select |v_old(#valid)_AFTER_CALL_50| .cse10))))) (not (= .cse6 0)))))) (not (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 0)))) is different from true [2023-04-02 01:15:05,173 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (and (= |c_main_~#prio_queue~0.offset| 0) (not (= (select .cse0 |c_main_~#prio_queue~0.offset|) 0)) (not (= |c_main_~#normal_queue~0.base| |c_main_~#prio_queue~0.base|)) (let ((.cse2 (select .cse0 0))) (or (let ((.cse4 (+ .cse2 2))) (and (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (|main_~#new_packet~0.base| Int) (v_ArrVal_4075 Int)) (let ((.cse1 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= |c_#valid| (store (store (store (store (store .cse1 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse2 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075) |main_~#new_packet~0.base| 1)) (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select .cse1 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) (select |v_#valid_188| .cse3))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1)))) (<= .cse4 |c_main_~#prio_queue~0.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse4 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse5) (select |v_old(#valid)_AFTER_CALL_50| .cse5))))) (not (= .cse2 0)))) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (|main_~#new_packet~0.base| Int) (v_ArrVal_4075 Int) (|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_receive_~#packet~0.base_131| Int) (v_DerPreprocessor_32 (Array Int Int)) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_190| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_33 0))) (let ((.cse6 (+ .cse9 2)) (.cse7 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (<= .cse6 |c_main_~#prio_queue~0.base|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse6 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (= (select .cse7 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse8) (select |v_#valid_188| .cse8))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1) (not (= .cse9 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse9 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse9) (select |c_#memory_$Pointer$.base| .cse9)) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse10) (select |v_old(#valid)_AFTER_CALL_50| .cse10))) (= |c_#valid| (store (store (store (store (store .cse7 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse9 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075) |main_~#new_packet~0.base| 1)) (= .cse9 .cse2))))))) (not (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 0)))) is different from false [2023-04-02 01:15:05,177 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (and (= |c_main_~#prio_queue~0.offset| 0) (not (= (select .cse0 |c_main_~#prio_queue~0.offset|) 0)) (not (= |c_main_~#normal_queue~0.base| |c_main_~#prio_queue~0.base|)) (let ((.cse2 (select .cse0 0))) (or (let ((.cse4 (+ .cse2 2))) (and (exists ((v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_188| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (|main_~#new_packet~0.base| Int) (v_ArrVal_4075 Int)) (let ((.cse1 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= |c_#valid| (store (store (store (store (store .cse1 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse2 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075) |main_~#new_packet~0.base| 1)) (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select .cse1 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse3) (select |v_#valid_188| .cse3))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1)))) (<= .cse4 |c_main_~#prio_queue~0.base|) (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse4 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse5) (select |v_old(#valid)_AFTER_CALL_50| .cse5))))) (not (= .cse2 0)))) (exists ((|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (|main_~#new_packet~0.base| Int) (v_ArrVal_4075 Int) (|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (v_ArrVal_4072 Int) (|v_receive_~#packet~0.base_131| Int) (v_DerPreprocessor_32 (Array Int Int)) (|v_append_to_queue_~#p.base_80| Int) (|v_#valid_190| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_33 0))) (let ((.cse6 (+ .cse9 2)) (.cse7 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (<= .cse6 |c_main_~#prio_queue~0.base|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse6 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (= (select .cse7 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse8) (select |v_#valid_188| .cse8))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1) (not (= .cse9 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse9 v_DerPreprocessor_32) |c_main_~#prio_queue~0.base| v_DerPreprocessor_33) .cse9) (select |c_#memory_$Pointer$.base| .cse9)) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse10) (select |v_old(#valid)_AFTER_CALL_50| .cse10))) (= |c_#valid| (store (store (store (store (store .cse7 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse9 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075) |main_~#new_packet~0.base| 1)) (= .cse9 .cse2))))))) (not (= (select |c_#valid| |c_main_~#prio_queue~0.base|) 0)))) is different from true [2023-04-02 01:15:05,657 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (and (= |c_main_~#prio_queue~0.offset| 0) (not (= (select .cse0 |c_main_~#prio_queue~0.offset|) 0)) (let ((.cse2 (select .cse0 0))) (let ((.cse6 (+ .cse2 2))) (let ((.cse4 (<= .cse6 |c_main_~#prio_queue~0.base|)) (.cse7 (not (= .cse2 0)))) (or (and (exists ((v_prenex_294 (Array Int Int)) (v_prenex_307 Int) (v_prenex_304 Int) (v_prenex_306 (Array Int Int)) (v_prenex_301 Int) (|v_receive_~#packet~0.base_130| Int) (v_prenex_302 Int) (v_prenex_300 Int) (v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_295 Int) (v_prenex_296 Int)) (let ((.cse1 (store v_prenex_294 v_prenex_295 v_prenex_296))) (and (= (select (store (store (store (store (store .cse1 v_prenex_304 v_prenex_300) .cse2 v_prenex_301) v_prenex_304 v_prenex_302) v_prenex_307 v_prenex_298) v_prenex_297 1) |v_receive_~#packet~0.base_130|) 0) (= (select v_prenex_294 v_prenex_295) 0) (not (= v_prenex_307 |c_main_~#prio_queue~0.base|)) (let ((.cse3 (@diff v_prenex_306 v_prenex_294))) (= (select v_prenex_306 .cse3) (select v_prenex_294 .cse3))) (= (select v_prenex_306 |c_main_~#prio_queue~0.base|) 1) (= (select .cse1 v_prenex_304) 0)))) .cse4 (exists ((v_prenex_305 (Array Int Int)) (v_prenex_303 Int) (v_prenex_293 Int) (v_prenex_299 (Array Int Int))) (and (let ((.cse5 (@diff v_prenex_299 v_prenex_305))) (= (select v_prenex_305 .cse5) (select v_prenex_299 .cse5))) (<= .cse6 v_prenex_293) (= (select v_prenex_299 v_prenex_293) 1) (= (select v_prenex_305 v_prenex_303) 0))) .cse7) (and (exists ((|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (|main_~#new_packet~0.base| Int) (v_ArrVal_4075 Int) (v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (|v_receive_~#packet~0.base_130| Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int)) (let ((.cse8 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select (store (store (store (store (store .cse8 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse2 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075) |main_~#new_packet~0.base| 1) |v_receive_~#packet~0.base_130|) 0) (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select .cse8 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse9) (select |v_#valid_188| .cse9))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1)))) .cse4 (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse6 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse10) (select |v_old(#valid)_AFTER_CALL_50| .cse10))))) .cse7))))))) is different from false [2023-04-02 01:15:05,662 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (and (= |c_main_~#prio_queue~0.offset| 0) (not (= (select .cse0 |c_main_~#prio_queue~0.offset|) 0)) (let ((.cse2 (select .cse0 0))) (let ((.cse6 (+ .cse2 2))) (let ((.cse4 (<= .cse6 |c_main_~#prio_queue~0.base|)) (.cse7 (not (= .cse2 0)))) (or (and (exists ((v_prenex_294 (Array Int Int)) (v_prenex_307 Int) (v_prenex_304 Int) (v_prenex_306 (Array Int Int)) (v_prenex_301 Int) (|v_receive_~#packet~0.base_130| Int) (v_prenex_302 Int) (v_prenex_300 Int) (v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_295 Int) (v_prenex_296 Int)) (let ((.cse1 (store v_prenex_294 v_prenex_295 v_prenex_296))) (and (= (select (store (store (store (store (store .cse1 v_prenex_304 v_prenex_300) .cse2 v_prenex_301) v_prenex_304 v_prenex_302) v_prenex_307 v_prenex_298) v_prenex_297 1) |v_receive_~#packet~0.base_130|) 0) (= (select v_prenex_294 v_prenex_295) 0) (not (= v_prenex_307 |c_main_~#prio_queue~0.base|)) (let ((.cse3 (@diff v_prenex_306 v_prenex_294))) (= (select v_prenex_306 .cse3) (select v_prenex_294 .cse3))) (= (select v_prenex_306 |c_main_~#prio_queue~0.base|) 1) (= (select .cse1 v_prenex_304) 0)))) .cse4 (exists ((v_prenex_305 (Array Int Int)) (v_prenex_303 Int) (v_prenex_293 Int) (v_prenex_299 (Array Int Int))) (and (let ((.cse5 (@diff v_prenex_299 v_prenex_305))) (= (select v_prenex_305 .cse5) (select v_prenex_299 .cse5))) (<= .cse6 v_prenex_293) (= (select v_prenex_299 v_prenex_293) 1) (= (select v_prenex_305 v_prenex_303) 0))) .cse7) (and (exists ((|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (|main_~#new_packet~0.base| Int) (v_ArrVal_4075 Int) (v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (|v_receive_~#packet~0.base_130| Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int)) (let ((.cse8 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select (store (store (store (store (store .cse8 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse2 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075) |main_~#new_packet~0.base| 1) |v_receive_~#packet~0.base_130|) 0) (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select .cse8 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse9) (select |v_#valid_188| .cse9))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1)))) .cse4 (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse6 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse10) (select |v_old(#valid)_AFTER_CALL_50| .cse10))))) .cse7))))))) is different from true [2023-04-02 01:15:05,676 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_main_~#prio_queue~0.offset| 0) (not (= (select .cse0 |c_main_~#prio_queue~0.offset|) 0)) (let ((.cse2 (select .cse0 0))) (let ((.cse6 (+ .cse2 2))) (let ((.cse4 (<= .cse6 |c_main_~#prio_queue~0.base|)) (.cse7 (not (= .cse2 0)))) (or (and (exists ((v_prenex_294 (Array Int Int)) (v_prenex_307 Int) (v_prenex_304 Int) (v_prenex_306 (Array Int Int)) (v_prenex_301 Int) (|v_receive_~#packet~0.base_130| Int) (v_prenex_302 Int) (v_prenex_300 Int) (v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_295 Int) (v_prenex_296 Int)) (let ((.cse1 (store v_prenex_294 v_prenex_295 v_prenex_296))) (and (= (select (store (store (store (store (store .cse1 v_prenex_304 v_prenex_300) .cse2 v_prenex_301) v_prenex_304 v_prenex_302) v_prenex_307 v_prenex_298) v_prenex_297 1) |v_receive_~#packet~0.base_130|) 0) (= (select v_prenex_294 v_prenex_295) 0) (not (= v_prenex_307 |c_main_~#prio_queue~0.base|)) (let ((.cse3 (@diff v_prenex_306 v_prenex_294))) (= (select v_prenex_306 .cse3) (select v_prenex_294 .cse3))) (= (select v_prenex_306 |c_main_~#prio_queue~0.base|) 1) (= (select .cse1 v_prenex_304) 0)))) .cse4 (exists ((v_prenex_305 (Array Int Int)) (v_prenex_303 Int) (v_prenex_293 Int) (v_prenex_299 (Array Int Int))) (and (let ((.cse5 (@diff v_prenex_299 v_prenex_305))) (= (select v_prenex_305 .cse5) (select v_prenex_299 .cse5))) (<= .cse6 v_prenex_293) (= (select v_prenex_299 v_prenex_293) 1) (= (select v_prenex_305 v_prenex_303) 0))) .cse7) (and (exists ((|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (|main_~#new_packet~0.base| Int) (v_ArrVal_4075 Int) (v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (|v_receive_~#packet~0.base_130| Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int)) (let ((.cse8 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select (store (store (store (store (store .cse8 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse2 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075) |main_~#new_packet~0.base| 1) |v_receive_~#packet~0.base_130|) 0) (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select .cse8 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse9) (select |v_#valid_188| .cse9))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1)))) .cse4 (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse6 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse10) (select |v_old(#valid)_AFTER_CALL_50| .cse10))))) .cse7))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2023-04-02 01:15:05,682 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_main_~#prio_queue~0.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_main_~#prio_queue~0.offset| 0) (not (= (select .cse0 |c_main_~#prio_queue~0.offset|) 0)) (let ((.cse2 (select .cse0 0))) (let ((.cse6 (+ .cse2 2))) (let ((.cse4 (<= .cse6 |c_main_~#prio_queue~0.base|)) (.cse7 (not (= .cse2 0)))) (or (and (exists ((v_prenex_294 (Array Int Int)) (v_prenex_307 Int) (v_prenex_304 Int) (v_prenex_306 (Array Int Int)) (v_prenex_301 Int) (|v_receive_~#packet~0.base_130| Int) (v_prenex_302 Int) (v_prenex_300 Int) (v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_295 Int) (v_prenex_296 Int)) (let ((.cse1 (store v_prenex_294 v_prenex_295 v_prenex_296))) (and (= (select (store (store (store (store (store .cse1 v_prenex_304 v_prenex_300) .cse2 v_prenex_301) v_prenex_304 v_prenex_302) v_prenex_307 v_prenex_298) v_prenex_297 1) |v_receive_~#packet~0.base_130|) 0) (= (select v_prenex_294 v_prenex_295) 0) (not (= v_prenex_307 |c_main_~#prio_queue~0.base|)) (let ((.cse3 (@diff v_prenex_306 v_prenex_294))) (= (select v_prenex_306 .cse3) (select v_prenex_294 .cse3))) (= (select v_prenex_306 |c_main_~#prio_queue~0.base|) 1) (= (select .cse1 v_prenex_304) 0)))) .cse4 (exists ((v_prenex_305 (Array Int Int)) (v_prenex_303 Int) (v_prenex_293 Int) (v_prenex_299 (Array Int Int))) (and (let ((.cse5 (@diff v_prenex_299 v_prenex_305))) (= (select v_prenex_305 .cse5) (select v_prenex_299 .cse5))) (<= .cse6 v_prenex_293) (= (select v_prenex_299 v_prenex_293) 1) (= (select v_prenex_305 v_prenex_303) 0))) .cse7) (and (exists ((|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (|main_~#new_packet~0.base| Int) (v_ArrVal_4075 Int) (v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (|v_receive_~#packet~0.base_130| Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int)) (let ((.cse8 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select (store (store (store (store (store .cse8 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) .cse2 v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075) |main_~#new_packet~0.base| 1) |v_receive_~#packet~0.base_130|) 0) (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (= (select .cse8 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse9) (select |v_#valid_188| .cse9))) (not (= |c_main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_48| |c_main_~#prio_queue~0.base|) 1)))) .cse4 (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (<= .cse6 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse10) (select |v_old(#valid)_AFTER_CALL_50| .cse10))))) .cse7))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from true [2023-04-02 01:15:05,709 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (not (= |c_main_#t~mem45.base| 0)))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (+ 2 |c_main_#t~mem45.base|))) (or (and (exists ((v_prenex_294 (Array Int Int)) (v_prenex_307 Int) (v_prenex_308 Int) (|main_~#prio_queue~0.base| Int) (v_prenex_304 Int) (v_prenex_306 (Array Int Int)) (v_prenex_301 Int) (v_prenex_302 Int) (v_prenex_300 Int) (v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_295 Int) (v_prenex_296 Int)) (let ((.cse0 (store v_prenex_294 v_prenex_295 v_prenex_296))) (and (= 0 (select (store (store (store (store (store .cse0 v_prenex_304 v_prenex_300) |c_main_#t~mem45.base| v_prenex_301) v_prenex_304 v_prenex_302) v_prenex_307 v_prenex_298) v_prenex_297 1) v_prenex_308)) (not (= |main_~#prio_queue~0.base| v_prenex_307)) (<= .cse1 |main_~#prio_queue~0.base|) (= (select v_prenex_294 v_prenex_295) 0) (= (select v_prenex_306 |main_~#prio_queue~0.base|) 1) (let ((.cse2 (@diff v_prenex_306 v_prenex_294))) (= (select v_prenex_306 .cse2) (select v_prenex_294 .cse2))) (= (select .cse0 v_prenex_304) 0)))) (exists ((v_prenex_305 (Array Int Int)) (v_prenex_303 Int) (v_prenex_299 (Array Int Int)) (v_prenex_293 Int)) (and (let ((.cse3 (@diff v_prenex_299 v_prenex_305))) (= (select v_prenex_305 .cse3) (select v_prenex_299 .cse3))) (<= .cse1 v_prenex_293) (= (select v_prenex_299 v_prenex_293) 1) (= (select v_prenex_305 v_prenex_303) 0))) .cse4) (and (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (<= .cse1 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse5) (select |v_old(#valid)_AFTER_CALL_50| .cse5))))) .cse4 (exists ((|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (|main_~#new_packet~0.base| Int) (v_ArrVal_4075 Int) (|main_~#prio_queue~0.base| Int) (v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (|v_receive_~#packet~0.base_130| Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int)) (let ((.cse6 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (<= .cse1 |main_~#prio_queue~0.base|) (= (select |v_old(#valid)_AFTER_CALL_48| |main_~#prio_queue~0.base|) 1) (not (= |main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select .cse6 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse7) (select |v_#valid_188| .cse7))) (= (select (store (store (store (store (store .cse6 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) |c_main_#t~mem45.base| v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075) |main_~#new_packet~0.base| 1) |v_receive_~#packet~0.base_130|) 0))))))) .cse4 (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2023-04-02 01:15:05,714 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse4 (not (= |c_main_#t~mem45.base| 0)))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (+ 2 |c_main_#t~mem45.base|))) (or (and (exists ((v_prenex_294 (Array Int Int)) (v_prenex_307 Int) (v_prenex_308 Int) (|main_~#prio_queue~0.base| Int) (v_prenex_304 Int) (v_prenex_306 (Array Int Int)) (v_prenex_301 Int) (v_prenex_302 Int) (v_prenex_300 Int) (v_prenex_297 Int) (v_prenex_298 Int) (v_prenex_295 Int) (v_prenex_296 Int)) (let ((.cse0 (store v_prenex_294 v_prenex_295 v_prenex_296))) (and (= 0 (select (store (store (store (store (store .cse0 v_prenex_304 v_prenex_300) |c_main_#t~mem45.base| v_prenex_301) v_prenex_304 v_prenex_302) v_prenex_307 v_prenex_298) v_prenex_297 1) v_prenex_308)) (not (= |main_~#prio_queue~0.base| v_prenex_307)) (<= .cse1 |main_~#prio_queue~0.base|) (= (select v_prenex_294 v_prenex_295) 0) (= (select v_prenex_306 |main_~#prio_queue~0.base|) 1) (let ((.cse2 (@diff v_prenex_306 v_prenex_294))) (= (select v_prenex_306 .cse2) (select v_prenex_294 .cse2))) (= (select .cse0 v_prenex_304) 0)))) (exists ((v_prenex_305 (Array Int Int)) (v_prenex_303 Int) (v_prenex_299 (Array Int Int)) (v_prenex_293 Int)) (and (let ((.cse3 (@diff v_prenex_299 v_prenex_305))) (= (select v_prenex_305 .cse3) (select v_prenex_299 .cse3))) (<= .cse1 v_prenex_293) (= (select v_prenex_299 v_prenex_293) 1) (= (select v_prenex_305 v_prenex_303) 0))) .cse4) (and (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_main_~#prio_queue~0.base_BEFORE_CALL_24| Int) (|v_receive_~#packet~0.base_131| Int) (|v_#valid_190| (Array Int Int))) (and (<= .cse1 |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) (= (select |v_old(#valid)_AFTER_CALL_50| |v_main_~#prio_queue~0.base_BEFORE_CALL_24|) 1) (= (select |v_#valid_190| |v_receive_~#packet~0.base_131|) 0) (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_190|))) (= (select |v_#valid_190| .cse5) (select |v_old(#valid)_AFTER_CALL_50| .cse5))))) .cse4 (exists ((|v_#valid_188| (Array Int Int)) (|v_receive_~#packet~0.base_129| Int) (v_ArrVal_4067 Int) (|main_~#new_packet~0.base| Int) (v_ArrVal_4075 Int) (|main_~#prio_queue~0.base| Int) (v_ArrVal_4074 Int) (v_ArrVal_4071 Int) (|v_receive_~#packet~0.base_130| Int) (v_ArrVal_4072 Int) (|v_append_to_queue_~#p.base_80| Int) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_main_~#new_packet~0.base_20| Int)) (let ((.cse6 (store |v_#valid_188| |v_receive_~#packet~0.base_129| v_ArrVal_4067))) (and (= (select |v_#valid_188| |v_receive_~#packet~0.base_129|) 0) (<= .cse1 |main_~#prio_queue~0.base|) (= (select |v_old(#valid)_AFTER_CALL_48| |main_~#prio_queue~0.base|) 1) (not (= |main_~#prio_queue~0.base| |v_main_~#new_packet~0.base_20|)) (= (select .cse6 |v_append_to_queue_~#p.base_80|) 0) (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_48| |v_#valid_188|))) (= (select |v_old(#valid)_AFTER_CALL_48| .cse7) (select |v_#valid_188| .cse7))) (= (select (store (store (store (store (store .cse6 |v_append_to_queue_~#p.base_80| v_ArrVal_4074) |c_main_#t~mem45.base| v_ArrVal_4071) |v_append_to_queue_~#p.base_80| v_ArrVal_4072) |v_main_~#new_packet~0.base_20| v_ArrVal_4075) |main_~#new_packet~0.base| 1) |v_receive_~#packet~0.base_130|) 0))))))) .cse4 (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from true [2023-04-02 01:15:05,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:15:05,991 INFO L93 Difference]: Finished difference Result 297 states and 386 transitions. [2023-04-02 01:15:05,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-04-02 01:15:05,992 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 9 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 45 [2023-04-02 01:15:05,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:15:05,993 INFO L225 Difference]: With dead ends: 297 [2023-04-02 01:15:05,993 INFO L226 Difference]: Without dead ends: 282 [2023-04-02 01:15:05,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=185, Invalid=851, Unknown=44, NotChecked=1782, Total=2862 [2023-04-02 01:15:05,995 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 226 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2131 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:15:05,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 50 Invalid, 3009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 793 Invalid, 0 Unknown, 2131 Unchecked, 1.1s Time] [2023-04-02 01:15:05,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-04-02 01:15:06,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 221. [2023-04-02 01:15:06,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 169 states have (on average 1.2544378698224852) internal successors, (212), 178 states have internal predecessors, (212), 36 states have call successors, (36), 19 states have call predecessors, (36), 14 states have return successors, (36), 23 states have call predecessors, (36), 33 states have call successors, (36) [2023-04-02 01:15:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 284 transitions. [2023-04-02 01:15:06,069 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 284 transitions. Word has length 45 [2023-04-02 01:15:06,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:15:06,069 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 284 transitions. [2023-04-02 01:15:06,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 9 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-02 01:15:06,069 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 284 transitions. [2023-04-02 01:15:06,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-04-02 01:15:06,072 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:15:06,072 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:15:06,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-04-02 01:15:06,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-04-02 01:15:06,282 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:15:06,282 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:15:06,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1370889185, now seen corresponding path program 1 times [2023-04-02 01:15:06,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:15:06,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136308816] [2023-04-02 01:15:06,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:15:06,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:15:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:15:07,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:15:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:15:07,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 01:15:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:15:07,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 01:15:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat