./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 16:12:57,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 16:12:57,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 16:12:57,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 16:12:57,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 16:12:57,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 16:12:57,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 16:12:57,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 16:12:57,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 16:12:57,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 16:12:57,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 16:12:57,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 16:12:57,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 16:12:57,231 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 16:12:57,233 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 16:12:57,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 16:12:57,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 16:12:57,240 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 16:12:57,241 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 16:12:57,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 16:12:57,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 16:12:57,254 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 16:12:57,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 16:12:57,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 16:12:57,268 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 16:12:57,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 16:12:57,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 16:12:57,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 16:12:57,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 16:12:57,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 16:12:57,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 16:12:57,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 16:12:57,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 16:12:57,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 16:12:57,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 16:12:57,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 16:12:57,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 16:12:57,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 16:12:57,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 16:12:57,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 16:12:57,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 16:12:57,286 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/config/svcomp-Reach-32bit-GemCutter_Default.epf [2022-11-20 16:12:57,312 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 16:12:57,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 16:12:57,313 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 16:12:57,313 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 16:12:57,314 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 16:12:57,314 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 16:12:57,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 16:12:57,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 16:12:57,316 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 16:12:57,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 16:12:57,316 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 16:12:57,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 16:12:57,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 16:12:57,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 16:12:57,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 16:12:57,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 16:12:57,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 16:12:57,318 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 16:12:57,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 16:12:57,318 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 16:12:57,319 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 16:12:57,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 16:12:57,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 16:12:57,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 16:12:57,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 16:12:57,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 16:12:57,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 16:12:57,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 16:12:57,322 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 16:12:57,322 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-20 16:12:57,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 16:12:57,323 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 16:12:57,323 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-20 16:12:57,323 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 16:12:57,324 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-20 16:12:57,324 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-20 16:12:57,325 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2022-11-20 16:12:57,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 16:12:57,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 16:12:57,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 16:12:57,796 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 16:12:57,797 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 16:12:57,798 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/../../sv-benchmarks/c/pthread/queue_ok.i [2022-11-20 16:13:01,109 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 16:13:01,501 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 16:13:01,502 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/sv-benchmarks/c/pthread/queue_ok.i [2022-11-20 16:13:01,521 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/data/61dec94a9/2575d47420fb4763b33414903610d10e/FLAGb2d686498 [2022-11-20 16:13:01,539 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/data/61dec94a9/2575d47420fb4763b33414903610d10e [2022-11-20 16:13:01,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 16:13:01,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 16:13:01,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 16:13:01,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 16:13:01,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 16:13:01,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:13:01" (1/1) ... [2022-11-20 16:13:01,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f33a0ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:01, skipping insertion in model container [2022-11-20 16:13:01,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:13:01" (1/1) ... [2022-11-20 16:13:01,562 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 16:13:01,607 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 16:13:02,220 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-20 16:13:02,236 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-20 16:13:02,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 16:13:02,260 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 16:13:02,314 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-20 16:13:02,331 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-20 16:13:02,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 16:13:02,423 INFO L208 MainTranslator]: Completed translation [2022-11-20 16:13:02,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:02 WrapperNode [2022-11-20 16:13:02,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 16:13:02,425 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 16:13:02,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 16:13:02,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 16:13:02,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:02" (1/1) ... [2022-11-20 16:13:02,483 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:02" (1/1) ... [2022-11-20 16:13:02,515 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-11-20 16:13:02,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 16:13:02,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 16:13:02,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 16:13:02,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 16:13:02,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:02" (1/1) ... [2022-11-20 16:13:02,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:02" (1/1) ... [2022-11-20 16:13:02,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:02" (1/1) ... [2022-11-20 16:13:02,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:02" (1/1) ... [2022-11-20 16:13:02,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:02" (1/1) ... [2022-11-20 16:13:02,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:02" (1/1) ... [2022-11-20 16:13:02,563 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:02" (1/1) ... [2022-11-20 16:13:02,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:02" (1/1) ... [2022-11-20 16:13:02,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 16:13:02,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 16:13:02,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 16:13:02,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 16:13:02,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:02" (1/1) ... [2022-11-20 16:13:02,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 16:13:02,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:13:02,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 16:13:02,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 16:13:02,692 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-20 16:13:02,692 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-20 16:13:02,692 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-20 16:13:02,692 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-20 16:13:02,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 16:13:02,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 16:13:02,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 16:13:02,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 16:13:02,693 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-20 16:13:02,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 16:13:02,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 16:13:02,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 16:13:02,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 16:13:02,695 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 16:13:02,889 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 16:13:02,891 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 16:13:03,383 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 16:13:03,395 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 16:13:03,395 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 16:13:03,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:13:03 BoogieIcfgContainer [2022-11-20 16:13:03,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 16:13:03,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 16:13:03,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 16:13:03,406 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 16:13:03,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:13:01" (1/3) ... [2022-11-20 16:13:03,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4d6ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:13:03, skipping insertion in model container [2022-11-20 16:13:03,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:13:02" (2/3) ... [2022-11-20 16:13:03,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4d6ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:13:03, skipping insertion in model container [2022-11-20 16:13:03,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:13:03" (3/3) ... [2022-11-20 16:13:03,410 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-11-20 16:13:03,421 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 16:13:03,436 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 16:13:03,436 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 16:13:03,436 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 16:13:03,607 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 16:13:03,672 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 16:13:03,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-20 16:13:03,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:13:03,678 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-20 16:13:03,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-20 16:13:03,743 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-20 16:13:03,771 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-20 16:13:03,792 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=PARTIAL_ORDER_FA, 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;@749449fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 16:13:03,793 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-20 16:13:03,856 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 16:13:03,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:13:03,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2032738951, now seen corresponding path program 1 times [2022-11-20 16:13:03,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:13:03,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813895474] [2022-11-20 16:13:03,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:03,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:13:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:04,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:13:04,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813895474] [2022-11-20 16:13:04,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813895474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:13:04,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:13:04,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 16:13:04,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459622736] [2022-11-20 16:13:04,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:13:04,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 16:13:04,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:13:04,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 16:13:04,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 16:13:04,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:04,394 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:13:04,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:13:04,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:04,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:04,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-11-20 16:13:04,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-11-20 16:13:04,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-11-20 16:13:04,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 16:13:04,919 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-20 16:13:04,922 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (1/2) [2022-11-20 16:13:04,931 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 16:13:04,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-20 16:13:04,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:13:04,954 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-20 16:13:04,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-11-20 16:13:04,958 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-20 16:13:04,964 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2022-11-20 16:13:04,965 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=PARTIAL_ORDER_FA, 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;@749449fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 16:13:04,966 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 16:13:05,214 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 16:13:05,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:13:05,215 INFO L85 PathProgramCache]: Analyzing trace with hash 556189640, now seen corresponding path program 1 times [2022-11-20 16:13:05,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:13:05,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277533183] [2022-11-20 16:13:05,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:05,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:13:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:05,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:05,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:13:05,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277533183] [2022-11-20 16:13:05,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277533183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:13:05,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:13:05,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 16:13:05,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669561360] [2022-11-20 16:13:05,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:13:05,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 16:13:05,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:13:05,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 16:13:05,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 16:13:05,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:05,466 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:13:05,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 70.5) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:13:05,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:05,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:05,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 16:13:05,519 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 16:13:05,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:13:05,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1917463951, now seen corresponding path program 1 times [2022-11-20 16:13:05,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:13:05,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732439739] [2022-11-20 16:13:05,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:05,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:13:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:05,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:05,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:13:05,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732439739] [2022-11-20 16:13:05,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732439739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:13:05,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:13:05,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 16:13:05,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690525815] [2022-11-20 16:13:05,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:13:05,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 16:13:05,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:13:05,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 16:13:05,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 16:13:05,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:05,832 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:13:05,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:13:05,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:05,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:06,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:06,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:06,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 16:13:06,068 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 16:13:06,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:13:06,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1046000605, now seen corresponding path program 1 times [2022-11-20 16:13:06,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:13:06,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299335903] [2022-11-20 16:13:06,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:06,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:13:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:06,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:06,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:13:06,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299335903] [2022-11-20 16:13:06,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299335903] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:13:06,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 16:13:06,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 16:13:06,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760480364] [2022-11-20 16:13:06,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:13:06,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 16:13:06,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:13:06,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 16:13:06,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 16:13:06,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:06,573 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:13:06,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:13:06,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:06,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:06,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:06,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:06,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:06,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:06,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 16:13:06,647 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 16:13:06,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:13:06,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1992490447, now seen corresponding path program 1 times [2022-11-20 16:13:06,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:13:06,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143922471] [2022-11-20 16:13:06,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:06,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:13:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:06,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:06,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:13:06,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143922471] [2022-11-20 16:13:06,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143922471] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:13:06,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991897394] [2022-11-20 16:13:06,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:07,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:13:07,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:13:07,006 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:13:07,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 16:13:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:07,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 16:13:07,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:13:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:07,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:13:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:07,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991897394] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:13:07,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:13:07,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 16:13:07,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507768503] [2022-11-20 16:13:07,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:13:07,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 16:13:07,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:13:07,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 16:13:07,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 16:13:07,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:07,654 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:13:07,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.6) internal successors, (256), 10 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:13:07,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:07,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:07,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:07,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:07,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:07,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:07,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:07,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:13:07,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 16:13:07,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:13:07,977 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 16:13:07,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:13:07,978 INFO L85 PathProgramCache]: Analyzing trace with hash 679810417, now seen corresponding path program 2 times [2022-11-20 16:13:07,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:13:07,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395840525] [2022-11-20 16:13:07,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:07,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:13:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:08,516 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:08,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:13:08,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395840525] [2022-11-20 16:13:08,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395840525] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:13:08,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449282398] [2022-11-20 16:13:08,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 16:13:08,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:13:08,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:13:08,519 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:13:08,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 16:13:08,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 16:13:08,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:13:08,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 16:13:08,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:13:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-20 16:13:08,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 16:13:08,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449282398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:13:08,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 16:13:08,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2022-11-20 16:13:08,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658471867] [2022-11-20 16:13:08,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:13:08,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 16:13:08,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:13:08,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 16:13:08,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-20 16:13:08,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:08,791 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:13:08,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:13:08,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:08,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:08,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:08,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:13:08,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:08,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:08,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:08,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:08,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:13:08,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:13:08,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 16:13:09,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:13:09,065 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 16:13:09,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:13:09,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1811839094, now seen corresponding path program 1 times [2022-11-20 16:13:09,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:13:09,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016922157] [2022-11-20 16:13:09,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:09,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:13:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:09,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:13:09,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016922157] [2022-11-20 16:13:09,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016922157] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:13:09,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013419106] [2022-11-20 16:13:09,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:09,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:13:09,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:13:09,544 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:13:09,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 16:13:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:09,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 16:13:09,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:13:10,024 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:10,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:13:10,365 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:10,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013419106] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:13:10,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:13:10,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-20 16:13:10,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235657378] [2022-11-20 16:13:10,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:13:10,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 16:13:10,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:13:10,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 16:13:10,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-20 16:13:10,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:10,373 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:13:10,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 21.055555555555557) internal successors, (379), 18 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:13:10,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:10,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:10,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:10,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:13:10,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:13:10,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:10,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:10,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:10,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:10,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:13:10,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:13:10,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:13:10,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-20 16:13:10,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:13:10,864 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 16:13:10,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:13:10,865 INFO L85 PathProgramCache]: Analyzing trace with hash 114823670, now seen corresponding path program 2 times [2022-11-20 16:13:10,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:13:10,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858715702] [2022-11-20 16:13:10,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:10,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:13:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:11,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:13:11,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858715702] [2022-11-20 16:13:11,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858715702] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:13:11,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526467338] [2022-11-20 16:13:11,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 16:13:11,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:13:11,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:13:11,917 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:13:11,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 16:13:12,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 16:13:12,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:13:12,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 16:13:12,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:13:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:12,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:13:13,370 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:13,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526467338] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:13:13,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:13:13,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-11-20 16:13:13,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841150384] [2022-11-20 16:13:13,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:13:13,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-20 16:13:13,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:13:13,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-20 16:13:13,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-11-20 16:13:13,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:13,377 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:13:13,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 18.441176470588236) internal successors, (627), 34 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:13:13,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:13,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:13,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:13,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:13:13,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:13:13,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:13:13,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:14,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:14,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:14,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:14,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:13:14,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:13:14,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:13:14,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-20 16:13:14,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 16:13:14,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-20 16:13:14,570 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 16:13:14,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:13:14,574 INFO L85 PathProgramCache]: Analyzing trace with hash -453147402, now seen corresponding path program 3 times [2022-11-20 16:13:14,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:13:14,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225877217] [2022-11-20 16:13:14,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:14,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:13:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:17,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:17,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:13:17,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225877217] [2022-11-20 16:13:17,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225877217] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:13:17,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290584347] [2022-11-20 16:13:17,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 16:13:17,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:13:17,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:13:17,615 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:13:17,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 16:13:18,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 16:13:18,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:13:18,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-20 16:13:18,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:13:22,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-20 16:13:22,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:13:22,255 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 16 treesize of output 18 [2022-11-20 16:13:22,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:13:22,680 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 16:13:22,681 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:13:22,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:13:22,801 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 23 treesize of output 22 [2022-11-20 16:13:22,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 774 proven. 0 refuted. 0 times theorem prover too weak. 2496 trivial. 0 not checked. [2022-11-20 16:13:22,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 16:13:22,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290584347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 16:13:22,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 16:13:22,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [33] total 44 [2022-11-20 16:13:22,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393996100] [2022-11-20 16:13:22,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 16:13:22,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 16:13:22,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:13:22,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 16:13:22,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1553, Unknown=0, NotChecked=0, Total=1892 [2022-11-20 16:13:22,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:22,957 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:13:22,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.384615384615383) internal successors, (226), 13 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:13:22,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:22,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:22,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:22,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:13:22,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:13:22,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:13:22,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-20 16:13:22,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:23,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:23,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:23,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:23,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:13:23,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:13:23,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:13:23,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-20 16:13:23,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 16:13:23,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 16:13:23,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:13:23,982 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 16:13:23,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:13:23,983 INFO L85 PathProgramCache]: Analyzing trace with hash 215597907, now seen corresponding path program 1 times [2022-11-20 16:13:23,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:13:23,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484190364] [2022-11-20 16:13:23,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:23,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:13:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3242 backedges. 0 proven. 3242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:26,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:13:26,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484190364] [2022-11-20 16:13:26,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484190364] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:13:26,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951198984] [2022-11-20 16:13:26,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:26,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:13:26,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:13:26,743 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:13:26,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 16:13:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:27,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 1324 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-20 16:13:27,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:13:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3242 backedges. 0 proven. 3242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:28,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:13:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3242 backedges. 0 proven. 3242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 16:13:30,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951198984] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:13:30,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:13:30,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2022-11-20 16:13:30,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392243516] [2022-11-20 16:13:30,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:13:30,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-20 16:13:30,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:13:30,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-20 16:13:30,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2022-11-20 16:13:30,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:30,075 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:13:30,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 19.023255813953487) internal successors, (818), 43 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:13:30,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:30,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:30,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:30,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:13:30,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:13:30,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:13:30,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-20 16:13:30,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-20 16:13:30,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:31,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:31,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:13:31,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:13:31,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:13:31,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-20 16:13:31,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 16:13:31,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-20 16:13:31,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 16:13:31,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 16:13:31,839 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 16:13:31,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:13:31,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1971247870, now seen corresponding path program 2 times [2022-11-20 16:13:31,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:13:31,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108776419] [2022-11-20 16:13:31,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:13:31,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:13:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:13:45,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 3527 proven. 43 refuted. 0 times theorem prover too weak. 2320 trivial. 0 not checked. [2022-11-20 16:13:45,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:13:45,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108776419] [2022-11-20 16:13:45,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108776419] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:13:45,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355147503] [2022-11-20 16:13:45,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 16:13:45,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:13:45,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:13:45,745 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:13:45,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 16:13:46,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 16:13:46,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:13:46,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 1659 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-20 16:13:46,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:13:49,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-20 16:13:49,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:13:49,630 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 16 treesize of output 18 [2022-11-20 16:13:50,056 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:13:50,069 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 16:13:50,070 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:13:50,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:13:50,163 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 23 treesize of output 22 [2022-11-20 16:13:50,466 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 31 treesize of output 15 [2022-11-20 16:13:50,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:13:50,636 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 16 treesize of output 18 [2022-11-20 16:13:50,975 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:13:50,988 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 16:13:50,988 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:13:51,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:13:51,050 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 23 treesize of output 22 [2022-11-20 16:13:51,107 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 19 treesize of output 7 [2022-11-20 16:13:51,177 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 3439 proven. 306 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2022-11-20 16:13:51,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:13:51,745 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1541 Int) (v_ArrVal_1540 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1541) .cse1)))))) is different from false [2022-11-20 16:13:51,844 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1541 Int) (v_ArrVal_1540 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1541) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| (select .cse0 .cse1)))))) is different from false [2022-11-20 16:13:51,865 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1541 Int) (v_ArrVal_1540 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1541) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| (select .cse0 .cse1)))))) is different from false [2022-11-20 16:13:51,885 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1541 Int) (v_ArrVal_1540 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1541) .cse1) 20))))) is different from false [2022-11-20 16:13:51,980 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1541 Int) (v_ArrVal_1540 (Array Int Int)) (v_ArrVal_1536 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1536) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1541) .cse1) 20))))) is different from false [2022-11-20 16:13:52,065 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1541 Int) (v_ArrVal_1540 (Array Int Int)) (v_ArrVal_1534 Int) (v_ArrVal_1536 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1534)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1536) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1541) .cse1)))))) is different from false [2022-11-20 16:13:52,110 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| (select .cse0 .cse1))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1541 Int) (v_ArrVal_1540 (Array Int Int)) (v_ArrVal_1534 Int) (v_ArrVal_1536 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1534))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1536) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1541) .cse3) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| (select .cse2 .cse3))))))))) is different from false [2022-11-20 16:13:52,183 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| Int) (v_ArrVal_1541 Int) (v_ArrVal_1540 (Array Int Int)) (v_ArrVal_1534 Int) (v_ArrVal_1536 Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1534))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1536) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_114| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| (select .cse2 .cse3))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1541) .cse3) 20)))))) is different from false [2022-11-20 16:13:53,061 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:13:53,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 209 treesize of output 149 [2022-11-20 16:13:53,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:13:53,081 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 275 treesize of output 273 [2022-11-20 16:13:53,092 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 269 treesize of output 257 [2022-11-20 16:13:53,106 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 257 treesize of output 241 [2022-11-20 16:13:53,132 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 8 treesize of output 4 [2022-11-20 16:13:53,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:13:53,290 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 97 treesize of output 89 [2022-11-20 16:13:54,475 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 3195 proven. 259 refuted. 0 times theorem prover too weak. 2172 trivial. 264 not checked. [2022-11-20 16:13:54,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355147503] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:13:54,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:13:54,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 22] total 56 [2022-11-20 16:13:54,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751975075] [2022-11-20 16:13:54,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:13:54,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-20 16:13:54,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:13:54,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-20 16:13:54,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=1902, Unknown=12, NotChecked=792, Total=3080 [2022-11-20 16:13:54,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:54,481 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:13:54,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 11.785714285714286) internal successors, (660), 56 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:13:54,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:13:54,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:54,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:13:54,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:13:54,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:13:54,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:13:54,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-20 16:13:54,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-20 16:13:54,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-20 16:13:54,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:14:00,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:14:00,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:14:00,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:14:00,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:14:00,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:14:00,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:14:00,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-20 16:14:00,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 16:14:00,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-20 16:14:00,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-20 16:14:00,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 16:14:00,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 16:14:00,955 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 16:14:00,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:14:00,955 INFO L85 PathProgramCache]: Analyzing trace with hash 760834217, now seen corresponding path program 3 times [2022-11-20 16:14:00,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:14:00,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988690375] [2022-11-20 16:14:00,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:14:00,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:14:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:14:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 4265 proven. 310 refuted. 0 times theorem prover too weak. 1605 trivial. 0 not checked. [2022-11-20 16:14:22,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:14:22,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988690375] [2022-11-20 16:14:22,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988690375] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:14:22,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359971937] [2022-11-20 16:14:22,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 16:14:22,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:14:22,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:14:22,291 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:14:22,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 16:16:09,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-11-20 16:16:09,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:16:09,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 148 conjunts are in the unsatisfiable core [2022-11-20 16:16:09,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:16:13,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-20 16:16:13,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:16:13,931 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 16 treesize of output 18 [2022-11-20 16:16:14,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:16:14,423 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:16:14,424 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 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-20 16:16:14,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:16:14,539 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 23 treesize of output 22 [2022-11-20 16:16:14,899 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 34 treesize of output 18 [2022-11-20 16:16:15,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:16:15,077 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 16 treesize of output 18 [2022-11-20 16:16:15,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:16:15,598 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:16:15,599 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 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-20 16:16:15,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:16:15,717 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 23 treesize of output 22 [2022-11-20 16:16:16,193 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 31 treesize of output 15 [2022-11-20 16:16:16,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:16:16,379 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 16 treesize of output 18 [2022-11-20 16:16:16,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:16:16,928 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:16:16,929 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 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-20 16:16:17,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:16:17,056 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 23 treesize of output 22 [2022-11-20 16:16:17,544 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 31 treesize of output 15 [2022-11-20 16:16:17,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:16:17,736 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 16 treesize of output 18 [2022-11-20 16:16:18,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:16:18,121 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:16:18,121 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 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-20 16:16:18,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:16:18,211 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 23 treesize of output 22 [2022-11-20 16:16:18,259 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 19 treesize of output 7 [2022-11-20 16:16:18,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 3349 proven. 488 refuted. 0 times theorem prover too weak. 2343 trivial. 0 not checked. [2022-11-20 16:16:18,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:16:19,198 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1945 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1945)) .cse1)) 20))) is different from false [2022-11-20 16:16:19,243 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1945 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_1945)) .cse1)) 20))) is different from false [2022-11-20 16:16:19,491 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1945 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1945)) .cse1)) 20))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2022-11-20 16:16:19,645 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1941 Int) (v_ArrVal_1945 Int)) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1941) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1945)) .cse2)) 20)))))) is different from false [2022-11-20 16:16:19,693 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1939 Int) (v_ArrVal_1941 Int) (v_ArrVal_1945 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1939)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1941) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1945)) .cse1)) 20)) (= 20 .cse4))))) is different from false [2022-11-20 16:16:19,714 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1939 Int) (v_ArrVal_1941 Int) (v_ArrVal_1945 Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1939)))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1941) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1945)) .cse1)))) (= .cse4 20)))))) is different from false [2022-11-20 16:16:19,750 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1939 Int) (v_ArrVal_1941 Int) (v_ArrVal_1945 Int)) (let ((.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse3 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse4) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1939)))) (let ((.cse0 (select .cse3 .cse4))) (or (= 20 .cse0) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1941) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1945)) .cse2)) 20))))))) is different from false [2022-11-20 16:16:20,018 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1939 Int) (v_ArrVal_1941 Int) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1945 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse3 (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* 4 (select .cse5 .cse1))) v_ArrVal_1939)))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1941) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1945)) .cse1))) (= 20 .cse4)))))) is different from false [2022-11-20 16:16:20,116 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1939 Int) (v_ArrVal_1941 Int) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1945 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_1939)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= 20 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1941) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1945)) .cse2)))))))) is different from false [2022-11-20 16:16:20,328 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1939 Int) (v_ArrVal_1941 Int) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1945 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1939)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1941) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1945)) .cse2) 20))))))) is different from false [2022-11-20 16:16:20,366 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1939 Int) (v_ArrVal_1941 Int) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1945 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1939)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1941) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1945)) .cse2) 20))))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2022-11-20 16:16:20,614 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1939 Int) (v_ArrVal_1941 Int) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1934 Int) (v_ArrVal_1945 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1934) .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse3 (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1939)))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1941) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1945)) .cse1))) (= .cse4 20)))))) (= .cse8 20)))) is different from false [2022-11-20 16:16:20,700 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1939 Int) (v_ArrVal_1941 Int) (v_ArrVal_1932 Int) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1934 Int) (v_ArrVal_1945 Int)) (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1932)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse7 .cse8))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1934) .cse8 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse4 (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1939)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1941) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1945)) .cse2) 20)) (= 20 .cse5)))))))) is different from false [2022-11-20 16:16:20,733 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1939 Int) (v_ArrVal_1941 Int) (v_ArrVal_1932 Int) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1934 Int) (v_ArrVal_1945 Int)) (let ((.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse9 (+ (* (select .cse9 .cse8) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1932)))) (let ((.cse0 (select .cse7 .cse8))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1934) .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse4 (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1939)))) (let ((.cse5 (select .cse4 .cse2))) (or (= 20 .cse0) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1941) .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1945)) .cse2) 20)) (= 20 .cse5))))))))) is different from false [2022-11-20 16:16:20,790 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1939 Int) (v_ArrVal_1941 Int) (v_ArrVal_1932 Int) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1934 Int) (v_ArrVal_1945 Int)) (let ((.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse9 (+ (* (select .cse9 .cse8) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1932)))) (let ((.cse1 (select .cse7 .cse8))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1934) .cse8 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse5 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* 4 (select .cse6 .cse3))) v_ArrVal_1939)))) (let ((.cse0 (select .cse5 .cse3))) (or (= .cse0 20) (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1941) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|) v_ArrVal_1945)) .cse3) 20)))))))))) is different from false [2022-11-20 16:16:21,222 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1939 Int) (v_ArrVal_1941 Int) (v_ArrVal_1932 Int) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1934 Int) (v_ArrVal_1945 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1930))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1932)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse9 .cse2))) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_1934) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse4 (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1939)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= 20 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1941) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1945)) .cse2))) (= .cse6 20))))))))) is different from false [2022-11-20 16:16:21,411 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1929 Int) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1939 Int) (v_ArrVal_1941 Int) (v_ArrVal_1932 Int) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1934 Int) (v_ArrVal_1945 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1929)) |c_~#stored_elements~0.base| v_ArrVal_1930))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1932)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse9 .cse1))) (let ((.cse2 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_1934) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse3 (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) v_ArrVal_1939)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (<= v_ArrVal_1929 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1941) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1945)) .cse1) 20)) (= .cse5 20) (= .cse6 20))))))))) is different from false [2022-11-20 16:16:21,451 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1929 Int) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1939 Int) (v_ArrVal_1941 Int) (v_ArrVal_1932 Int) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1934 Int) (v_ArrVal_1945 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1929)) |c_~#stored_elements~0.base| v_ArrVal_1930))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1932)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse9 .cse1))) (let ((.cse2 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_1934) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse3 (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) v_ArrVal_1939)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1941) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1945)) .cse1) 20)) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1929) (= .cse5 20) (= .cse6 20))))))))) is different from false [2022-11-20 16:16:21,491 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1929 Int) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1939 Int) (v_ArrVal_1941 Int) (v_ArrVal_1932 Int) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1934 Int) (v_ArrVal_1945 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_1929)) |c_~#stored_elements~0.base| v_ArrVal_1930))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1932)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse8 (select .cse11 .cse1))) (let ((.cse2 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse4 v_ArrVal_1934) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse3 (let ((.cse9 (select .cse2 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) v_ArrVal_1939)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1941) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1945)) .cse1) 20)) (= .cse5 20) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1929) (= .cse8 20)))))))))) is different from false [2022-11-20 16:16:21,696 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1926 Int) (v_ArrVal_1929 Int) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1939 Int) (v_ArrVal_1941 Int) (v_ArrVal_1932 Int) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1934 Int) (v_ArrVal_1945 Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1926) .cse8 v_ArrVal_1929)) |c_~#stored_elements~0.base| v_ArrVal_1930))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1932)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse11 .cse3))) (let ((.cse4 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_1934) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse5 (let ((.cse9 (select .cse4 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) v_ArrVal_1939)))) (let ((.cse1 (select .cse5 .cse3))) (or (= .cse0 20) (= 20 .cse1) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_1941) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1945)) .cse3) 20)) (< (+ (select .cse7 .cse8) 1) v_ArrVal_1929)))))))))) is different from false [2022-11-20 16:16:21,880 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1924 Int) (v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1926 Int) (v_ArrVal_1929 Int) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1939 Int) (v_ArrVal_1941 Int) (v_ArrVal_1932 Int) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1934 Int) (v_ArrVal_1945 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1924)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1926) .cse1 v_ArrVal_1929)) |c_~#stored_elements~0.base| v_ArrVal_1930))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* 4 (select .cse12 .cse4)) |c_~#queue~0.offset|) v_ArrVal_1932)))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse8 (select .cse11 .cse4))) (let ((.cse5 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse7 v_ArrVal_1934) .cse4 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse6 (let ((.cse9 (select .cse5 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1939)))) (let ((.cse2 (select .cse6 .cse4))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1929) (= .cse2 20) (not (= (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_1941) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1945)) .cse4) 20)) (= .cse8 20)))))))))) is different from false [2022-11-20 16:16:21,933 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1924 Int) (v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1926 Int) (v_ArrVal_1929 Int) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1939 Int) (v_ArrVal_1941 Int) (v_ArrVal_1932 Int) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1934 Int) (v_ArrVal_1945 Int)) (let ((.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse13 (+ (* (select .cse13 .cse8) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1924)))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1926) .cse8 v_ArrVal_1929)) |c_~#stored_elements~0.base| v_ArrVal_1930))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1932)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse11 .cse2))) (let ((.cse3 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse5 v_ArrVal_1934) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse4 (let ((.cse9 (select .cse3 |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1939)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= 20 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1941) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1945)) .cse2))) (= .cse6 20) (< (+ (select .cse7 .cse8) 1) v_ArrVal_1929))))))))))) is different from false [2022-11-20 16:16:22,036 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1924 Int) (v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1926 Int) (v_ArrVal_1929 Int) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1939 Int) (v_ArrVal_1941 Int) (v_ArrVal_1932 Int) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1934 Int) (v_ArrVal_1945 Int)) (let ((.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse7 (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse13 (+ (* (select .cse13 .cse8) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1924)))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1926) .cse8 v_ArrVal_1929)) |c_~#stored_elements~0.base| v_ArrVal_1930))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse2) 4)) v_ArrVal_1932)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse11 .cse2))) (let ((.cse3 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse5 v_ArrVal_1934) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse4 (let ((.cse9 (select .cse3 |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1939)))) (let ((.cse6 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1941) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1944) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1945)) .cse2) 20)) (= .cse6 20) (< (+ 1 (select .cse7 .cse8)) v_ArrVal_1929))))))))))) is different from false [2022-11-20 16:16:35,013 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:16:35,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5186 treesize of output 3316 [2022-11-20 16:16:35,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:16:35,068 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 2526 treesize of output 2476 [2022-11-20 16:16:35,098 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 1880 treesize of output 1784 [2022-11-20 16:16:35,144 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 1867 treesize of output 1855 [2022-11-20 16:16:35,211 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 2099 treesize of output 1971 [2022-11-20 16:16:35,254 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 2009 treesize of output 1889 [2022-11-20 16:16:35,349 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 8 treesize of output 4 [2022-11-20 16:16:35,408 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:16:35,408 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 485 treesize of output 477 [2022-11-20 16:16:43,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 868 proven. 1818 refuted. 205 times theorem prover too weak. 2215 trivial. 1074 not checked. [2022-11-20 16:16:43,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359971937] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:16:43,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:16:43,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34, 51] total 111 [2022-11-20 16:16:43,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911745598] [2022-11-20 16:16:43,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:16:43,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2022-11-20 16:16:43,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:16:43,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2022-11-20 16:16:43,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1209, Invalid=6448, Unknown=91, NotChecked=4462, Total=12210 [2022-11-20 16:16:43,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:43,135 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:16:43,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 111 states have (on average 8.594594594594595) internal successors, (954), 111 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:16:43,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:16:43,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:16:43,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:16:43,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:16:43,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:16:43,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:16:43,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-20 16:16:43,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-20 16:16:43,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-20 16:16:43,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-11-20 16:16:43,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:17:11,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:17:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:17:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:17:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:17:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:17:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:17:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-20 16:17:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 16:17:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-20 16:17:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-20 16:17:11,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-20 16:17:12,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 16:17:12,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 16:17:12,196 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 16:17:12,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 16:17:12,196 INFO L85 PathProgramCache]: Analyzing trace with hash 360428319, now seen corresponding path program 4 times [2022-11-20 16:17:12,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 16:17:12,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863486796] [2022-11-20 16:17:12,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 16:17:12,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 16:17:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 16:17:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6352 backedges. 4307 proven. 1132 refuted. 0 times theorem prover too weak. 913 trivial. 0 not checked. [2022-11-20 16:17:44,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 16:17:44,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863486796] [2022-11-20 16:17:44,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863486796] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 16:17:44,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234952115] [2022-11-20 16:17:44,727 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 16:17:44,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 16:17:44,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 [2022-11-20 16:17:44,729 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 16:17:44,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7d93a4-8b17-453e-9ef9-f71c9fab6094/bin/ugemcutter-CCe4ZdLeKS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 16:17:54,120 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 16:17:54,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 16:17:54,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 1694 conjuncts, 165 conjunts are in the unsatisfiable core [2022-11-20 16:17:54,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 16:17:56,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-20 16:17:57,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:17:57,045 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 16 treesize of output 18 [2022-11-20 16:17:57,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:17:57,460 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 16:17:57,460 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:17:57,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:17:57,561 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 23 treesize of output 22 [2022-11-20 16:17:57,906 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 34 treesize of output 18 [2022-11-20 16:17:58,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:17:58,066 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 16 treesize of output 18 [2022-11-20 16:17:58,549 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:17:58,562 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 16:17:58,562 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:17:58,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:17:58,683 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 23 treesize of output 22 [2022-11-20 16:17:59,064 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 34 treesize of output 18 [2022-11-20 16:17:59,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:17:59,238 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 16 treesize of output 18 [2022-11-20 16:17:59,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:17:59,788 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 16:17:59,789 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:17:59,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:17:59,906 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 23 treesize of output 22 [2022-11-20 16:18:00,311 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 34 treesize of output 18 [2022-11-20 16:18:00,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:18:00,490 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 16 treesize of output 18 [2022-11-20 16:18:01,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:18:01,046 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 16:18:01,046 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:18:01,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:18:01,178 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 23 treesize of output 22 [2022-11-20 16:18:01,595 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 34 treesize of output 18 [2022-11-20 16:18:01,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:18:01,790 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 16 treesize of output 18 [2022-11-20 16:18:02,313 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:18:02,325 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 16:18:02,325 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:18:02,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:18:02,451 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 23 treesize of output 22 [2022-11-20 16:18:02,838 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 34 treesize of output 18 [2022-11-20 16:18:03,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:18:03,034 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 16 treesize of output 18 [2022-11-20 16:18:03,605 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:18:03,618 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 16:18:03,619 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:18:03,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:18:03,733 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 23 treesize of output 22 [2022-11-20 16:18:04,183 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 34 treesize of output 18 [2022-11-20 16:18:04,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:18:04,382 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 16 treesize of output 18 [2022-11-20 16:18:04,974 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:18:04,988 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 16:18:04,988 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 16:18:05,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:18:05,139 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 23 treesize of output 22 [2022-11-20 16:18:05,579 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 34 treesize of output 18 [2022-11-20 16:18:05,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:18:05,800 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 16 treesize of output 18 [2022-11-20 16:18:06,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 16:18:06,125 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 16:18:06,126 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 27 [2022-11-20 16:18:06,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 16:18:06,184 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 21 treesize of output 20 [2022-11-20 16:18:06,207 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 15 treesize of output 7 [2022-11-20 16:18:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6352 backedges. 4089 proven. 1142 refuted. 0 times theorem prover too weak. 1121 trivial. 0 not checked. [2022-11-20 16:18:06,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 16:18:19,629 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2370 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2374 Int) (v_ArrVal_2376 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2370)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse0 .cse1))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2374))))) is different from false [2022-11-20 16:19:01,165 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2370 Int) (v_ArrVal_2373 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2374 Int) (v_ArrVal_2365 Int) (v_ArrVal_2367 Int) (v_ArrVal_2376 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse4 (store .cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2365) .cse3 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2374) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse2 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse5 .cse1))) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20)))))))) is different from false [2022-11-20 16:19:28,274 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2373 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2374 Int) (v_ArrVal_2365 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse0 .cse1))) (not (<= v_ArrVal_2360 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2374) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2367) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse6 .cse1))))))))))) is different from false [2022-11-20 16:19:28,336 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2373 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2374 Int) (v_ArrVal_2365 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2374) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2367) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2360) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse6 .cse1))))))))))) is different from false [2022-11-20 16:19:28,388 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2373 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2374 Int) (v_ArrVal_2365 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse3 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (store (store .cse3 .cse7 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2374) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2367) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2360) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse8 .cse1)))))))))))) is different from false [2022-11-20 16:19:28,698 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2373 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2374 Int) (v_ArrVal_2365 Int) (v_ArrVal_2367 Int) (v_ArrVal_2358 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2358) .cse7 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (store (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse2 v_ArrVal_2365) .cse3 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2373) .cse3 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse3) 20) (< (+ 1 (select .cse4 .cse3)) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse5 .cse3))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_2374) (< (+ (select .cse6 .cse7) 1) v_ArrVal_2360) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse8 .cse3)))))))))))) is different from false [2022-11-20 16:19:28,925 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2373 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2374 Int) (v_ArrVal_2365 Int) (v_ArrVal_2356 Int) (v_ArrVal_2367 Int) (v_ArrVal_2358 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int)) (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2356)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2358) .cse6 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (store (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_2365) .cse3 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse8 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2373) .cse3 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse3) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse4 .cse3))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_2374) (< (+ (select .cse5 .cse6) 1) v_ArrVal_2360) (< (+ (select .cse7 .cse3) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse8 .cse3)))))))))))) is different from false [2022-11-20 16:19:32,095 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2374 Int) (v_ArrVal_2365 Int) (v_ArrVal_2356 Int) (v_ArrVal_2367 Int) (v_ArrVal_2358 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse9 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2356)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2358) .cse8 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse10 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2374) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse7 .cse8))) (< (+ (select .cse9 .cse8) 1) v_ArrVal_2360))))))))))) is different from false [2022-11-20 16:19:51,850 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2374 Int) (v_ArrVal_2365 Int) (v_ArrVal_2356 Int) (v_ArrVal_2367 Int) (v_ArrVal_2358 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int)) (let ((.cse10 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse3 .cse8 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store (store .cse0 .cse8 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2360) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse5 .cse1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2374) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse8 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20)))))))))))) is different from false [2022-11-20 16:19:53,526 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2374 Int) (v_ArrVal_2354 Int) (v_ArrVal_2365 Int) (v_ArrVal_2356 Int) (v_ArrVal_2367 Int) (v_ArrVal_2358 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse3 .cse8 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse8 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse2 .cse1))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2354) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2360) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2374) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse5 .cse1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2367) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse8 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20)))))))))))) is different from false [2022-11-20 16:19:53,625 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2374 Int) (v_ArrVal_2354 Int) (v_ArrVal_2365 Int) (v_ArrVal_2356 Int) (v_ArrVal_2367 Int) (v_ArrVal_2358 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse2 (select .cse12 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse5 .cse10 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse0 (select .cse11 |c_~#queue~0.base|))) (let ((.cse8 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse9 (store (store .cse11 |c_~#queue~0.base| (store (store .cse8 .cse10 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2354) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2360) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2374) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse7 .cse1))) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2367) (< (select (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse10 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20))))))))))))) is different from false [2022-11-20 16:19:58,387 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int)) (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2374 Int) (v_ArrVal_2354 Int) (v_ArrVal_2365 Int) (v_ArrVal_2356 Int) (v_ArrVal_2367 Int) (v_ArrVal_2358 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse4 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2349))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2351) .cse5 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse6 (select .cse12 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_2358) .cse3 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse10 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse0 (store (store .cse11 |c_~#queue~0.base| (store (store .cse10 .cse2 v_ArrVal_2365) .cse3 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse9 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2373) .cse3 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse3) 20) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2354) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse6 .cse3))) (< (+ (select .cse7 .cse3) 1) v_ArrVal_2360) (< (+ (select .cse1 .cse3) 1) v_ArrVal_2374) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse8 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse9 .cse3))) (< (+ (select .cse10 .cse3) 1) v_ArrVal_2367))))))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse13 .cse5)))))) is different from false [2022-11-20 16:19:58,607 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2354 Int) (v_ArrVal_2365 Int) (v_ArrVal_2356 Int) (v_ArrVal_2367 Int) (v_ArrVal_2358 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2349)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2351) .cse4 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse5 (select .cse13 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse2 .cse11 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse7 (select .cse12 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store (store .cse8 .cse11 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse10 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2360) (< (+ 1 (select .cse3 .cse4)) v_ArrVal_2354) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse6 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse7 .cse1))) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2367) (< (select (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse11 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse10 .cse1) 1) v_ArrVal_2374)))))))))))))) is different from false [2022-11-20 16:20:38,138 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2354 Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2356 Int) (v_ArrVal_2367 Int) (v_ArrVal_2358 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse0 (select .cse13 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse5 .cse7 v_ArrVal_2351) .cse1 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse9 (select .cse12 |c_~#queue~0.base|))) (let ((.cse4 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse4 .cse7 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse10 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse6 (store (store .cse11 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2374) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2360) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2354) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (not (<= v_ArrVal_2346 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse8 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse9 .cse1))) (< (+ (select .cse10 .cse1) 1) v_ArrVal_2367))))))))))))))) is different from false [2022-11-20 16:20:38,272 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2354 Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2356 Int) (v_ArrVal_2367 Int) (v_ArrVal_2358 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse0 (select .cse13 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse5 .cse7 v_ArrVal_2351) .cse1 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse9 (select .cse12 |c_~#queue~0.base|))) (let ((.cse4 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse4 .cse7 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse10 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse6 (store (store .cse11 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2374) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2360) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2354) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2346) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse8 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse9 .cse1))) (< (+ (select .cse10 .cse1) 1) v_ArrVal_2367))))))))))))))) is different from false [2022-11-20 16:20:38,422 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2354 Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2356 Int) (v_ArrVal_2367 Int) (v_ArrVal_2358 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse15 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse0 (select .cse15 |c_~#queue~0.base|))) (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse7 .cse9 v_ArrVal_2351) .cse1 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse11 (select .cse14 |c_~#queue~0.base|))) (let ((.cse6 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse13 (store (store .cse14 |c_~#queue~0.base| (store (store .cse6 .cse9 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse10 (select .cse13 |c_~#queue~0.base|))) (let ((.cse12 (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse8 (store (store .cse13 |c_~#queue~0.base| (store (store .cse12 .cse9 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2346) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2374) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse5 .cse1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2360) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2354) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse9 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse10 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse11 .cse1))) (< (+ (select .cse12 .cse1) 1) v_ArrVal_2367)))))))))))))))) is different from false [2022-11-20 16:20:39,201 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2354 Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2345 Int) (v_ArrVal_2356 Int) (v_ArrVal_2367 Int) (v_ArrVal_2358 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse15 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2345) .cse1 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse2 (select .cse15 |c_~#queue~0.base|))) (let ((.cse11 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse11 .cse8 v_ArrVal_2351) .cse3 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse4 (select .cse14 |c_~#queue~0.base|))) (let ((.cse9 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse13 (store (store .cse14 |c_~#queue~0.base| (store (store .cse9 .cse8 v_ArrVal_2358) .cse3 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse10 (select .cse13 |c_~#queue~0.base|))) (let ((.cse12 (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse6 (store (store .cse13 |c_~#queue~0.base| (store (store .cse12 .cse8 v_ArrVal_2365) .cse3 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2346) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse5 .cse3))) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_2373) .cse3 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse3) 20) (< (+ (select .cse9 .cse3) 1) v_ArrVal_2360) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse10 .cse3))) (< (+ (select .cse11 .cse3) 1) v_ArrVal_2354) (< (+ (select .cse12 .cse3) 1) v_ArrVal_2367) (< (+ (select .cse7 .cse3) 1) v_ArrVal_2374)))))))))))))))) is different from false [2022-11-20 16:20:39,745 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2354 Int) (v_ArrVal_2356 Int) (v_ArrVal_2358 Int) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2342 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2345 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse10 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2342)) (.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse15 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2345) .cse11 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse4 (select .cse15 |c_~#queue~0.base|))) (let ((.cse9 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse9 .cse2 v_ArrVal_2351) .cse3 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse5 (select .cse14 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse13 (store (store .cse14 |c_~#queue~0.base| (store (store .cse6 .cse2 v_ArrVal_2358) .cse3 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse12 (select .cse13 |c_~#queue~0.base|))) (let ((.cse7 (store .cse12 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse0 (store (store .cse13 |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_2365) .cse3 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse8 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2373) .cse3 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse3) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse5 .cse3))) (< (+ 1 (select .cse6 .cse3)) v_ArrVal_2360) (< (+ 1 (select .cse7 .cse3)) v_ArrVal_2367) (< (+ (select .cse1 .cse3) 1) v_ArrVal_2374) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse8 .cse3))) (< (+ (select .cse9 .cse3) 1) v_ArrVal_2354) (< (+ (select .cse10 .cse11) 1) v_ArrVal_2346) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse12 .cse3)))))))))))))))))) is different from false [2022-11-20 16:20:39,971 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse0 .cse1))) (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2354 Int) (v_ArrVal_2356 Int) (v_ArrVal_2358 Int) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2342 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2345 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse9 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2342))) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2345) .cse1 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse11 (select .cse16 |c_~#queue~0.base|))) (let ((.cse8 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_2351) .cse5 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse13 (select .cse15 |c_~#queue~0.base|))) (let ((.cse6 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_2358) .cse5 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse10 (select .cse14 |c_~#queue~0.base|))) (let ((.cse12 (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse2 (store (store .cse14 |c_~#queue~0.base| (store (store .cse12 .cse4 v_ArrVal_2365) .cse5 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2373) .cse5 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse5) 20) (< (+ (select .cse6 .cse5) 1) v_ArrVal_2360) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse7 .cse5))) (< (+ (select .cse3 .cse5) 1) v_ArrVal_2374) (< (+ 1 (select .cse8 .cse5)) v_ArrVal_2354) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2346) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse10 .cse5))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse11 .cse5))) (< (+ (select .cse12 .cse5) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse13 .cse5))))))))))))))))))))) is different from false [2022-11-20 16:20:40,372 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2354 Int) (v_ArrVal_2356 Int) (v_ArrVal_2358 Int) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2342 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2345 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse9 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2342)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2345) .cse4 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse0 (select .cse16 |c_~#queue~0.base|))) (let ((.cse12 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse12 .cse11 v_ArrVal_2351) .cse1 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse7 (select .cse15 |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse2 .cse11 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse13 (select .cse14 |c_~#queue~0.base|))) (let ((.cse6 (store .cse13 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse10 (store (store .cse14 |c_~#queue~0.base| (store (store .cse6 .cse11 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse5 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse0 .cse1))) (< (+ 1 (select .cse2 .cse1)) v_ArrVal_2360) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse5 .cse1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse7 .cse1))) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2374) (< (+ (select .cse9 .cse4) 1) v_ArrVal_2346) (< (select (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse8 .cse11 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse12 .cse1) 1) v_ArrVal_2354) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse13 .cse1))))))))))))))))))) is different from false [2022-11-20 16:21:14,436 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2354 Int) (v_ArrVal_2356 Int) (v_ArrVal_2358 Int) (v_ArrVal_2339 Int) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2342 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2345 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2339)) |c_~#stored_elements~0.base| v_ArrVal_2341))) (let ((.cse9 (select .cse16 |c_~#queue~0.base|))) (let ((.cse5 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2342)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse5 .cse8 v_ArrVal_2345) .cse1 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse12 (select .cse15 |c_~#queue~0.base|))) (let ((.cse11 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse11 .cse8 v_ArrVal_2351) .cse1 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse10 (select .cse14 |c_~#queue~0.base|))) (let ((.cse4 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse13 (store (store .cse14 |c_~#queue~0.base| (store (store .cse4 .cse8 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse3 (select .cse13 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse7 (store (store .cse13 |c_~#queue~0.base| (store (store .cse0 .cse8 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2360) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2346) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2374) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse8 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (not (<= v_ArrVal_2339 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse9 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse10 .cse1))) (< (+ (select .cse11 .cse1) 1) v_ArrVal_2354) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse12 .cse1)))))))))))))))))))) is different from false [2022-11-20 16:21:15,538 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2354 Int) (v_ArrVal_2356 Int) (v_ArrVal_2358 Int) (v_ArrVal_2339 Int) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2342 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2345 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse11 .cse12 v_ArrVal_2339)) |c_~#stored_elements~0.base| v_ArrVal_2341))) (let ((.cse9 (select .cse18 |c_~#queue~0.base|))) (let ((.cse5 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2342)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse5 .cse8 v_ArrVal_2345) .cse1 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse14 (select .cse17 |c_~#queue~0.base|))) (let ((.cse13 (store .cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse13 .cse8 v_ArrVal_2351) .cse1 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse10 (select .cse16 |c_~#queue~0.base|))) (let ((.cse4 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse4 .cse8 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse3 (select .cse15 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse7 (store (store .cse15 |c_~#queue~0.base| (store (store .cse0 .cse8 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2360) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2346) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2374) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse8 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse9 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse10 .cse1))) (< (+ (select .cse11 .cse12) 1) v_ArrVal_2339) (< (+ (select .cse13 .cse1) 1) v_ArrVal_2354) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse14 .cse1))))))))))))))))))))) is different from false [2022-11-20 16:21:16,525 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2354 Int) (v_ArrVal_2356 Int) (v_ArrVal_2337 Int) (v_ArrVal_2358 Int) (v_ArrVal_2339 Int) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2342 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2345 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2337) .cse13 v_ArrVal_2339)) |c_~#stored_elements~0.base| v_ArrVal_2341))) (let ((.cse3 (select .cse18 |c_~#queue~0.base|))) (let ((.cse11 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2342)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse11 .cse9 v_ArrVal_2345) .cse1 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse10 (select .cse17 |c_~#queue~0.base|))) (let ((.cse5 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_2351) .cse1 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse0 (select .cse16 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse2 .cse9 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse6 (select .cse15 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse8 (store (store .cse15 |c_~#queue~0.base| (store (store .cse4 .cse9 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse14 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (store .cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2360) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2367) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2354) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse6 .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2374) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse9 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse10 .cse1))) (< (+ (select .cse11 .cse1) 1) v_ArrVal_2346) (< (+ (select .cse12 .cse13) 1) v_ArrVal_2339) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse14 .cse1))))))))))))))))))))) is different from false [2022-11-20 16:21:17,269 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2354 Int) (v_ArrVal_2356 Int) (v_ArrVal_2337 Int) (v_ArrVal_2336 Int) (v_ArrVal_2358 Int) (v_ArrVal_2339 Int) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2342 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2345 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse8 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2336)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2337) .cse9 v_ArrVal_2339)) |c_~#stored_elements~0.base| v_ArrVal_2341))) (let ((.cse6 (select .cse18 |c_~#queue~0.base|))) (let ((.cse10 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2342)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse10 .cse2 v_ArrVal_2345) .cse3 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse5 (select .cse17 |c_~#queue~0.base|))) (let ((.cse11 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse11 .cse2 v_ArrVal_2351) .cse3 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse4 (select .cse16 |c_~#queue~0.base|))) (let ((.cse13 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse13 .cse2 v_ArrVal_2358) .cse3 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse14 (select .cse15 |c_~#queue~0.base|))) (let ((.cse7 (store .cse14 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse0 (store (store .cse15 |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_2365) .cse3 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse12 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2373) .cse3 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse3) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse4 .cse3))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_2374) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse5 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse6 .cse3))) (< (+ (select .cse7 .cse3) 1) v_ArrVal_2367) (< (+ (select .cse8 .cse9) 1) v_ArrVal_2339) (< (+ (select .cse10 .cse3) 1) v_ArrVal_2346) (< (+ (select .cse11 .cse3) 1) v_ArrVal_2354) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse12 .cse3))) (< (+ (select .cse13 .cse3) 1) v_ArrVal_2360) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse14 .cse3))))))))))))))))))))) is different from false [2022-11-20 16:21:17,558 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int)) (let ((.cse19 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2354 Int) (v_ArrVal_2356 Int) (v_ArrVal_2337 Int) (v_ArrVal_2336 Int) (v_ArrVal_2358 Int) (v_ArrVal_2339 Int) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2342 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2345 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse10 (store .cse19 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2336))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2337) .cse11 v_ArrVal_2339)) |c_~#stored_elements~0.base| v_ArrVal_2341))) (let ((.cse12 (select .cse18 |c_~#queue~0.base|))) (let ((.cse14 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2342)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse14 .cse8 v_ArrVal_2345) .cse1 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse5 (select .cse17 |c_~#queue~0.base|))) (let ((.cse13 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse13 .cse8 v_ArrVal_2351) .cse1 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse3 (select .cse16 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse0 .cse8 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse6 (select .cse15 |c_~#queue~0.base|))) (let ((.cse2 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse7 (store (store .cse15 |c_~#queue~0.base| (store (store .cse2 .cse8 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2360) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2374) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse6 .cse1))) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse8 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse9 .cse1))) (< (+ (select .cse10 .cse11) 1) v_ArrVal_2339) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse12 .cse1))) (< (+ (select .cse13 .cse1) 1) v_ArrVal_2354) (< (+ (select .cse14 .cse1) 1) v_ArrVal_2346))))))))))))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse19 .cse11)))))) is different from false [2022-11-20 16:21:18,077 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2356 Int) (v_ArrVal_2337 Int) (v_ArrVal_2336 Int) (v_ArrVal_2358 Int) (v_ArrVal_2339 Int) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2342 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2345 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse14 (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2336)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse19 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse14 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2337) .cse1 v_ArrVal_2339)) |c_~#stored_elements~0.base| v_ArrVal_2341))) (let ((.cse2 (select .cse19 |c_~#queue~0.base|))) (let ((.cse10 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2342)) (.cse13 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse10 .cse13 v_ArrVal_2345) .cse3 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse9 (select .cse18 |c_~#queue~0.base|))) (let ((.cse8 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse8 .cse13 v_ArrVal_2351) .cse3 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse15 (select .cse17 |c_~#queue~0.base|))) (let ((.cse11 (store .cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse11 .cse13 v_ArrVal_2358) .cse3 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse5 (select .cse16 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse12 (store (store .cse16 |c_~#queue~0.base| (store (store .cse6 .cse13 v_ArrVal_2365) .cse3 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse7 (select .cse12 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse2 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_2374) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse5 .cse3))) (< (+ (select .cse6 .cse3) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse7 .cse3))) (< (+ (select .cse8 .cse3) 1) v_ArrVal_2354) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse9 .cse3))) (< (+ (select .cse10 .cse3) 1) v_ArrVal_2346) (< (+ (select .cse11 .cse3) 1) v_ArrVal_2360) (< (select (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse4 .cse13 v_ArrVal_2373) .cse3 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse3) 20) (< (+ (select .cse14 .cse1) 1) v_ArrVal_2339) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse15 .cse3)))))))))))))))))))))) is different from false [2022-11-20 16:21:52,165 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2356 Int) (v_ArrVal_2337 Int) (v_ArrVal_2336 Int) (v_ArrVal_2358 Int) (v_ArrVal_2339 Int) (v_ArrVal_2334 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2342 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2345 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse19 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2334))) (let ((.cse5 (select .cse19 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2336)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse7 .cse10 v_ArrVal_2337) .cse1 v_ArrVal_2339)) |c_~#stored_elements~0.base| v_ArrVal_2341))) (let ((.cse12 (select .cse18 |c_~#queue~0.base|))) (let ((.cse2 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2342))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse2 .cse10 v_ArrVal_2345) .cse1 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse13 (select .cse17 |c_~#queue~0.base|))) (let ((.cse11 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse11 .cse10 v_ArrVal_2351) .cse1 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse0 (select .cse16 |c_~#queue~0.base|))) (let ((.cse14 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse14 .cse10 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse6 (select .cse15 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse8 (store (store .cse15 |c_~#queue~0.base| (store (store .cse4 .cse10 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse9 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2346) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse6 .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2339) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse10 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse11 .cse1) 1) v_ArrVal_2354) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2374) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse12 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse13 .cse1))) (< (+ (select .cse14 .cse1) 1) v_ArrVal_2360))))))))))))))))))))) is different from false [2022-11-20 16:21:53,724 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2332 Int) (v_ArrVal_2354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2356 Int) (v_ArrVal_2337 Int) (v_ArrVal_2336 Int) (v_ArrVal_2358 Int) (v_ArrVal_2339 Int) (v_ArrVal_2334 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2342 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2345 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse19 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2332)) |c_~#stored_elements~0.base| v_ArrVal_2334))) (let ((.cse14 (select .cse19 |c_~#queue~0.base|))) (let ((.cse4 (store .cse14 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2336)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse4 .cse2 v_ArrVal_2337) .cse3 v_ArrVal_2339)) |c_~#stored_elements~0.base| v_ArrVal_2341))) (let ((.cse5 (select .cse18 |c_~#queue~0.base|))) (let ((.cse10 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2342))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse10 .cse2 v_ArrVal_2345) .cse3 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse12 (select .cse17 |c_~#queue~0.base|))) (let ((.cse13 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse13 .cse2 v_ArrVal_2351) .cse3 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse7 (select .cse16 |c_~#queue~0.base|))) (let ((.cse11 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse11 .cse2 v_ArrVal_2358) .cse3 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse6 (select .cse15 |c_~#queue~0.base|))) (let ((.cse8 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse0 (store (store .cse15 |c_~#queue~0.base| (store (store .cse8 .cse2 v_ArrVal_2365) .cse3 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse9 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2373) .cse3 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse3) 20) (< (+ (select .cse4 .cse3) 1) v_ArrVal_2339) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse5 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse6 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse7 .cse3))) (not (<= v_ArrVal_2332 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_2374) (< (+ (select .cse8 .cse3) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse9 .cse3))) (< (+ (select .cse10 .cse3) 1) v_ArrVal_2346) (< (+ (select .cse11 .cse3) 1) v_ArrVal_2360) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse12 .cse3))) (< (+ (select .cse13 .cse3) 1) v_ArrVal_2354) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse14 .cse3))))))))))))))))))))))) is different from false [2022-11-20 16:21:53,988 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2332 Int) (v_ArrVal_2354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2356 Int) (v_ArrVal_2337 Int) (v_ArrVal_2336 Int) (v_ArrVal_2358 Int) (v_ArrVal_2339 Int) (v_ArrVal_2334 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2342 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2345 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse19 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2332)) |c_~#stored_elements~0.base| v_ArrVal_2334))) (let ((.cse14 (select .cse19 |c_~#queue~0.base|))) (let ((.cse4 (store .cse14 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2336)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse4 .cse2 v_ArrVal_2337) .cse3 v_ArrVal_2339)) |c_~#stored_elements~0.base| v_ArrVal_2341))) (let ((.cse5 (select .cse18 |c_~#queue~0.base|))) (let ((.cse10 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2342))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse10 .cse2 v_ArrVal_2345) .cse3 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse12 (select .cse17 |c_~#queue~0.base|))) (let ((.cse13 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse13 .cse2 v_ArrVal_2351) .cse3 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse7 (select .cse16 |c_~#queue~0.base|))) (let ((.cse11 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse11 .cse2 v_ArrVal_2358) .cse3 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse6 (select .cse15 |c_~#queue~0.base|))) (let ((.cse8 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse0 (store (store .cse15 |c_~#queue~0.base| (store (store .cse8 .cse2 v_ArrVal_2365) .cse3 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse9 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2332) (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2373) .cse3 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse3) 20) (< (+ (select .cse4 .cse3) 1) v_ArrVal_2339) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse5 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse6 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse7 .cse3))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_2374) (< (+ (select .cse8 .cse3) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse9 .cse3))) (< (+ (select .cse10 .cse3) 1) v_ArrVal_2346) (< (+ (select .cse11 .cse3) 1) v_ArrVal_2360) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse12 .cse3))) (< (+ (select .cse13 .cse3) 1) v_ArrVal_2354) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse14 .cse3))))))))))))))))))))))) is different from false [2022-11-20 16:21:54,220 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2332 Int) (v_ArrVal_2354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2356 Int) (v_ArrVal_2337 Int) (v_ArrVal_2336 Int) (v_ArrVal_2358 Int) (v_ArrVal_2339 Int) (v_ArrVal_2334 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2342 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2345 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse16 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse21 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse15 .cse16 v_ArrVal_2332)) |c_~#stored_elements~0.base| v_ArrVal_2334))) (let ((.cse14 (select .cse21 |c_~#queue~0.base|))) (let ((.cse4 (store .cse14 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2336)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse20 (store (store .cse21 |c_~#queue~0.base| (store (store .cse4 .cse2 v_ArrVal_2337) .cse3 v_ArrVal_2339)) |c_~#stored_elements~0.base| v_ArrVal_2341))) (let ((.cse5 (select .cse20 |c_~#queue~0.base|))) (let ((.cse10 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2342))) (let ((.cse19 (store (store .cse20 |c_~#queue~0.base| (store (store .cse10 .cse2 v_ArrVal_2345) .cse3 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse12 (select .cse19 |c_~#queue~0.base|))) (let ((.cse13 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse13 .cse2 v_ArrVal_2351) .cse3 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse7 (select .cse18 |c_~#queue~0.base|))) (let ((.cse11 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse11 .cse2 v_ArrVal_2358) .cse3 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse6 (select .cse17 |c_~#queue~0.base|))) (let ((.cse8 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse0 (store (store .cse17 |c_~#queue~0.base| (store (store .cse8 .cse2 v_ArrVal_2365) .cse3 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse9 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2373) .cse3 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse3) 20) (< (+ (select .cse4 .cse3) 1) v_ArrVal_2339) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse5 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse6 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse7 .cse3))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_2374) (< (+ (select .cse8 .cse3) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse9 .cse3))) (< (+ (select .cse10 .cse3) 1) v_ArrVal_2346) (< (+ (select .cse11 .cse3) 1) v_ArrVal_2360) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse12 .cse3))) (< (+ (select .cse13 .cse3) 1) v_ArrVal_2354) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse14 .cse3))) (< (+ (select .cse15 .cse16) 1) v_ArrVal_2332)))))))))))))))))))))) is different from false [2022-11-20 16:22:00,039 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2330 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2332 Int) (v_ArrVal_2354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2356 Int) (v_ArrVal_2337 Int) (v_ArrVal_2336 Int) (v_ArrVal_2358 Int) (v_ArrVal_2339 Int) (v_ArrVal_2334 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2342 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2345 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2328 Int) (v_ArrVal_2349 Int)) (let ((.cse8 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2328)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse21 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2330) .cse9 v_ArrVal_2332)) |c_~#stored_elements~0.base| v_ArrVal_2334))) (let ((.cse14 (select .cse21 |c_~#queue~0.base|))) (let ((.cse7 (store .cse14 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2336)) (.cse12 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse20 (store (store .cse21 |c_~#queue~0.base| (store (store .cse7 .cse12 v_ArrVal_2337) .cse1 v_ArrVal_2339)) |c_~#stored_elements~0.base| v_ArrVal_2341))) (let ((.cse16 (select .cse20 |c_~#queue~0.base|))) (let ((.cse13 (store .cse16 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2342))) (let ((.cse19 (store (store .cse20 |c_~#queue~0.base| (store (store .cse13 .cse12 v_ArrVal_2345) .cse1 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse15 (select .cse19 |c_~#queue~0.base|))) (let ((.cse4 (store .cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse4 .cse12 v_ArrVal_2351) .cse1 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse10 (select .cse18 |c_~#queue~0.base|))) (let ((.cse5 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse5 .cse12 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse3 (select .cse17 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse11 (store (store .cse17 |c_~#queue~0.base| (store (store .cse0 .cse12 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse2 (select .cse11 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2354) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2360) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2374) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2339) (< (+ 1 (select .cse8 .cse9)) v_ArrVal_2332) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse10 .cse1))) (< (select (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse6 .cse12 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse13 .cse1) 1) v_ArrVal_2346) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse14 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse15 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse16 .cse1)))))))))))))))))))))))) is different from false [2022-11-20 16:22:08,179 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2330 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2332 Int) (v_ArrVal_2354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2356 Int) (v_ArrVal_2337 Int) (v_ArrVal_2336 Int) (v_ArrVal_2358 Int) (v_ArrVal_2339 Int) (v_ArrVal_2334 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2360 Int) (v_ArrVal_2342 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2345 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2328 Int) (v_ArrVal_2349 Int)) (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse9 (store .cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2328)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse22 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2330) .cse10 v_ArrVal_2332)) |c_~#stored_elements~0.base| v_ArrVal_2334))) (let ((.cse11 (select .cse22 |c_~#queue~0.base|))) (let ((.cse2 (store .cse11 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2336)) (.cse17 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse21 (store (store .cse22 |c_~#queue~0.base| (store (store .cse2 .cse17 v_ArrVal_2337) .cse1 v_ArrVal_2339)) |c_~#stored_elements~0.base| v_ArrVal_2341))) (let ((.cse6 (select .cse21 |c_~#queue~0.base|))) (let ((.cse12 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2342))) (let ((.cse20 (store (store .cse21 |c_~#queue~0.base| (store (store .cse12 .cse17 v_ArrVal_2345) .cse1 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse5 (select .cse20 |c_~#queue~0.base|))) (let ((.cse13 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349))) (let ((.cse19 (store (store .cse20 |c_~#queue~0.base| (store (store .cse13 .cse17 v_ArrVal_2351) .cse1 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse3 (select .cse19 |c_~#queue~0.base|))) (let ((.cse7 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse7 .cse17 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse8 (select .cse18 |c_~#queue~0.base|))) (let ((.cse0 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse16 (store (store .cse18 |c_~#queue~0.base| (store (store .cse0 .cse17 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse4 (select .cse16 |c_~#queue~0.base|))) (let ((.cse15 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2367) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2339) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse6 .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2360) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse8 .cse1))) (< (+ (select .cse9 .cse10) 1) v_ArrVal_2332) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse11 .cse1))) (< (+ (select .cse12 .cse1) 1) v_ArrVal_2346) (< (+ (select .cse13 .cse1) 1) v_ArrVal_2354) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| (select .cse14 .cse10))) (< (+ (select .cse15 .cse1) 1) v_ArrVal_2374) (< (select (select (store (store .cse16 |c_~#queue~0.base| (store (store .cse15 .cse17 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20))))))))))))))))))))))) is different from false [2022-11-20 16:22:56,527 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:22:56,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14347 treesize of output 10537 [2022-11-20 16:23:00,579 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:23:00,580 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 18461 treesize of output 18451 [2022-11-20 16:23:00,700 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 8266 treesize of output 7754 [2022-11-20 16:23:00,874 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 5286 treesize of output 5278 [2022-11-20 16:23:01,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 9618 treesize of output 9362 [2022-11-20 16:23:01,169 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 9881 treesize of output 9753 [2022-11-20 16:23:01,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 9633 treesize of output 9569 [2022-11-20 16:23:01,466 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 9242 treesize of output 9210 [2022-11-20 16:23:01,597 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 8874 treesize of output 8858 [2022-11-20 16:23:01,713 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 3830 treesize of output 3318 [2022-11-20 16:23:01,870 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 8 treesize of output 4 [2022-11-20 16:23:02,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 16:23:02,636 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 4165 treesize of output 4161 [2022-11-20 16:24:00,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6352 backedges. 2419 proven. 548 refuted. 957 times theorem prover too weak. 1121 trivial. 1307 not checked. [2022-11-20 16:24:00,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234952115] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 16:24:00,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 16:24:00,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 54, 75] total 184 [2022-11-20 16:24:00,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888090192] [2022-11-20 16:24:00,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 16:24:00,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 184 states [2022-11-20 16:24:00,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 16:24:00,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2022-11-20 16:24:00,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3961, Invalid=18411, Unknown=708, NotChecked=10592, Total=33672 [2022-11-20 16:24:00,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:00,463 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-20 16:24:00,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 184 states, 184 states have (on average 7.086956521739131) internal successors, (1304), 184 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 16:24:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:24:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:24:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-20 16:24:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-20 16:24:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-20 16:24:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-20 16:24:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-20 16:24:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-20 16:24:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-20 16:24:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-11-20 16:24:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2022-11-20 16:24:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-20 16:25:24,177 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse14 (select .cse11 .cse13)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse27 (select .cse9 84)) (.cse2 (select .cse9 .cse4)) (.cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse10 (+ .cse14 1)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse12 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (<= |c_~#stored_elements~0.base| 4) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (forall ((v_ArrVal_2370 Int) (v_ArrVal_2373 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2374 Int) (v_ArrVal_2365 Int) (v_ArrVal_2367 Int) (v_ArrVal_2376 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int)) (let ((.cse3 (store .cse9 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 .cse8 v_ArrVal_2365) .cse4 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2374) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| .cse2)) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse5 .cse1))) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse7 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_2373 Int) (v_ArrVal_2374 Int) (v_ArrVal_2376 (Array Int Int))) (or (< .cse10 v_ArrVal_2374) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 .cse12 v_ArrVal_2373) .cse13 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| .cse14)) (forall ((v_ArrVal_2370 Int) (v_ArrVal_2373 Int) (v_ArrVal_2374 Int) (v_ArrVal_2376 (Array Int Int))) (let ((.cse15 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2370))) (or (< (+ (select .cse15 .cse13) 1) v_ArrVal_2374) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse15 .cse12 v_ArrVal_2373) .cse13 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2354 Int) (v_ArrVal_2365 Int) (v_ArrVal_2356 Int) (v_ArrVal_2367 Int) (v_ArrVal_2358 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse18 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2349))) (let ((.cse25 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse18 .cse8 v_ArrVal_2351) .cse4 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse19 (select .cse25 |c_~#queue~0.base|))) (let ((.cse17 (store .cse19 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse24 (store (store .cse25 |c_~#queue~0.base| (store (store .cse17 .cse7 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse20 (select .cse24 |c_~#queue~0.base|))) (let ((.cse21 (store .cse20 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse22 (store (store .cse24 |c_~#queue~0.base| (store (store .cse21 .cse7 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse16 (select .cse22 |c_~#queue~0.base|))) (let ((.cse23 (store .cse16 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse16 .cse1))) (< (+ (select .cse17 .cse1) 1) v_ArrVal_2360) (< (+ 1 (select .cse18 .cse4)) v_ArrVal_2354) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse19 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| .cse2)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse20 .cse1))) (< (+ (select .cse21 .cse1) 1) v_ArrVal_2367) (< (select (select (store (store .cse22 |c_~#queue~0.base| (store (store .cse23 .cse7 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse23 .cse1) 1) v_ArrVal_2374))))))))))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| 5) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_2370 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2374 Int) (v_ArrVal_2376 (Array Int Int))) (let ((.cse26 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2370))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| .cse2)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse26 .cse8 v_ArrVal_2373) .cse4 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse26 .cse4) 1) v_ArrVal_2374)))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= 5 |c_~#queue~0.base|) (<= (* .cse27 4) 32) (forall ((v_ArrVal_2370 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2374 Int) (v_ArrVal_2365 Int) (v_ArrVal_2367 Int) (v_ArrVal_2376 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 .cse12 v_ArrVal_2365) .cse13 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse29 (select .cse30 |c_~#queue~0.base|))) (let ((.cse28 (store .cse29 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (+ (select .cse28 .cse1) 1) v_ArrVal_2374) (< .cse10 v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse29 .cse1))) (< (select (select (store (store .cse30 |c_~#queue~0.base| (store (store .cse28 .cse7 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (* .cse14 4) (+ 32 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (= 5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int)) (or (forall ((v_ArrVal_2370 Int) (v_ArrVal_2373 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2374 Int) (v_ArrVal_2365 Int) (v_ArrVal_2367 Int) (v_ArrVal_2376 (Array Int Int))) (let ((.cse33 (store .cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse31 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse33 .cse12 v_ArrVal_2365) .cse13 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse34 (select .cse31 |c_~#queue~0.base|))) (let ((.cse32 (store .cse34 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (select (select (store (store .cse31 |c_~#queue~0.base| (store (store .cse32 .cse7 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse33 .cse13) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse34 .cse1))) (< (+ (select .cse32 .cse1) 1) v_ArrVal_2374))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| .cse14)))) (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2356 Int) (v_ArrVal_2337 Int) (v_ArrVal_2336 Int) (v_ArrVal_2358 Int) (v_ArrVal_2339 Int) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2342 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2345 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse45 (store .cse9 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2336))) (let ((.cse50 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse45 .cse8 v_ArrVal_2337) .cse4 v_ArrVal_2339)) |c_~#stored_elements~0.base| v_ArrVal_2341))) (let ((.cse35 (select .cse50 |c_~#queue~0.base|))) (let ((.cse42 (store .cse35 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2342))) (let ((.cse49 (store (store .cse50 |c_~#queue~0.base| (store (store .cse42 .cse7 v_ArrVal_2345) .cse1 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse41 (select .cse49 |c_~#queue~0.base|))) (let ((.cse40 (store .cse41 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349))) (let ((.cse48 (store (store .cse49 |c_~#queue~0.base| (store (store .cse40 .cse7 v_ArrVal_2351) .cse1 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse46 (select .cse48 |c_~#queue~0.base|))) (let ((.cse43 (store .cse46 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse47 (store (store .cse48 |c_~#queue~0.base| (store (store .cse43 .cse7 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse37 (select .cse47 |c_~#queue~0.base|))) (let ((.cse38 (store .cse37 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse44 (store (store .cse47 |c_~#queue~0.base| (store (store .cse38 .cse7 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse39 (select .cse44 |c_~#queue~0.base|))) (let ((.cse36 (store .cse39 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| .cse2)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse35 .cse1))) (< (+ (select .cse36 .cse1) 1) v_ArrVal_2374) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse37 .cse1))) (< (+ (select .cse38 .cse1) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse39 .cse1))) (< (+ (select .cse40 .cse1) 1) v_ArrVal_2354) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse41 .cse1))) (< (+ (select .cse42 .cse1) 1) v_ArrVal_2346) (< (+ (select .cse43 .cse1) 1) v_ArrVal_2360) (< (select (select (store (store .cse44 |c_~#queue~0.base| (store (store .cse36 .cse7 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse45 .cse4) 1) v_ArrVal_2339) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse46 .cse1))))))))))))))))))))) (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2330 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2332 Int) (v_ArrVal_2354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2356 Int) (v_ArrVal_2337 Int) (v_ArrVal_2336 Int) (v_ArrVal_2358 Int) (v_ArrVal_2339 Int) (v_ArrVal_2334 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2342 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2345 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse68 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 .cse12 v_ArrVal_2330) .cse13 v_ArrVal_2332)) |c_~#stored_elements~0.base| v_ArrVal_2334))) (let ((.cse57 (select .cse68 |c_~#queue~0.base|))) (let ((.cse58 (store .cse57 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2336))) (let ((.cse67 (store (store .cse68 |c_~#queue~0.base| (store (store .cse58 .cse7 v_ArrVal_2337) .cse1 v_ArrVal_2339)) |c_~#stored_elements~0.base| v_ArrVal_2341))) (let ((.cse62 (select .cse67 |c_~#queue~0.base|))) (let ((.cse51 (store .cse62 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2342))) (let ((.cse66 (store (store .cse67 |c_~#queue~0.base| (store (store .cse51 .cse7 v_ArrVal_2345) .cse1 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse59 (select .cse66 |c_~#queue~0.base|))) (let ((.cse60 (store .cse59 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349))) (let ((.cse65 (store (store .cse66 |c_~#queue~0.base| (store (store .cse60 .cse7 v_ArrVal_2351) .cse1 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse61 (select .cse65 |c_~#queue~0.base|))) (let ((.cse55 (store .cse61 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse64 (store (store .cse65 |c_~#queue~0.base| (store (store .cse55 .cse7 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse56 (select .cse64 |c_~#queue~0.base|))) (let ((.cse63 (store .cse56 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse52 (store (store .cse64 |c_~#queue~0.base| (store (store .cse63 .cse7 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse54 (select .cse52 |c_~#queue~0.base|))) (let ((.cse53 (store .cse54 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (+ (select .cse51 .cse1) 1) v_ArrVal_2346) (< (select (select (store (store .cse52 |c_~#queue~0.base| (store (store .cse53 .cse7 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse54 .cse1))) (< (+ (select .cse55 .cse1) 1) v_ArrVal_2360) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse56 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse57 .cse1))) (< (+ (select .cse58 .cse1) 1) v_ArrVal_2339) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse59 .cse1))) (< (+ (select .cse60 .cse1) 1) v_ArrVal_2354) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse61 .cse1))) (< (+ (select .cse53 .cse1) 1) v_ArrVal_2374) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse62 .cse1))) (< .cse10 v_ArrVal_2332) (< (+ (select .cse63 .cse1) 1) v_ArrVal_2367))))))))))))))))))))) (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2354 Int) (v_ArrVal_2356 Int) (v_ArrVal_2358 Int) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2342 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2345 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2349 Int)) (let ((.cse75 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2342))) (let ((.cse81 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse75 .cse8 v_ArrVal_2345) .cse4 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse69 (select .cse81 |c_~#queue~0.base|))) (let ((.cse77 (store .cse69 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349))) (let ((.cse80 (store (store .cse81 |c_~#queue~0.base| (store (store .cse77 .cse7 v_ArrVal_2351) .cse1 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse73 (select .cse80 |c_~#queue~0.base|))) (let ((.cse70 (store .cse73 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse79 (store (store .cse80 |c_~#queue~0.base| (store (store .cse70 .cse7 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse78 (select .cse79 |c_~#queue~0.base|))) (let ((.cse72 (store .cse78 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse76 (store (store .cse79 |c_~#queue~0.base| (store (store .cse72 .cse7 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse71 (select .cse76 |c_~#queue~0.base|))) (let ((.cse74 (store .cse71 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse69 .cse1))) (< (+ 1 (select .cse70 .cse1)) v_ArrVal_2360) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| .cse2)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse71 .cse1))) (< (+ (select .cse72 .cse1) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse73 .cse1))) (< (+ (select .cse74 .cse1) 1) v_ArrVal_2374) (< (+ (select .cse75 .cse4) 1) v_ArrVal_2346) (< (select (select (store (store .cse76 |c_~#queue~0.base| (store (store .cse74 .cse7 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse77 .cse1) 1) v_ArrVal_2354) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse78 .cse1)))))))))))))))))) (<= .cse27 8) (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2374 Int) (v_ArrVal_2365 Int) (v_ArrVal_2356 Int) (v_ArrVal_2367 Int) (v_ArrVal_2358 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int)) (let ((.cse87 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2356))) (let ((.cse88 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse87 .cse8 v_ArrVal_2358) .cse4 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse82 (select .cse88 |c_~#queue~0.base|))) (let ((.cse86 (store .cse82 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse85 (store (store .cse88 |c_~#queue~0.base| (store (store .cse86 .cse7 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse83 (select .cse85 |c_~#queue~0.base|))) (let ((.cse84 (store .cse83 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse82 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse83 .cse1))) (< (+ (select .cse84 .cse1) 1) v_ArrVal_2374) (< (select (select (store (store .cse85 |c_~#queue~0.base| (store (store .cse84 .cse7 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse86 .cse1) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| .cse2)) (< (+ (select .cse87 .cse4) 1) v_ArrVal_2360)))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int)) (or (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2373 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2374 Int) (v_ArrVal_2365 Int) (v_ArrVal_2356 Int) (v_ArrVal_2367 Int) (v_ArrVal_2358 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int)) (let ((.cse89 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2356))) (let ((.cse95 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse89 .cse12 v_ArrVal_2358) .cse13 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse93 (select .cse95 |c_~#queue~0.base|))) (let ((.cse92 (store .cse93 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse94 (store (store .cse95 |c_~#queue~0.base| (store (store .cse92 .cse7 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse91 (select .cse94 |c_~#queue~0.base|))) (let ((.cse90 (store .cse91 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (+ (select .cse89 .cse13) 1) v_ArrVal_2360) (< (+ (select .cse90 .cse1) 1) v_ArrVal_2374) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse91 .cse1))) (< (+ (select .cse92 .cse1) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse93 .cse1))) (< (select (select (store (store .cse94 |c_~#queue~0.base| (store (store .cse90 .cse7 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20)))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| .cse14)))) (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2330 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2332 Int) (v_ArrVal_2354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2356 Int) (v_ArrVal_2337 Int) (v_ArrVal_2336 Int) (v_ArrVal_2358 Int) (v_ArrVal_2339 Int) (v_ArrVal_2334 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2360 Int) (v_ArrVal_2342 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2345 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2328 Int) (v_ArrVal_2349 Int)) (let ((.cse104 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2328))) (let ((.cse114 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse104 .cse8 v_ArrVal_2330) .cse4 v_ArrVal_2332)) |c_~#stored_elements~0.base| v_ArrVal_2334))) (let ((.cse105 (select .cse114 |c_~#queue~0.base|))) (let ((.cse97 (store .cse105 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2336))) (let ((.cse113 (store (store .cse114 |c_~#queue~0.base| (store (store .cse97 .cse7 v_ArrVal_2337) .cse1 v_ArrVal_2339)) |c_~#stored_elements~0.base| v_ArrVal_2341))) (let ((.cse101 (select .cse113 |c_~#queue~0.base|))) (let ((.cse106 (store .cse101 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2342))) (let ((.cse112 (store (store .cse113 |c_~#queue~0.base| (store (store .cse106 .cse7 v_ArrVal_2345) .cse1 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse100 (select .cse112 |c_~#queue~0.base|))) (let ((.cse107 (store .cse100 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349))) (let ((.cse111 (store (store .cse112 |c_~#queue~0.base| (store (store .cse107 .cse7 v_ArrVal_2351) .cse1 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse98 (select .cse111 |c_~#queue~0.base|))) (let ((.cse102 (store .cse98 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse110 (store (store .cse111 |c_~#queue~0.base| (store (store .cse102 .cse7 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse103 (select .cse110 |c_~#queue~0.base|))) (let ((.cse96 (store .cse103 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse109 (store (store .cse110 |c_~#queue~0.base| (store (store .cse96 .cse7 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse99 (select .cse109 |c_~#queue~0.base|))) (let ((.cse108 (store .cse99 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (< (+ (select .cse96 .cse1) 1) v_ArrVal_2367) (< (+ (select .cse97 .cse1) 1) v_ArrVal_2339) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse98 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse99 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse100 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse101 .cse1))) (< (+ (select .cse102 .cse1) 1) v_ArrVal_2360) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse103 .cse1))) (< (+ (select .cse104 .cse4) 1) v_ArrVal_2332) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse105 .cse1))) (< (+ (select .cse106 .cse1) 1) v_ArrVal_2346) (< (+ (select .cse107 .cse1) 1) v_ArrVal_2354) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| .cse2)) (< (+ (select .cse108 .cse1) 1) v_ArrVal_2374) (< (select (select (store (store .cse109 |c_~#queue~0.base| (store (store .cse108 .cse7 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20)))))))))))))))))))))) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse1) 8) (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2374 Int) (v_ArrVal_2354 Int) (v_ArrVal_2365 Int) (v_ArrVal_2356 Int) (v_ArrVal_2367 Int) (v_ArrVal_2358 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int)) (let ((.cse123 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 .cse12 v_ArrVal_2351) .cse13 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse115 (select .cse123 |c_~#queue~0.base|))) (let ((.cse117 (store .cse115 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse122 (store (store .cse123 |c_~#queue~0.base| (store (store .cse117 .cse7 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse116 (select .cse122 |c_~#queue~0.base|))) (let ((.cse118 (store .cse116 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse121 (store (store .cse122 |c_~#queue~0.base| (store (store .cse118 .cse7 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse119 (select .cse121 |c_~#queue~0.base|))) (let ((.cse120 (store .cse119 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse115 .cse1))) (< .cse10 v_ArrVal_2354) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse116 .cse1))) (< (+ (select .cse117 .cse1) 1) v_ArrVal_2360) (< (+ (select .cse118 .cse1) 1) v_ArrVal_2367) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse119 .cse1))) (< (+ (select .cse120 .cse1) 1) v_ArrVal_2374) (< (select (select (store (store .cse121 |c_~#queue~0.base| (store (store .cse120 .cse7 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20)))))))))))) (<= (select (select |c_#memory_int| 5) 84) 8) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int)) (or (forall ((v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2370 Int) (v_ArrVal_2351 Int) (v_ArrVal_2373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| Int) (v_ArrVal_2330 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2374 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2332 Int) (v_ArrVal_2354 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2356 Int) (v_ArrVal_2337 Int) (v_ArrVal_2336 Int) (v_ArrVal_2358 Int) (v_ArrVal_2339 Int) (v_ArrVal_2334 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2376 (Array Int Int)) (v_ArrVal_2360 Int) (v_ArrVal_2342 Int) (v_ArrVal_2364 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2365 Int) (v_ArrVal_2346 Int) (v_ArrVal_2345 Int) (v_ArrVal_2367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| Int) (v_ArrVal_2328 Int) (v_ArrVal_2349 Int)) (let ((.cse126 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2328))) (let ((.cse142 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse126 .cse12 v_ArrVal_2330) .cse13 v_ArrVal_2332)) |c_~#stored_elements~0.base| v_ArrVal_2334))) (let ((.cse130 (select .cse142 |c_~#queue~0.base|))) (let ((.cse128 (store .cse130 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2336))) (let ((.cse141 (store (store .cse142 |c_~#queue~0.base| (store (store .cse128 .cse7 v_ArrVal_2337) .cse1 v_ArrVal_2339)) |c_~#stored_elements~0.base| v_ArrVal_2341))) (let ((.cse129 (select .cse141 |c_~#queue~0.base|))) (let ((.cse135 (store .cse129 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) v_ArrVal_2342))) (let ((.cse140 (store (store .cse141 |c_~#queue~0.base| (store (store .cse135 .cse7 v_ArrVal_2345) .cse1 v_ArrVal_2346)) |c_~#stored_elements~0.base| v_ArrVal_2348))) (let ((.cse124 (select .cse140 |c_~#queue~0.base|))) (let ((.cse127 (store .cse124 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2349))) (let ((.cse139 (store (store .cse140 |c_~#queue~0.base| (store (store .cse127 .cse7 v_ArrVal_2351) .cse1 v_ArrVal_2354)) |c_~#stored_elements~0.base| v_ArrVal_2355))) (let ((.cse125 (select .cse139 |c_~#queue~0.base|))) (let ((.cse131 (store .cse125 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| 4) |c_~#queue~0.offset|) v_ArrVal_2356))) (let ((.cse138 (store (store .cse139 |c_~#queue~0.base| (store (store .cse131 .cse7 v_ArrVal_2358) .cse1 v_ArrVal_2360)) |c_~#stored_elements~0.base| v_ArrVal_2362))) (let ((.cse136 (select .cse138 |c_~#queue~0.base|))) (let ((.cse134 (store .cse136 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| 4)) v_ArrVal_2364))) (let ((.cse132 (store (store .cse138 |c_~#queue~0.base| (store (store .cse134 .cse7 v_ArrVal_2365) .cse1 v_ArrVal_2367)) |c_~#stored_elements~0.base| v_ArrVal_2369))) (let ((.cse137 (select .cse132 |c_~#queue~0.base|))) (let ((.cse133 (store .cse137 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2370))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse124 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_230| (select .cse125 .cse1))) (< (+ (select .cse126 .cse13) 1) v_ArrVal_2332) (< (+ (select .cse127 .cse1) 1) v_ArrVal_2354) (< (+ (select .cse128 .cse1) 1) v_ArrVal_2339) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_236| (select .cse129 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse130 .cse1))) (< (+ (select .cse131 .cse1) 1) v_ArrVal_2360) (< (select (select (store (store .cse132 |c_~#queue~0.base| (store (store .cse133 .cse7 v_ArrVal_2373) .cse1 v_ArrVal_2374)) |c_~#stored_elements~0.base| v_ArrVal_2376) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse134 .cse1) 1) v_ArrVal_2367) (< (+ (select .cse135 .cse1) 1) v_ArrVal_2346) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_227| (select .cse136 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_224| (select .cse137 .cse1))) (< (+ (select .cse133 .cse1) 1) v_ArrVal_2374)))))))))))))))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| .cse14)))))))) is different from true