./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 2329fc70 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_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- 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-2329fc7 [2022-12-13 08:51:49,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 08:51:49,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 08:51:49,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 08:51:49,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 08:51:49,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 08:51:49,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 08:51:49,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 08:51:49,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 08:51:49,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 08:51:49,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 08:51:49,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 08:51:49,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 08:51:49,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 08:51:49,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 08:51:49,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 08:51:49,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 08:51:49,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 08:51:49,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 08:51:49,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 08:51:49,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 08:51:49,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 08:51:49,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 08:51:49,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 08:51:49,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 08:51:49,545 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 08:51:49,545 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 08:51:49,546 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 08:51:49,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 08:51:49,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 08:51:49,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 08:51:49,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 08:51:49,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 08:51:49,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 08:51:49,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 08:51:49,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 08:51:49,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 08:51:49,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 08:51:49,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 08:51:49,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 08:51:49,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 08:51:49,552 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2022-12-13 08:51:49,572 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 08:51:49,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 08:51:49,572 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 08:51:49,572 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 08:51:49,573 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 08:51:49,573 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 08:51:49,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 08:51:49,573 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 08:51:49,573 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 08:51:49,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 08:51:49,574 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 08:51:49,574 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 08:51:49,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 08:51:49,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 08:51:49,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 08:51:49,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 08:51:49,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 08:51:49,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 08:51:49,575 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-12-13 08:51:49,575 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 08:51:49,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 08:51:49,575 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 08:51:49,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 08:51:49,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 08:51:49,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 08:51:49,576 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 08:51:49,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 08:51:49,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 08:51:49,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 08:51:49,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 08:51:49,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 08:51:49,576 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 08:51:49,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 08:51:49,577 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-13 08:51:49,577 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-12-13 08:51:49,577 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-12-13 08:51:49,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 08:51:49,577 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-12-13 08:51:49,577 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-12-13 08:51:49,577 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_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/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_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w 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 ! data-race) ) 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 -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2022-12-13 08:51:49,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 08:51:49,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 08:51:49,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 08:51:49,762 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 08:51:49,763 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 08:51:49,764 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2022-12-13 08:51:52,274 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 08:51:52,509 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 08:51:52,510 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/sv-benchmarks/c/pthread/queue_ok_longest.i [2022-12-13 08:51:52,522 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/data/a0a9ab8b8/4818306682f3478abe75fda67b40591b/FLAGcf48413f5 [2022-12-13 08:51:52,846 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/data/a0a9ab8b8/4818306682f3478abe75fda67b40591b [2022-12-13 08:51:52,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 08:51:52,850 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 08:51:52,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 08:51:52,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 08:51:52,854 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 08:51:52,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:51:52" (1/1) ... [2022-12-13 08:51:52,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@544db380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:52, skipping insertion in model container [2022-12-13 08:51:52,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:51:52" (1/1) ... [2022-12-13 08:51:52,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 08:51:52,895 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 08:51:53,281 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_d1ae9910-27f4-49c3-90df-a7848bc33112/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-12-13 08:51:53,284 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_d1ae9910-27f4-49c3-90df-a7848bc33112/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-12-13 08:51:53,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 08:51:53,299 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 08:51:53,352 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_d1ae9910-27f4-49c3-90df-a7848bc33112/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-12-13 08:51:53,356 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_d1ae9910-27f4-49c3-90df-a7848bc33112/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-12-13 08:51:53,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 08:51:53,407 INFO L208 MainTranslator]: Completed translation [2022-12-13 08:51:53,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:53 WrapperNode [2022-12-13 08:51:53,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 08:51:53,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 08:51:53,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 08:51:53,409 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 08:51:53,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:53" (1/1) ... [2022-12-13 08:51:53,437 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:53" (1/1) ... [2022-12-13 08:51:53,468 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 387 [2022-12-13 08:51:53,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 08:51:53,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 08:51:53,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 08:51:53,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 08:51:53,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:53" (1/1) ... [2022-12-13 08:51:53,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:53" (1/1) ... [2022-12-13 08:51:53,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:53" (1/1) ... [2022-12-13 08:51:53,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:53" (1/1) ... [2022-12-13 08:51:53,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:53" (1/1) ... [2022-12-13 08:51:53,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:53" (1/1) ... [2022-12-13 08:51:53,514 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:53" (1/1) ... [2022-12-13 08:51:53,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:53" (1/1) ... [2022-12-13 08:51:53,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 08:51:53,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 08:51:53,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 08:51:53,523 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 08:51:53,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:53" (1/1) ... [2022-12-13 08:51:53,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 08:51:53,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 08:51:53,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 08:51:53,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 08:51:53,586 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 08:51:53,586 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 08:51:53,586 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 08:51:53,586 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 08:51:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 08:51:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 08:51:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 08:51:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 08:51:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 08:51:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 08:51:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 08:51:53,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 08:51:53,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 08:51:53,605 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 08:51:53,736 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 08:51:53,738 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 08:51:54,214 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 08:51:54,222 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 08:51:54,222 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 08:51:54,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:51:54 BoogieIcfgContainer [2022-12-13 08:51:54,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 08:51:54,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 08:51:54,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 08:51:54,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 08:51:54,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:51:52" (1/3) ... [2022-12-13 08:51:54,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b4e256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:51:54, skipping insertion in model container [2022-12-13 08:51:54,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:51:53" (2/3) ... [2022-12-13 08:51:54,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b4e256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:51:54, skipping insertion in model container [2022-12-13 08:51:54,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:51:54" (3/3) ... [2022-12-13 08:51:54,230 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-12-13 08:51:54,236 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 08:51:54,243 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 08:51:54,243 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2022-12-13 08:51:54,243 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 08:51:54,351 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 08:51:54,400 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 08:51:54,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-12-13 08:51:54,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 08:51:54,401 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-12-13 08:51:54,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-12-13 08:51:54,446 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-12-13 08:51:54,457 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2022-12-13 08:51:54,463 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;@3df373d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 08:51:54,464 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-12-13 08:51:54,725 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 08:51:54,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:51:54,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1735836568, now seen corresponding path program 1 times [2022-12-13 08:51:54,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:51:54,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801311094] [2022-12-13 08:51:54,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:51:54,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:51:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:51:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:51:54,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:51:54,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801311094] [2022-12-13 08:51:54,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801311094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:51:54,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:51:54,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 08:51:54,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722033537] [2022-12-13 08:51:54,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:51:54,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 08:51:54,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:51:54,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 08:51:54,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 08:51:54,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:54,981 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 08:51:54,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 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-12-13 08:51:54,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:55,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:55,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 08:51:55,011 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 08:51:55,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:51:55,012 INFO L85 PathProgramCache]: Analyzing trace with hash -878463602, now seen corresponding path program 1 times [2022-12-13 08:51:55,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:51:55,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15869424] [2022-12-13 08:51:55,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:51:55,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:51:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:51:55,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:51:55,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:51:55,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15869424] [2022-12-13 08:51:55,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15869424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:51:55,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:51:55,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 08:51:55,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893426531] [2022-12-13 08:51:55,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:51:55,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 08:51:55,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:51:55,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 08:51:55,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 08:51:55,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:55,174 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 08:51:55,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 53.5) internal successors, (107), 3 states have internal predecessors, (107), 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-12-13 08:51:55,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:55,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:55,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:55,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:51:55,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 08:51:55,260 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 08:51:55,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:51:55,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1686590530, now seen corresponding path program 1 times [2022-12-13 08:51:55,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:51:55,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331939876] [2022-12-13 08:51:55,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:51:55,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:51:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:51:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:51:55,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:51:55,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331939876] [2022-12-13 08:51:55,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331939876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:51:55,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:51:55,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:51:55,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411732879] [2022-12-13 08:51:55,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:51:55,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 08:51:55,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:51:55,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 08:51:55,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 08:51:55,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:55,869 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 08:51:55,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.0) internal successors, (125), 6 states have internal predecessors, (125), 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-12-13 08:51:55,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:55,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:51:55,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:56,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:56,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:51:56,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:56,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 08:51:56,135 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 08:51:56,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:51:56,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1332369795, now seen corresponding path program 1 times [2022-12-13 08:51:56,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:51:56,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009930177] [2022-12-13 08:51:56,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:51:56,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:51:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:51:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:51:56,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:51:56,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009930177] [2022-12-13 08:51:56,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009930177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:51:56,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:51:56,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:51:56,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732773826] [2022-12-13 08:51:56,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:51:56,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 08:51:56,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:51:56,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 08:51:56,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 08:51:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:56,677 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 08:51:56,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.4) internal successors, (132), 6 states have internal predecessors, (132), 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-12-13 08:51:56,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:56,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:51:56,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:56,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:56,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:56,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:51:56,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:56,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:56,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 08:51:56,897 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err3ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 08:51:56,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:51:56,898 INFO L85 PathProgramCache]: Analyzing trace with hash -442133752, now seen corresponding path program 1 times [2022-12-13 08:51:56,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:51:56,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977086468] [2022-12-13 08:51:56,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:51:56,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:51:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:51:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:51:57,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:51:57,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977086468] [2022-12-13 08:51:57,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977086468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:51:57,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:51:57,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:51:57,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51784663] [2022-12-13 08:51:57,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:51:57,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 08:51:57,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:51:57,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 08:51:57,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 08:51:57,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:57,403 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 08:51:57,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 28.0) internal successors, (140), 6 states have internal predecessors, (140), 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-12-13 08:51:57,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:57,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:51:57,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:57,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:57,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:57,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:57,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:51:57,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:57,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:57,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:57,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 08:51:57,555 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 08:51:57,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:51:57,555 INFO L85 PathProgramCache]: Analyzing trace with hash -402207731, now seen corresponding path program 1 times [2022-12-13 08:51:57,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:51:57,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891579661] [2022-12-13 08:51:57,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:51:57,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:51:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:51:57,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:51:57,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:51:57,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891579661] [2022-12-13 08:51:57,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891579661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:51:57,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:51:57,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:51:57,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283997122] [2022-12-13 08:51:57,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:51:57,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 08:51:57,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:51:57,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 08:51:57,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 08:51:57,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:57,930 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 08:51:57,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.6) internal successors, (148), 6 states have internal predecessors, (148), 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-12-13 08:51:57,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:57,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:51:57,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:57,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:57,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:57,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:58,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:58,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:51:58,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:58,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:58,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:58,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:58,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 08:51:58,293 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 08:51:58,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:51:58,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1067657820, now seen corresponding path program 1 times [2022-12-13 08:51:58,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:51:58,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331571204] [2022-12-13 08:51:58,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:51:58,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:51:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:51:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:51:58,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:51:58,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331571204] [2022-12-13 08:51:58,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331571204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:51:58,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:51:58,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:51:58,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986451303] [2022-12-13 08:51:58,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:51:58,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 08:51:58,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:51:58,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 08:51:58,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 08:51:58,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:58,876 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 08:51:58,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.2) internal successors, (166), 6 states have internal predecessors, (166), 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-12-13 08:51:58,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:58,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:51:58,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:58,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:58,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:58,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:58,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:59,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:59,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:51:59,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:59,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:59,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:59,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:59,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:59,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 08:51:59,121 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 08:51:59,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:51:59,122 INFO L85 PathProgramCache]: Analyzing trace with hash -396237207, now seen corresponding path program 1 times [2022-12-13 08:51:59,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:51:59,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573357834] [2022-12-13 08:51:59,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:51:59,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:51:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:51:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:51:59,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:51:59,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573357834] [2022-12-13 08:51:59,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573357834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:51:59,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:51:59,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:51:59,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848110052] [2022-12-13 08:51:59,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:51:59,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 08:51:59,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:51:59,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 08:51:59,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 08:51:59,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:59,623 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 08:51:59,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 35.8) internal successors, (179), 6 states have internal predecessors, (179), 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-12-13 08:51:59,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:59,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:51:59,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:59,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:59,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:59,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:59,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:59,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:59,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:51:59,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:51:59,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:59,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:59,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:59,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:59,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:59,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:51:59,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 08:51:59,866 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 08:51:59,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:51:59,866 INFO L85 PathProgramCache]: Analyzing trace with hash -868735545, now seen corresponding path program 1 times [2022-12-13 08:51:59,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:51:59,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157977887] [2022-12-13 08:51:59,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:51:59,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:51:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:52:02,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:52:02,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:52:02,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157977887] [2022-12-13 08:52:02,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157977887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:52:02,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:52:02,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-12-13 08:52:02,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718510587] [2022-12-13 08:52:02,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:52:02,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 08:52:02,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:52:02,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 08:52:02,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2022-12-13 08:52:02,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:02,073 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 08:52:02,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 8.590909090909092) internal successors, (189), 23 states have internal predecessors, (189), 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-12-13 08:52:02,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:02,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:52:02,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:02,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:02,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:02,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:02,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:02,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:02,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:52:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:03,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:03,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:03,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 08:52:03,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 08:52:03,859 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 08:52:03,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:52:03,860 INFO L85 PathProgramCache]: Analyzing trace with hash -156445024, now seen corresponding path program 1 times [2022-12-13 08:52:03,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:52:03,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592718504] [2022-12-13 08:52:03,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:52:03,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:52:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:52:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-13 08:52:04,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:52:04,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592718504] [2022-12-13 08:52:04,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592718504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:52:04,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:52:04,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:52:04,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139685422] [2022-12-13 08:52:04,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:52:04,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 08:52:04,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:52:04,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 08:52:04,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 08:52:04,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:04,559 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 08:52:04,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 39.8) internal successors, (199), 6 states have internal predecessors, (199), 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-12-13 08:52:04,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:04,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:52:04,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:04,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:04,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:04,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:04,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:04,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:04,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 08:52:04,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:04,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:04,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:52:04,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:04,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:04,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:04,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:04,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:04,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:04,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 08:52:04,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:04,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 08:52:04,855 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 08:52:04,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:52:04,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1000896702, now seen corresponding path program 1 times [2022-12-13 08:52:04,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:52:04,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102228764] [2022-12-13 08:52:04,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:52:04,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:52:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:52:06,255 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:52:06,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:52:06,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102228764] [2022-12-13 08:52:06,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102228764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:52:06,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:52:06,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-12-13 08:52:06,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462593025] [2022-12-13 08:52:06,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:52:06,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 08:52:06,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:52:06,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 08:52:06,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-12-13 08:52:06,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:06,258 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 08:52:06,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.117647058823529) internal successors, (257), 17 states have internal predecessors, (257), 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-12-13 08:52:06,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:06,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:52:06,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:06,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:06,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:06,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:06,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:06,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:06,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 08:52:06,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:06,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:52:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:52:07,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:07,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:52:07,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 08:52:07,352 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 08:52:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:52:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash 392687094, now seen corresponding path program 1 times [2022-12-13 08:52:07,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:52:07,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481912928] [2022-12-13 08:52:07,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:52:07,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:52:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:52:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:52:10,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:52:10,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481912928] [2022-12-13 08:52:10,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481912928] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:52:10,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655853275] [2022-12-13 08:52:10,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:52:10,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:52:10,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 08:52:10,112 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:52:10,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 08:52:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:52:10,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-13 08:52:10,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:52:10,436 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 08:52:10,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 08:52:10,706 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-12-13 08:52:10,848 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-12-13 08:52:11,167 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-12-13 08:52:11,555 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:52:11,564 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 08:52:11,564 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-12-13 08:52:11,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:52:11,764 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-12-13 08:52:12,055 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-12-13 08:52:12,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:52:12,181 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-12-13 08:52:12,394 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 08:52:12,394 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-12-13 08:52:12,473 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-12-13 08:52:12,509 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-12-13 08:52:12,533 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:52:12,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:52:12,839 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1557 Int)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1556) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1557)) .cse1))))) is different from false [2022-12-13 08:52:12,894 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1557 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post47#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1556) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1557)) .cse1)) 800))) is different from false [2022-12-13 08:52:12,902 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1557 Int)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem46#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1556) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1557)) .cse1))))) is different from false [2022-12-13 08:52:12,931 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1557 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1556) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1557)) .cse1)) 800))) is different from false [2022-12-13 08:52:13,009 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1552 Int) (v_ArrVal_1557 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1552) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1556) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1557)) .cse1)) 800))) is different from false [2022-12-13 08:52:13,092 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1552 Int) (v_ArrVal_1551 Int) (v_ArrVal_1557 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1551)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1552) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1556) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1557)) .cse1)) 800))) is different from false [2022-12-13 08:52:13,141 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_27| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1552 Int) (v_ArrVal_1551 Int) (v_ArrVal_1557 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_27| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1551))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1552) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1556) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1557)) .cse1)) 800))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_27| (select .cse4 .cse3)))))) is different from false [2022-12-13 08:52:13,170 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1552 Int) (v_ArrVal_1551 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_27| Int) (v_ArrVal_1557 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (or (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_27| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1551))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1552) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1556) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1557)) .cse1)))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_27| (select .cse4 .cse3)))))) is different from false [2022-12-13 08:52:13,929 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1552 Int) (v_ArrVal_1551 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_27| Int) (v_ArrVal_1547 Int) (v_ArrVal_1557 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1549))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_27| 4) |c_~#queue~0.offset|) v_ArrVal_1551))) (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1552) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1556) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1557)) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_27| (select .cse4 .cse1))))))) is different from false [2022-12-13 08:52:14,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:52:14,019 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 2 case distinctions, treesize of input 240 treesize of output 155 [2022-12-13 08:52:14,030 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:52:14,030 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 227 treesize of output 225 [2022-12-13 08:52:14,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 226 [2022-12-13 08:52:14,044 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 233 treesize of output 209 [2022-12-13 08:52:14,100 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-12-13 08:52:14,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:52:14,122 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 120 treesize of output 108 [2022-12-13 08:52:14,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:52:14,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2022-12-13 08:52:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 43 not checked. [2022-12-13 08:52:14,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655853275] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:52:14,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:52:14,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22, 25] total 69 [2022-12-13 08:52:14,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070013952] [2022-12-13 08:52:14,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:52:14,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-12-13 08:52:14,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:52:14,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-12-13 08:52:14,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=3103, Unknown=26, NotChecked=1116, Total=4692 [2022-12-13 08:52:14,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:14,531 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 08:52:14,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 10.231884057971014) internal successors, (706), 69 states have internal predecessors, (706), 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-12-13 08:52:14,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:14,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:52:14,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:14,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:14,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:14,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:14,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:14,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:14,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:52:14,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:14,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:52:14,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:20,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:20,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:52:20,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:20,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:20,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:20,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:20,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:20,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:20,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:52:20,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:20,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:52:20,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 08:52:20,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 08:52:21,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 08:52:21,162 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 08:52:21,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:52:21,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1021816630, now seen corresponding path program 1 times [2022-12-13 08:52:21,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:52:21,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365785482] [2022-12-13 08:52:21,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:52:21,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:52:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:52:22,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2022-12-13 08:52:22,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:52:22,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365785482] [2022-12-13 08:52:22,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365785482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:52:22,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:52:22,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 08:52:22,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794476634] [2022-12-13 08:52:22,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:52:22,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 08:52:22,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:52:22,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 08:52:22,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 08:52:22,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:22,762 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 08:52:22,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.666666666666664) internal successors, (376), 6 states have internal predecessors, (376), 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-12-13 08:52:22,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:22,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:52:22,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:22,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:22,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:22,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:22,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:22,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:22,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:52:22,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:22,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:52:22,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-12-13 08:52:22,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:23,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:52:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:52:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:52:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 08:52:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:23,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 08:52:23,482 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 08:52:23,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:52:23,483 INFO L85 PathProgramCache]: Analyzing trace with hash -407223782, now seen corresponding path program 1 times [2022-12-13 08:52:23,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:52:23,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247315916] [2022-12-13 08:52:23,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:52:23,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:52:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:52:24,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1848 backedges. 969 proven. 0 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2022-12-13 08:52:24,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:52:24,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247315916] [2022-12-13 08:52:24,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247315916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:52:24,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:52:24,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 08:52:24,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762283262] [2022-12-13 08:52:24,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:52:24,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 08:52:24,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:52:24,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 08:52:24,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 08:52:24,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:24,159 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 08:52:24,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 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-12-13 08:52:24,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:24,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:52:24,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:24,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:24,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:24,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:24,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:24,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:24,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:52:24,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:24,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:52:24,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-12-13 08:52:24,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:24,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:52:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:52:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:52:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 08:52:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:52:24,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 08:52:24,215 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 08:52:24,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:52:24,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1181757217, now seen corresponding path program 1 times [2022-12-13 08:52:24,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:52:24,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742027717] [2022-12-13 08:52:24,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:52:24,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:52:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:52:26,367 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2022-12-13 08:52:26,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:52:26,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742027717] [2022-12-13 08:52:26,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742027717] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:52:26,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50675190] [2022-12-13 08:52:26,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:52:26,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:52:26,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 08:52:26,368 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:52:26,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 08:52:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:52:26,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 1592 conjuncts, 119 conjunts are in the unsatisfiable core [2022-12-13 08:52:26,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:52:26,823 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 08:52:26,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 08:52:27,029 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-12-13 08:52:27,157 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-12-13 08:52:27,522 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-12-13 08:52:27,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:52:27,860 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 08:52:27,861 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-12-13 08:52:28,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:52:28,022 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-12-13 08:52:28,362 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-12-13 08:52:28,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:52:28,480 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-12-13 08:52:28,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:52:28,844 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 08:52:28,844 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-12-13 08:52:28,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:52:28,973 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-12-13 08:52:29,233 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-12-13 08:52:29,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:52:29,344 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-12-13 08:52:29,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:52:29,630 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 08:52:29,630 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-12-13 08:52:29,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:52:29,831 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-12-13 08:52:30,288 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-12-13 08:52:30,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:52:30,435 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-12-13 08:52:30,708 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 08:52:30,709 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-12-13 08:52:30,782 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-12-13 08:52:30,832 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-12-13 08:52:30,871 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 244 proven. 396 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 08:52:30,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:52:31,732 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3626 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3632 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3626) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse0 .cse1))) (not (= 800 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1)))))) is different from false [2022-12-13 08:52:31,885 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3626 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3624 Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3632 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3624)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3626) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse0 .cse1))) (not (= 800 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1)))))) is different from false [2022-12-13 08:52:31,961 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse0 .cse1))) (forall ((v_ArrVal_3626 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3624 Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3632 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3624))) (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3626) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse2 .cse3))))))))) is different from false [2022-12-13 08:52:31,995 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3626 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3624 Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3632 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse4 (store .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4)) v_ArrVal_3624))) (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_3626) .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse2 .cse3))))))) is different from false [2022-12-13 08:52:32,332 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3626 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3624 Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3632 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int) (v_ArrVal_3623 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3623))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4) |c_~#queue~0.offset|) v_ArrVal_3624))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_3626) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse0 .cse1))) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse2 .cse1)))))))) is different from false [2022-12-13 08:52:32,680 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3626 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3624 Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3632 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int) (v_ArrVal_3623 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem46#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_3623))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4) |c_~#queue~0.offset|) v_ArrVal_3624))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_3626) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse2 .cse1))) (not (= 800 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1)))))))) is different from false [2022-12-13 08:52:33,143 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3626 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3624 Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3632 Int) (v_ArrVal_3620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int) (v_ArrVal_3623 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3620) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3623))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4) |c_~#queue~0.offset|) v_ArrVal_3624))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_3626) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse2 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1) 800))))))) is different from false [2022-12-13 08:52:33,435 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3617 Int) (v_ArrVal_3626 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3624 Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3632 Int) (v_ArrVal_3620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int) (v_ArrVal_3623 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3617)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3620) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3623))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4) |c_~#queue~0.offset|) v_ArrVal_3624))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_3626) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse2 .cse1)))))))) is different from false [2022-12-13 08:52:33,564 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_3617 Int) (v_ArrVal_3626 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3624 Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3632 Int) (v_ArrVal_3620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int) (v_ArrVal_3623 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3617))) (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3620) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3623))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4) |c_~#queue~0.offset|) v_ArrVal_3624))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_3626) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse2 .cse1)))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| (select .cse7 .cse6)))))) is different from false [2022-12-13 08:52:33,620 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| Int) (v_ArrVal_3617 Int) (v_ArrVal_3626 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3624 Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3632 Int) (v_ArrVal_3620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int) (v_ArrVal_3623 (Array Int Int))) (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse7 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_3617))) (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_3620) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3623))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4) |c_~#queue~0.offset|) v_ArrVal_3624))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_3626) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse4 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1) 800)))))))) is different from false [2022-12-13 08:52:35,970 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3617 Int) (v_ArrVal_3626 Int) (v_ArrVal_3613 Int) (v_ArrVal_3624 Int) (v_ArrVal_3632 Int) (v_ArrVal_3620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3623 (Array Int Int)) (v_ArrVal_3616 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3613) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3616))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| 4) |c_~#queue~0.offset|) v_ArrVal_3617))) (store (store .cse8 .cse6 v_ArrVal_3620) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3623))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4) |c_~#queue~0.offset|) v_ArrVal_3624))) (store (store .cse5 .cse6 v_ArrVal_3626) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse3 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1) 800))))))))) is different from false [2022-12-13 08:52:36,362 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3617 Int) (v_ArrVal_3626 Int) (v_ArrVal_3613 Int) (v_ArrVal_3624 Int) (v_ArrVal_3632 Int) (v_ArrVal_3611 Int) (v_ArrVal_3620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3623 (Array Int Int)) (v_ArrVal_3616 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse9 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3611)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3613) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3616))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| 4) |c_~#queue~0.offset|) v_ArrVal_3617))) (store (store .cse8 .cse6 v_ArrVal_3620) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3623))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4) |c_~#queue~0.offset|) v_ArrVal_3624))) (store (store .cse5 .cse6 v_ArrVal_3626) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| (select .cse3 .cse1)))))))))) is different from false [2022-12-13 08:52:36,538 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_43| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_43| (select .cse0 .cse1))) (forall ((v_ArrVal_3617 Int) (v_ArrVal_3626 Int) (v_ArrVal_3613 Int) (v_ArrVal_3624 Int) (v_ArrVal_3632 Int) (v_ArrVal_3611 Int) (v_ArrVal_3620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3623 (Array Int Int)) (v_ArrVal_3616 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse11 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_43| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3611))) (store (store .cse11 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3613) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3616))) (let ((.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| 4) |c_~#queue~0.offset|) v_ArrVal_3617))) (store (store .cse10 .cse8 v_ArrVal_3620) .cse3 (+ 1 (select .cse10 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_3623))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4) |c_~#queue~0.offset|) v_ArrVal_3624))) (store (store .cse7 .cse8 v_ArrVal_3626) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse2 .cse3))) (not (= 800 (select (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| (select .cse5 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse4 .cse3))))))))))))) is different from false [2022-12-13 08:52:36,611 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3617 Int) (v_ArrVal_3626 Int) (v_ArrVal_3613 Int) (v_ArrVal_3624 Int) (v_ArrVal_3632 Int) (v_ArrVal_3611 Int) (v_ArrVal_3620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_43| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3623 (Array Int Int)) (v_ArrVal_3616 (Array Int Int))) (let ((.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse11 (store .cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_43| 4)) v_ArrVal_3611))) (store (store .cse11 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_3613) .cse4 (+ (select .cse11 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3616))) (let ((.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| 4) |c_~#queue~0.offset|) v_ArrVal_3617))) (store (store .cse10 .cse8 v_ArrVal_3620) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3623))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4) |c_~#queue~0.offset|) v_ArrVal_3624))) (store (store .cse7 .cse8 v_ArrVal_3626) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_43| (select .cse3 .cse4))) (not (= (select (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse5 .cse1))))))))))) is different from false [2022-12-13 08:52:39,095 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3617 Int) (v_ArrVal_3609 (Array Int Int)) (v_ArrVal_3626 Int) (v_ArrVal_3613 Int) (v_ArrVal_3624 Int) (v_ArrVal_3632 Int) (v_ArrVal_3611 Int) (v_ArrVal_3620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_43| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3623 (Array Int Int)) (v_ArrVal_3616 (Array Int Int)) (v_ArrVal_3608 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_3608)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_3609))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_43| 4)) v_ArrVal_3611))) (store (store .cse11 .cse7 v_ArrVal_3613) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3616))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| 4) |c_~#queue~0.offset|) v_ArrVal_3617))) (store (store .cse9 .cse7 v_ArrVal_3620) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3623))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4) |c_~#queue~0.offset|) v_ArrVal_3624))) (store (store .cse6 .cse7 v_ArrVal_3626) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_43| (select .cse4 .cse1))) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1) 800))))))))))) is different from false [2022-12-13 08:52:39,384 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:52:39,384 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 2 case distinctions, treesize of input 2504 treesize of output 1519 [2022-12-13 08:52:39,415 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:52:39,415 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 2079 treesize of output 2053 [2022-12-13 08:52:39,435 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 1789 treesize of output 1725 [2022-12-13 08:52:39,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1895 treesize of output 1875 [2022-12-13 08:52:39,470 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 1884 treesize of output 1836 [2022-12-13 08:52:39,490 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 1947 treesize of output 1915 [2022-12-13 08:52:39,530 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-12-13 08:52:40,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:52:40,370 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 414 treesize of output 398 [2022-12-13 08:52:41,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:52:41,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2022-12-13 08:52:41,238 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 244 proven. 184 refuted. 8 times theorem prover too weak. 8 trivial. 204 not checked. [2022-12-13 08:52:41,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50675190] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:52:41,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:52:41,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 35, 43] total 85 [2022-12-13 08:52:41,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330895755] [2022-12-13 08:52:41,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:52:41,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-12-13 08:52:41,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:52:41,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-12-13 08:52:41,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=639, Invalid=4113, Unknown=138, NotChecked=2250, Total=7140 [2022-12-13 08:52:41,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:41,242 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 08:52:41,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 13.329411764705883) internal successors, (1133), 85 states have internal predecessors, (1133), 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-12-13 08:52:41,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:52:41,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:52:41,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:41,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:41,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:41,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:41,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:41,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:41,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:52:41,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:41,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:52:41,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-12-13 08:52:41,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:52:41,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:52:41,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:53:29,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:53:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:53:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:53:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 08:53:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-12-13 08:53:29,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 08:53:29,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 08:53:29,962 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err10ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 08:53:29,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:53:29,963 INFO L85 PathProgramCache]: Analyzing trace with hash 353711794, now seen corresponding path program 1 times [2022-12-13 08:53:29,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:53:29,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755747534] [2022-12-13 08:53:29,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:53:29,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:53:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:53:30,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5596 trivial. 0 not checked. [2022-12-13 08:53:30,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:53:30,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755747534] [2022-12-13 08:53:30,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755747534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:53:30,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:53:30,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 08:53:30,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427462507] [2022-12-13 08:53:30,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:53:30,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 08:53:30,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:53:30,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 08:53:30,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 08:53:30,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:53:30,506 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 08:53:30,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 110.5) internal successors, (221), 3 states have internal predecessors, (221), 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-12-13 08:53:30,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:53:30,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:30,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:30,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:30,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:30,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:30,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:30,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:30,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:53:30,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:30,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:53:30,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-12-13 08:53:30,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:30,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:30,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2022-12-13 08:53:30,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:53:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:53:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:53:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:53:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 08:53:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:30,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:30,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-12-13 08:53:30,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:30,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 08:53:30,621 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 08:53:30,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:53:30,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1589877058, now seen corresponding path program 1 times [2022-12-13 08:53:30,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:53:30,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171498682] [2022-12-13 08:53:30,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:53:30,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:53:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:53:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5596 trivial. 0 not checked. [2022-12-13 08:53:31,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:53:31,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171498682] [2022-12-13 08:53:31,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171498682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:53:31,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:53:31,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 08:53:31,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737624148] [2022-12-13 08:53:31,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:53:31,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 08:53:31,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:53:31,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 08:53:31,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 08:53:31,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:53:31,195 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 08:53:31,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 113.0) internal successors, (226), 3 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-12-13 08:53:31,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:53:31,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:31,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:31,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:31,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:31,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:31,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:31,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:31,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:53:31,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:31,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:53:31,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-12-13 08:53:31,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:31,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:31,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2022-12-13 08:53:31,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:31,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:53:31,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:53:31,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:31,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:31,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:31,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:53:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:53:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 08:53:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-12-13 08:53:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:31,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 08:53:31,620 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 08:53:31,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:53:31,620 INFO L85 PathProgramCache]: Analyzing trace with hash -897651276, now seen corresponding path program 1 times [2022-12-13 08:53:31,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:53:31,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488157269] [2022-12-13 08:53:31,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:53:31,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:53:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:53:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4651 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 4073 trivial. 0 not checked. [2022-12-13 08:53:36,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:53:36,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488157269] [2022-12-13 08:53:36,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488157269] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:53:36,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855040741] [2022-12-13 08:53:36,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:53:36,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:53:36,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 08:53:36,219 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:53:36,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 08:53:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:53:36,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 3427 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 08:53:36,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:53:40,498 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-12-13 08:53:40,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:53:40,586 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-12-13 08:53:40,798 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 08:53:40,799 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-12-13 08:53:40,887 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-12-13 08:53:40,933 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-12-13 08:53:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4651 backedges. 1290 proven. 622 refuted. 0 times theorem prover too weak. 2739 trivial. 0 not checked. [2022-12-13 08:53:40,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:53:41,422 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:53:41,422 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 54 treesize of output 44 [2022-12-13 08:53:41,429 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:53:41,429 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 81 treesize of output 83 [2022-12-13 08:53:41,433 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 78 treesize of output 70 [2022-12-13 08:53:41,442 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-12-13 08:53:41,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:53:41,474 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 52 treesize of output 48 [2022-12-13 08:53:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4651 backedges. 1290 proven. 580 refuted. 0 times theorem prover too weak. 2781 trivial. 0 not checked. [2022-12-13 08:53:42,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855040741] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:53:42,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:53:42,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 33 [2022-12-13 08:53:42,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809166873] [2022-12-13 08:53:42,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:53:42,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 08:53:42,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:53:42,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 08:53:42,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=930, Unknown=5, NotChecked=0, Total=1056 [2022-12-13 08:53:42,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:53:42,585 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 08:53:42,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 30.333333333333332) internal successors, (1001), 33 states have internal predecessors, (1001), 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-12-13 08:53:42,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:53:42,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:42,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:42,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:42,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:42,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:42,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:42,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:42,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:53:42,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:42,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:53:42,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-12-13 08:53:42,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:42,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:42,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2022-12-13 08:53:42,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:42,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:42,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:53:45,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:53:45,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:45,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:45,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:45,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:53:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:53:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 08:53:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:53:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-12-13 08:53:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:53:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:53:45,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 08:53:45,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 08:53:45,236 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 08:53:45,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:53:45,236 INFO L85 PathProgramCache]: Analyzing trace with hash 59288543, now seen corresponding path program 1 times [2022-12-13 08:53:45,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:53:45,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628966722] [2022-12-13 08:53:45,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:53:45,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:53:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:53:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 9504 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 8976 trivial. 0 not checked. [2022-12-13 08:53:51,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:53:51,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628966722] [2022-12-13 08:53:51,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628966722] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:53:51,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574184341] [2022-12-13 08:53:51,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:53:51,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:53:51,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 08:53:51,966 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:53:51,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 08:53:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:53:52,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 4655 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-13 08:53:52,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:53:57,701 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-12-13 08:53:57,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:53:57,833 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-12-13 08:53:58,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:53:58,217 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 08:53:58,217 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-12-13 08:53:58,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:53:58,495 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-12-13 08:53:59,052 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-12-13 08:53:59,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:53:59,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-12-13 08:53:59,506 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 08:53:59,506 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-12-13 08:53:59,592 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-12-13 08:53:59,632 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-12-13 08:53:59,672 INFO L134 CoverageAnalysis]: Checked inductivity of 9504 backedges. 4259 proven. 763 refuted. 0 times theorem prover too weak. 4482 trivial. 0 not checked. [2022-12-13 08:53:59,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:54:00,049 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9775 (Array Int Int)) (v_ArrVal_9777 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post47#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_9775) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_9777)) .cse1)) 800))) is different from false [2022-12-13 08:54:00,276 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9775 (Array Int Int)) (v_ArrVal_9772 Int) (v_ArrVal_9777 Int)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_9772) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_9775) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_9777)) .cse1))))) is different from false [2022-12-13 08:54:00,348 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9775 (Array Int Int)) (v_ArrVal_9772 Int) (v_ArrVal_9777 Int) (v_ArrVal_9769 Int)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_9769)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_9772) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_9775) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_9777)) .cse1))))) is different from false [2022-12-13 08:54:00,391 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_96| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_96| (select .cse0 .cse1))) (forall ((v_ArrVal_9775 (Array Int Int)) (v_ArrVal_9772 Int) (v_ArrVal_9777 Int) (v_ArrVal_9769 Int)) (not (= 800 (let ((.cse3 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_96| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_9769))) (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_9772) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_9775) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_9777)) .cse3)))))))) is different from false [2022-12-13 08:54:00,415 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_96| Int) (v_ArrVal_9775 (Array Int Int)) (v_ArrVal_9772 Int) (v_ArrVal_9777 Int) (v_ArrVal_9769 Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_96| (select .cse0 .cse1))) (not (= 800 (let ((.cse3 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_96| 4)) v_ArrVal_9769))) (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_9772) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_9775) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_9777)) .cse3))))))) is different from false [2022-12-13 08:54:00,864 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:54:00,865 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 205 treesize of output 145 [2022-12-13 08:54:00,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:54:00,874 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 227 treesize of output 225 [2022-12-13 08:54:00,878 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 242 treesize of output 226 [2022-12-13 08:54:00,884 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 233 treesize of output 209 [2022-12-13 08:54:00,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-13 08:54:00,918 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:54:00,918 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 116 treesize of output 104 [2022-12-13 08:54:02,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9504 backedges. 3910 proven. 752 refuted. 0 times theorem prover too weak. 4482 trivial. 360 not checked. [2022-12-13 08:54:02,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574184341] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:54:02,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:54:02,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20, 22] total 49 [2022-12-13 08:54:02,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749073535] [2022-12-13 08:54:02,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:54:02,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-13 08:54:02,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:54:02,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-13 08:54:02,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1610, Unknown=45, NotChecked=440, Total=2352 [2022-12-13 08:54:02,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:54:02,125 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 08:54:02,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 23.3265306122449) internal successors, (1143), 49 states have internal predecessors, (1143), 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-12-13 08:54:02,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:54:02,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:54:02,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:54:02,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:54:02,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:54:02,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:54:02,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:54:02,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:54:02,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:54:02,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:54:02,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:54:02,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-12-13 08:54:02,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:54:02,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:54:02,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2022-12-13 08:54:02,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:54:02,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:54:02,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:54:02,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:54:12,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:54:12,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:54:12,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:54:12,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:54:12,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:54:12,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:54:12,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:54:12,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:54:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:54:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:54:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:54:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 08:54:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:54:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:54:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-12-13 08:54:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:54:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:54:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:54:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-12-13 08:54:12,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 08:54:12,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:54:12,584 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 08:54:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:54:12,584 INFO L85 PathProgramCache]: Analyzing trace with hash -166947963, now seen corresponding path program 1 times [2022-12-13 08:54:12,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:54:12,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035544405] [2022-12-13 08:54:12,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:54:12,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:54:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:56:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 25593 backedges. 11132 proven. 2086 refuted. 0 times theorem prover too weak. 12375 trivial. 0 not checked. [2022-12-13 08:56:04,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:56:04,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035544405] [2022-12-13 08:56:04,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035544405] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:56:04,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499549551] [2022-12-13 08:56:04,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:56:04,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:56:04,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 08:56:04,938 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:56:04,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 08:56:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:56:06,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 7286 conjuncts, 153 conjunts are in the unsatisfiable core [2022-12-13 08:56:06,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:56:10,610 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-12-13 08:56:10,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:56:10,721 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-12-13 08:56:11,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:11,053 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 08:56:11,053 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-12-13 08:56:11,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:56:11,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 08:56:11,578 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-12-13 08:56:11,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:56:11,729 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-12-13 08:56:12,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:12,112 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 08:56:12,112 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-12-13 08:56:12,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:56:12,306 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-12-13 08:56:12,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 31 treesize of output 15 [2022-12-13 08:56:13,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:56:13,057 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-12-13 08:56:13,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:13,732 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 08:56:13,732 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-12-13 08:56:14,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:56:14,158 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-12-13 08:56:15,220 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-12-13 08:56:15,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:56:15,510 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-12-13 08:56:16,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:16,331 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 08:56:16,331 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-12-13 08:56:16,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:56:16,837 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-12-13 08:56:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 25593 backedges. 16142 proven. 2698 refuted. 0 times theorem prover too weak. 6753 trivial. 0 not checked. [2022-12-13 08:56:17,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:56:18,016 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168| Int) (v_ArrVal_13639 (Array Int Int)) (v_ArrVal_13640 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_13639) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168| (select .cse0 .cse1))) (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168|) |c_~#queue~0.offset|) v_ArrVal_13640) .cse1)))))) is different from false [2022-12-13 08:56:18,717 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13636 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168| Int) (v_ArrVal_13639 (Array Int Int)) (v_ArrVal_13640 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13636) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13639) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168|) |c_~#queue~0.offset|) v_ArrVal_13640) .cse1) 800))))) is different from false [2022-12-13 08:56:18,863 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13636 Int) (v_ArrVal_13633 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168| Int) (v_ArrVal_13639 (Array Int Int)) (v_ArrVal_13640 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13633)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13636) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13639) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168|) |c_~#queue~0.offset|) v_ArrVal_13640) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168| (select .cse0 .cse1)))))) is different from false [2022-12-13 08:56:18,934 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_13636 Int) (v_ArrVal_13633 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168| Int) (v_ArrVal_13639 (Array Int Int)) (v_ArrVal_13640 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13633))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13636) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13639) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168| (select .cse0 .cse1))) (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168|) |c_~#queue~0.offset|) v_ArrVal_13640) .cse1)))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| (select .cse4 .cse3)))))) is different from false [2022-12-13 08:56:18,969 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| Int) (v_ArrVal_13636 Int) (v_ArrVal_13633 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168| Int) (v_ArrVal_13639 (Array Int Int)) (v_ArrVal_13640 Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse4 (store .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171|)) v_ArrVal_13633))) (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_13636) .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13639) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168|) |c_~#queue~0.offset|) v_ArrVal_13640) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| (select .cse2 .cse3))))))) is different from false [2022-12-13 08:56:19,792 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| Int) (v_ArrVal_13632 (Array Int Int)) (v_ArrVal_13636 Int) (v_ArrVal_13633 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168| Int) (v_ArrVal_13639 (Array Int Int)) (v_ArrVal_13640 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem46#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_13632))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171|)) v_ArrVal_13633))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_13636) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13639) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168|) |c_~#queue~0.offset|) v_ArrVal_13640) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| (select .cse2 .cse1)))))))) is different from false [2022-12-13 08:56:20,291 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| Int) (v_ArrVal_13628 Int) (v_ArrVal_13632 (Array Int Int)) (v_ArrVal_13636 Int) (v_ArrVal_13633 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168| Int) (v_ArrVal_13639 (Array Int Int)) (v_ArrVal_13640 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13628) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13632))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171|)) v_ArrVal_13633))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_13636) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13639) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168|) |c_~#queue~0.offset|) v_ArrVal_13640) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| (select .cse2 .cse1)))))))) is different from false [2022-12-13 08:56:20,572 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| Int) (v_ArrVal_13628 Int) (v_ArrVal_13627 Int) (v_ArrVal_13632 (Array Int Int)) (v_ArrVal_13636 Int) (v_ArrVal_13633 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168| Int) (v_ArrVal_13639 (Array Int Int)) (v_ArrVal_13640 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13627)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13628) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13632))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171|)) v_ArrVal_13633))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_13636) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13639) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168|) |c_~#queue~0.offset|) v_ArrVal_13640) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| (select .cse2 .cse1)))))))) is different from false [2022-12-13 08:56:20,714 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| Int) (v_ArrVal_13628 Int) (v_ArrVal_13627 Int) (v_ArrVal_13632 (Array Int Int)) (v_ArrVal_13636 Int) (v_ArrVal_13633 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168| Int) (v_ArrVal_13639 (Array Int Int)) (v_ArrVal_13640 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse7 (+ (* (select .cse7 .cse6) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13627)))) (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13628) .cse6 (+ (select .cse5 .cse6) 1))))) |c_~#stored_elements~0.base| v_ArrVal_13632))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171|)) v_ArrVal_13633))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_13636) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13639) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| (select .cse0 .cse1))) (not (= (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168|) |c_~#queue~0.offset|) v_ArrVal_13640) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168| (select .cse2 .cse1)))))))) is different from false [2022-12-13 08:56:20,763 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| Int) (v_ArrVal_13628 Int) (v_ArrVal_13627 Int) (v_ArrVal_13632 (Array Int Int)) (v_ArrVal_13636 Int) (v_ArrVal_13633 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168| Int) (v_ArrVal_13639 (Array Int Int)) (v_ArrVal_13640 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse5 (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse7 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse7 .cse6) 4)) v_ArrVal_13627)))) (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_13628) .cse6 (+ (select .cse5 .cse6) 1))))) |c_~#stored_elements~0.base| v_ArrVal_13632))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171|)) v_ArrVal_13633))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_13636) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13639) |c_~#queue~0.base|))) (or (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168|) |c_~#queue~0.offset|) v_ArrVal_13640) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_168| (select .cse0 .cse1)))))))) is different from false [2022-12-13 08:56:29,009 INFO L321 Elim1Store]: treesize reduction 1121, result has 28.6 percent of original size [2022-12-13 08:56:29,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 3442 treesize of output 1128 [2022-12-13 08:56:29,120 INFO L321 Elim1Store]: treesize reduction 52, result has 13.3 percent of original size [2022-12-13 08:56:29,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 1325 treesize of output 1506 [2022-12-13 08:56:31,460 INFO L321 Elim1Store]: treesize reduction 169, result has 36.0 percent of original size [2022-12-13 08:56:31,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 11 new quantified variables, introduced 41 case distinctions, treesize of input 1921 treesize of output 6461 [2022-12-13 08:56:31,724 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 841 treesize of output 793 [2022-12-13 08:56:31,871 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 1001 treesize of output 965 [2022-12-13 08:56:34,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-13 08:56:34,839 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-12-13 08:56:34,868 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-12-13 08:56:40,871 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:56:40,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 441 treesize of output 555 [2022-12-13 08:56:41,839 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-12-13 08:56:41,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 4003 treesize of output 3729 [2022-12-13 08:56:42,014 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 3061 treesize of output 3057 [2022-12-13 08:56:42,129 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 3057 treesize of output 3053 [2022-12-13 08:56:42,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 3053 treesize of output 3049 [2022-12-13 08:56:42,388 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 3049 treesize of output 3045 [2022-12-13 08:56:42,629 INFO L321 Elim1Store]: treesize reduction 5, result has 83.9 percent of original size [2022-12-13 08:56:42,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 103 [2022-12-13 08:56:42,688 INFO L321 Elim1Store]: treesize reduction 5, result has 83.9 percent of original size [2022-12-13 08:56:42,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 103 [2022-12-13 08:56:42,802 INFO L321 Elim1Store]: treesize reduction 5, result has 93.2 percent of original size [2022-12-13 08:56:42,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 119 treesize of output 163 [2022-12-13 08:56:42,917 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:56:42,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 114 [2022-12-13 08:56:43,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:56:43,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 114 [2022-12-13 08:56:43,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2022-12-13 08:56:43,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2022-12-13 08:56:43,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,121 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:56:43,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 82 [2022-12-13 08:56:43,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2022-12-13 08:56:43,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,181 INFO L321 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2022-12-13 08:56:43,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 1 [2022-12-13 08:56:43,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 68 [2022-12-13 08:56:43,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 68 [2022-12-13 08:56:43,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,283 INFO L321 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2022-12-13 08:56:43,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 113 [2022-12-13 08:56:43,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 68 [2022-12-13 08:56:43,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,361 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,361 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 72 [2022-12-13 08:56:43,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,382 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,402 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:56:43,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 118 [2022-12-13 08:56:43,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,483 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-12-13 08:56:43,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 83 [2022-12-13 08:56:43,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,532 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2022-12-13 08:56:43,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 100 [2022-12-13 08:56:43,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2022-12-13 08:56:43,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2022-12-13 08:56:43,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,651 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:56:43,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 82 [2022-12-13 08:56:43,712 INFO L321 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2022-12-13 08:56:43,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 109 [2022-12-13 08:56:43,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2022-12-13 08:56:43,819 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:56:43,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 114 [2022-12-13 08:56:43,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,861 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,862 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:56:43,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 78 [2022-12-13 08:56:43,927 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-13 08:56:43,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 350 treesize of output 218 [2022-12-13 08:56:43,937 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 08:56:43,937 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 230 treesize of output 206 [2022-12-13 08:56:43,953 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:56:43,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 202 treesize of output 190 [2022-12-13 08:56:44,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:56:44,019 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 251 treesize of output 183 [2022-12-13 08:56:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 25593 backedges. 15215 proven. 1025 refuted. 9 times theorem prover too weak. 8297 trivial. 1047 not checked. [2022-12-13 08:56:45,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499549551] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:56:45,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:56:45,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 33, 38] total 130 [2022-12-13 08:56:45,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13787049] [2022-12-13 08:56:45,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:56:45,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2022-12-13 08:56:45,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:56:45,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2022-12-13 08:56:45,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1806, Invalid=12477, Unknown=37, NotChecked=2450, Total=16770 [2022-12-13 08:56:45,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:56:45,350 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 08:56:45,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 130 states have (on average 16.415384615384614) internal successors, (2134), 130 states have internal predecessors, (2134), 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-12-13 08:56:45,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:56:45,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:56:45,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:56:45,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:56:45,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:56:45,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:56:45,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:56:45,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:56:45,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:56:45,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:56:45,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:56:45,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-12-13 08:56:45,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:56:45,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:56:45,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2022-12-13 08:56:45,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:56:45,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:56:45,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:56:45,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-12-13 08:56:45,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:57:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 08:57:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:57:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:57:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:57:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:57:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:57:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:57:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:57:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:57:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:57:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:57:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 08:57:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:57:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:57:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-12-13 08:57:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:57:53,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:57:53,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 08:57:53,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-12-13 08:57:53,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-12-13 08:57:53,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 08:57:53,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:57:53,583 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 08:57:53,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:57:53,585 INFO L85 PathProgramCache]: Analyzing trace with hash -869403701, now seen corresponding path program 1 times [2022-12-13 08:57:53,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:57:53,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594636316] [2022-12-13 08:57:53,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:57:53,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:57:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:59:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 9630 backedges. 12 proven. 9088 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2022-12-13 08:59:29,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:59:29,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594636316] [2022-12-13 08:59:29,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594636316] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:59:29,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979329081] [2022-12-13 08:59:29,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:59:29,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:59:29,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 08:59:29,414 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:59:29,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1ae9910-27f4-49c3-90df-a7848bc33112/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 08:59:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:59:31,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 4618 conjuncts, 293 conjunts are in the unsatisfiable core [2022-12-13 08:59:31,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:59:31,179 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 08:59:31,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 08:59:31,492 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-12-13 08:59:31,643 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-12-13 08:59:32,054 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-12-13 08:59:32,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:59:32,397 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 08:59:32,398 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-12-13 08:59:32,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:32,512 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-12-13 08:59:32,855 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-12-13 08:59:32,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:32,982 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-12-13 08:59:33,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:59:33,351 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 08:59:33,351 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-12-13 08:59:33,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:33,517 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-12-13 08:59:33,908 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-12-13 08:59:34,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:34,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-12-13 08:59:34,442 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:59:34,450 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 08:59:34,450 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-12-13 08:59:34,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:34,680 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-12-13 08:59:35,314 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-12-13 08:59:35,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:35,478 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-12-13 08:59:35,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:59:35,952 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 08:59:35,952 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-12-13 08:59:36,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:36,269 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-12-13 08:59:37,110 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-12-13 08:59:37,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:37,342 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-12-13 08:59:37,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:59:37,952 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 08:59:37,952 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-12-13 08:59:38,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:38,378 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-12-13 08:59:39,434 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-12-13 08:59:39,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:39,716 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-12-13 08:59:40,524 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:59:40,534 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 08:59:40,535 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-12-13 08:59:41,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:41,068 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-12-13 08:59:42,334 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-12-13 08:59:42,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:42,649 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-12-13 08:59:42,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:59:42,995 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 08:59:42,996 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-12-13 08:59:43,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:43,111 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-12-13 08:59:43,412 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-12-13 08:59:43,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:43,515 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-12-13 08:59:43,832 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:59:43,837 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 08:59:43,837 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-12-13 08:59:43,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:43,964 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-12-13 08:59:44,416 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-12-13 08:59:44,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:44,564 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-12-13 08:59:44,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:59:44,947 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 08:59:44,948 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-12-13 08:59:45,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:45,095 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-12-13 08:59:45,648 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-12-13 08:59:45,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:45,848 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-12-13 08:59:46,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:59:46,416 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 08:59:46,417 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-12-13 08:59:46,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:46,705 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-12-13 08:59:47,600 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-12-13 08:59:47,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:47,779 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-12-13 08:59:48,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:59:48,377 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 08:59:48,378 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-12-13 08:59:48,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:48,781 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-12-13 08:59:49,882 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-12-13 08:59:50,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:50,180 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-12-13 08:59:50,609 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:59:50,617 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 08:59:50,618 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-12-13 08:59:50,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:59:50,794 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-12-13 08:59:50,886 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-12-13 08:59:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 9630 backedges. 3980 proven. 5104 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2022-12-13 08:59:50,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:59:51,301 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16147 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)) is different from false [2022-12-13 09:00:24,369 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16145 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16144 Int) (v_ArrVal_16142 Int) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16138 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse4 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse0 .cse1))) (< (+ .cse2 1) v_ArrVal_16145) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem46#1| 1) v_ArrVal_16138) (= .cse2 800) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_16144) .cse1 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse1) 800))))))) is different from false [2022-12-13 09:00:27,452 WARN L837 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork1_enqueue_#t~mem44#1| 800) (forall ((v_ArrVal_16145 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16144 Int) (v_ArrVal_16142 Int) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16138 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse6 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse0 .cse1))) (< (+ .cse2 1) v_ArrVal_16145) (< (+ (select .cse3 .cse4) 1) v_ArrVal_16138) (= .cse2 800) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_16144) .cse1 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse1) 800))))))))) is different from false [2022-12-13 09:00:34,188 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16145 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16144 Int) (v_ArrVal_16142 Int) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16138 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int)) (let ((.cse6 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16135)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16136) .cse7 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select .cse6 .cse7)) (.cse5 (select .cse1 .cse2))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_16144) .cse2 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse2) 800) (< (+ .cse3 1) v_ArrVal_16138) (= 800 .cse3) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse4 .cse2))) (= .cse5 800) (< (+ .cse5 1) v_ArrVal_16145)))))))) is different from false [2022-12-13 09:00:34,431 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16145 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16144 Int) (v_ArrVal_16142 Int) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16138 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int)) (let ((.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse6 (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse8 (+ (* (select .cse8 .cse7) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16135)))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16136) .cse7 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select .cse6 .cse7)) (.cse3 (select .cse1 .cse2))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_16144) .cse2 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse2) 800) (= 800 .cse3) (< (+ .cse4 1) v_ArrVal_16138) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse5 .cse2))) (= .cse4 800) (< (+ .cse3 1) v_ArrVal_16145))))))))) is different from false [2022-12-13 09:00:34,508 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16145 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16144 Int) (v_ArrVal_16142 Int) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16138 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int)) (let ((.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse6 (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse8 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse8 .cse7) 4)) v_ArrVal_16135)))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_16136) .cse7 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse4 (select .cse1 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse2 .cse3)) (.cse5 (select .cse6 .cse7))) (or (< (+ .cse0 1) v_ArrVal_16145) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_16144) .cse3 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse3) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse4 .cse3))) (< (+ .cse5 1) v_ArrVal_16138) (= 800 .cse0) (= .cse5 800))))))))) is different from false [2022-12-13 09:00:47,449 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16145 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16144 Int) (v_ArrVal_16142 Int) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16138 Int) (v_ArrVal_16136 Int) (v_ArrVal_16133 (Array Int Int)) (v_ArrVal_16135 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post47#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse7 (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_16135))) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_16136) .cse1 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse2 (select .cse7 .cse1)) (.cse3 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse0 .cse1))) (= 800 .cse2) (< (+ .cse2 1) v_ArrVal_16138) (= .cse3 800) (< (+ .cse3 1) v_ArrVal_16145) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_16144) .cse1 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse1) 800))))))))) is different from false [2022-12-13 09:00:47,493 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16145 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16144 Int) (v_ArrVal_16142 Int) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16138 Int) (v_ArrVal_16136 Int) (v_ArrVal_16133 (Array Int Int)) (v_ArrVal_16135 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem46#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse7 (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) v_ArrVal_16135))) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_16136) .cse3 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse4 (select .cse7 .cse3)) (.cse6 (select .cse1 .cse3))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_16144) .cse3 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse3) 800) (< (+ .cse4 1) v_ArrVal_16138) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse5 .cse3))) (= 800 .cse4) (< (+ .cse6 1) v_ArrVal_16145) (= .cse6 800))))))))) is different from false [2022-12-13 09:00:59,507 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse12 (select .cse10 .cse11))) (or (forall ((v_ArrVal_16145 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16144 Int) (v_ArrVal_16142 Int) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16138 Int) (v_ArrVal_16136 Int) (v_ArrVal_16133 (Array Int Int)) (v_ArrVal_16135 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse10 .cse11 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse7 (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) v_ArrVal_16135))) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_16136) .cse3 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse5 (select .cse1 .cse3)) (.cse6 (select .cse7 .cse3))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_16144) .cse3 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse3) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse4 .cse3))) (< (+ .cse5 1) v_ArrVal_16145) (< (+ .cse6 1) v_ArrVal_16138) (= .cse5 800) (= .cse6 800))))))))) (= .cse12 800)))) is different from false [2022-12-13 09:00:59,977 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse11 .cse12))) (or (= .cse0 800) (forall ((v_ArrVal_16145 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16144 Int) (v_ArrVal_16142 Int) (v_ArrVal_16130 Int) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16138 Int) (v_ArrVal_16136 Int) (v_ArrVal_16133 (Array Int Int)) (v_ArrVal_16135 Int)) (let ((.cse6 (+ |c_~#queue~0.offset| 3204)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse11 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16130) .cse12 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse8 (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_16135))) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse5 v_ArrVal_16136) .cse6 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse2 (select .cse8 .cse6)) (.cse1 (select .cse4 .cse6))) (or (< (+ .cse1 1) v_ArrVal_16145) (= 800 .cse2) (< (+ .cse2 1) v_ArrVal_16138) (= 800 .cse1) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_16144) .cse6 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse6) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse7 .cse6)))))))))))))) is different from false [2022-12-13 09:01:00,758 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16142 Int) (v_ArrVal_16130 Int) (v_ArrVal_16128 Int) (v_ArrVal_16138 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16133 (Array Int Int))) (let ((.cse11 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16128)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select .cse11 .cse12))) (let ((.cse6 (+ |c_~#queue~0.offset| 3204)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse11 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16130) .cse12 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse8 (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse6) 4)) v_ArrVal_16135))) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse5 v_ArrVal_16136) .cse6 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse0 (select .cse4 .cse6)) (.cse1 (select .cse8 .cse6))) (or (= 800 .cse0) (< (+ .cse0 1) v_ArrVal_16145) (< (+ .cse1 1) v_ArrVal_16138) (= 800 .cse2) (= .cse1 800) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_16144) .cse6 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse6) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse7 .cse6))))))))))))) is different from false [2022-12-13 09:01:01,176 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse0 .cse1))) (forall ((v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16142 Int) (v_ArrVal_16130 Int) (v_ArrVal_16128 Int) (v_ArrVal_16138 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16133 (Array Int Int))) (let ((.cse13 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse9 (select .cse13 .cse1))) (let ((.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse13 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16130) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse10 (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_16135))) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse2 (store (store .cse11 |c_~#queue~0.base| (store (store .cse10 .cse4 v_ArrVal_16136) .cse5 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse8 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse6 (select .cse10 .cse5)) (.cse7 (select .cse3 .cse5))) (or (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_16144) .cse5 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse5) 800) (< (+ .cse6 1) v_ArrVal_16138) (= .cse7 800) (= .cse6 800) (< (+ .cse7 1) v_ArrVal_16145) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse8 .cse5))) (= .cse9 800)))))))))))))) is different from false [2022-12-13 09:01:01,357 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16142 Int) (v_ArrVal_16130 Int) (v_ArrVal_16128 Int) (v_ArrVal_16138 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16133 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse13 (store .cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse9 (select .cse13 .cse4))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse13 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_16130) .cse4 (+ 1 .cse9))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse10 (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse1) 4)) v_ArrVal_16135))) (.cse8 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse11 |c_~#queue~0.base| (store (store .cse10 .cse8 v_ArrVal_16136) .cse1 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse2 (select .cse10 .cse1)) (.cse5 (select .cse7 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse0 .cse1))) (< (+ .cse2 1) v_ArrVal_16138) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse3 .cse4))) (< (+ .cse5 1) v_ArrVal_16145) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_16144) .cse1 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse1) 800) (= .cse2 800) (= .cse5 800) (= 800 .cse9)))))))))))) is different from false [2022-12-13 09:01:18,599 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16142 Int) (v_ArrVal_16130 Int) (v_ArrVal_16128 Int) (v_ArrVal_16138 Int) (v_ArrVal_16136 Int) (v_ArrVal_16124 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16133 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse5 (select .cse12 |c_~#queue~0.base|))) (let ((.cse13 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select .cse13 .cse3))) (let ((.cse10 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse8 v_ArrVal_16130) .cse3 (+ 1 .cse0))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse9 (let ((.cse11 (select .cse10 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_16135)))) (let ((.cse6 (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse8 v_ArrVal_16136) .cse3 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse4 (select .cse7 .cse3)) (.cse1 (select .cse9 .cse3))) (or (= 800 .cse0) (< (+ .cse1 1) v_ArrVal_16138) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse2 .cse3))) (= .cse4 800) (< (+ .cse4 1) v_ArrVal_16145) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse5 .cse3))) (not (<= v_ArrVal_16124 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post47#1| 1))) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_16144) .cse3 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse3) 800) (= .cse1 800))))))))))))) is different from false [2022-12-13 09:01:19,523 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16142 Int) (v_ArrVal_16130 Int) (v_ArrVal_16128 Int) (v_ArrVal_16138 Int) (v_ArrVal_16136 Int) (v_ArrVal_16124 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16133 (Array Int Int))) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse9 .cse10 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse5 (select .cse14 |c_~#queue~0.base|))) (let ((.cse15 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select .cse15 .cse3))) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse8 v_ArrVal_16130) .cse3 (+ 1 .cse0))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse11 (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_16135)))) (let ((.cse6 (store (store .cse12 |c_~#queue~0.base| (store (store .cse11 .cse8 v_ArrVal_16136) .cse3 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse4 (select .cse7 .cse3)) (.cse1 (select .cse11 .cse3))) (or (= 800 .cse0) (< (+ .cse1 1) v_ArrVal_16138) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse2 .cse3))) (= .cse4 800) (< (+ .cse4 1) v_ArrVal_16145) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse5 .cse3))) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_16144) .cse3 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse3) 800) (= .cse1 800) (< (+ (select .cse9 .cse10) 1) v_ArrVal_16124)))))))))))))) is different from false [2022-12-13 09:01:20,801 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16142 Int) (v_ArrVal_16130 Int) (v_ArrVal_16128 Int) (v_ArrVal_16138 Int) (v_ArrVal_16136 Int) (v_ArrVal_16124 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16133 (Array Int Int))) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16123) .cse10 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse8 (select .cse14 |c_~#queue~0.base|))) (let ((.cse15 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select .cse15 .cse5))) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse4 v_ArrVal_16130) .cse5 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse11 (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_16135)))) (let ((.cse2 (store (store .cse12 |c_~#queue~0.base| (store (store .cse11 .cse4 v_ArrVal_16136) .cse5 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse1 (select .cse11 .cse5)) (.cse0 (select .cse3 .cse5))) (or (< (+ .cse0 1) v_ArrVal_16145) (= .cse1 800) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_16144) .cse5 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse5) 800) (< (+ .cse1 1) v_ArrVal_16138) (= .cse6 800) (= .cse0 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse7 .cse5))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse8 .cse5))) (< (+ (select .cse9 .cse10) 1) v_ArrVal_16124)))))))))))))) is different from false [2022-12-13 09:01:21,935 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16130 Int) (v_ArrVal_16128 Int) (v_ArrVal_16138 Int) (v_ArrVal_16136 Int) (v_ArrVal_16124 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16133 (Array Int Int))) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16120)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16123) .cse5 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse10 (select .cse14 |c_~#queue~0.base|))) (let ((.cse15 (store .cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (select .cse15 .cse3))) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse2 v_ArrVal_16130) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse11 (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_16135)))) (let ((.cse0 (store (store .cse12 |c_~#queue~0.base| (store (store .cse11 .cse2 v_ArrVal_16136) .cse3 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse8 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse6 (select .cse11 .cse3)) (.cse9 (select .cse1 .cse3))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_16144) .cse3 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse3) 800) (< (+ (select .cse4 .cse5) 1) v_ArrVal_16124) (< (+ .cse6 1) v_ArrVal_16138) (= 800 .cse7) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse8 .cse3))) (= 800 .cse6) (= 800 .cse9) (< (+ .cse9 1) v_ArrVal_16145) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse10 .cse3)))))))))))))))) is different from false [2022-12-13 09:01:25,565 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16130 Int) (v_ArrVal_16128 Int) (v_ArrVal_16138 Int) (v_ArrVal_16136 Int) (v_ArrVal_16124 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16133 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse6 (store .cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse15 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_16123) .cse5 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse10 (select .cse15 |c_~#queue~0.base|))) (let ((.cse16 (store .cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse11 (select .cse16 .cse3))) (let ((.cse13 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse2 v_ArrVal_16130) .cse3 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse12 (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_16135)))) (let ((.cse0 (store (store .cse13 |c_~#queue~0.base| (store (store .cse12 .cse2 v_ArrVal_16136) .cse3 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse9 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse7 (select .cse12 .cse3)) (.cse8 (select .cse1 .cse3))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_16144) .cse3 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse3) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse4 .cse5))) (< (+ (select .cse6 .cse5) 1) v_ArrVal_16124) (< (+ .cse7 1) v_ArrVal_16138) (= .cse8 800) (= .cse7 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse9 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse10 .cse3))) (< (+ .cse8 1) v_ArrVal_16145) (= .cse11 800))))))))))))))) is different from false [2022-12-13 09:02:08,722 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16130 Int) (v_ArrVal_16118 Int) (v_ArrVal_16128 Int) (v_ArrVal_16138 Int) (v_ArrVal_16136 Int) (v_ArrVal_16124 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16133 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse6 (select .cse16 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (store (store .cse5 .cse2 v_ArrVal_16123) .cse3 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse8 (select .cse14 |c_~#queue~0.base|))) (let ((.cse15 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse9 (select .cse15 .cse3))) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse2 v_ArrVal_16130) .cse3 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse11 (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_16135)))) (let ((.cse0 (store (store .cse12 |c_~#queue~0.base| (store (store .cse11 .cse2 v_ArrVal_16136) .cse3 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse7 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse4 (select .cse11 .cse3)) (.cse10 (select .cse1 .cse3))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_16144) .cse3 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse3) 800) (= .cse4 800) (< (+ (select .cse5 .cse3) 1) v_ArrVal_16124) (< (+ .cse4 1) v_ArrVal_16138) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse6 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse7 .cse3))) (not (<= v_ArrVal_16118 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post47#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse8 .cse3))) (= 800 .cse9) (< (+ .cse10 1) v_ArrVal_16145) (= .cse10 800)))))))))))))))) is different from false [2022-12-13 09:02:08,828 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16130 Int) (v_ArrVal_16118 Int) (v_ArrVal_16128 Int) (v_ArrVal_16138 Int) (v_ArrVal_16136 Int) (v_ArrVal_16124 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16133 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse6 (select .cse16 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (store (store .cse5 .cse2 v_ArrVal_16123) .cse3 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse8 (select .cse14 |c_~#queue~0.base|))) (let ((.cse15 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse9 (select .cse15 .cse3))) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse2 v_ArrVal_16130) .cse3 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse11 (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_16135)))) (let ((.cse0 (store (store .cse12 |c_~#queue~0.base| (store (store .cse11 .cse2 v_ArrVal_16136) .cse3 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse7 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse4 (select .cse11 .cse3)) (.cse10 (select .cse1 .cse3))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_16144) .cse3 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse3) 800) (= .cse4 800) (< (+ (select .cse5 .cse3) 1) v_ArrVal_16124) (< (+ .cse4 1) v_ArrVal_16138) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse6 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse7 .cse3))) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem46#1| 1) v_ArrVal_16118) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse8 .cse3))) (= 800 .cse9) (< (+ .cse10 1) v_ArrVal_16145) (= .cse10 800)))))))))))))))) is different from false [2022-12-13 09:02:26,221 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16130 Int) (v_ArrVal_16118 Int) (v_ArrVal_16128 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16124 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16133 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16114)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16116) .cse1 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse11 (select .cse18 |c_~#queue~0.base|))) (let ((.cse10 (store .cse11 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse16 (store (store .cse18 |c_~#queue~0.base| (store (store .cse10 .cse8 v_ArrVal_16123) .cse3 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse2 (select .cse16 |c_~#queue~0.base|))) (let ((.cse17 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse12 (select .cse17 .cse3))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse8 v_ArrVal_16130) .cse3 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse13 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_16135)))) (let ((.cse6 (store (store .cse14 |c_~#queue~0.base| (store (store .cse13 .cse8 v_ArrVal_16136) .cse3 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse5 (select .cse7 .cse3)) (.cse9 (select .cse13 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_16118) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse4 .cse3))) (< (+ .cse5 1) v_ArrVal_16145) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_16144) .cse3 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse3) 800) (= .cse5 800) (= .cse9 800) (< (+ .cse9 1) v_ArrVal_16138) (< (+ (select .cse10 .cse3) 1) v_ArrVal_16124) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse11 .cse3))) (= .cse12 800))))))))))))))))) is different from false [2022-12-13 09:02:26,912 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16130 Int) (v_ArrVal_16118 Int) (v_ArrVal_16128 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16124 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16133 (Array Int Int))) (let ((.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (let ((.cse19 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse19 (+ (* (select .cse19 .cse8) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16114)))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16116) .cse8 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse4 (select .cse18 |c_~#queue~0.base|))) (let ((.cse6 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120)) (.cse11 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse16 (store (store .cse18 |c_~#queue~0.base| (store (store .cse6 .cse11 v_ArrVal_16123) .cse2 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse12 (select .cse16 |c_~#queue~0.base|))) (let ((.cse17 (store .cse12 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse3 (select .cse17 .cse2))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse11 v_ArrVal_16130) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse13 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_16135)))) (let ((.cse9 (store (store .cse14 |c_~#queue~0.base| (store (store .cse13 .cse11 v_ArrVal_16136) .cse2 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse1 (select .cse9 |c_~#queue~0.base|))) (let ((.cse10 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse5 (select .cse13 .cse2)) (.cse0 (select .cse10 .cse2))) (or (< (+ .cse0 1) v_ArrVal_16145) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse1 .cse2))) (= 800 .cse3) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse4 .cse2))) (< (+ .cse5 1) v_ArrVal_16138) (= 800 .cse5) (= 800 .cse0) (< (+ (select .cse6 .cse2) 1) v_ArrVal_16124) (< (+ (select .cse7 .cse8) 1) v_ArrVal_16118) (< (select (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse11 v_ArrVal_16144) .cse2 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse2) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse12 .cse2)))))))))))))))))))) is different from false [2022-12-13 09:02:27,156 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16130 Int) (v_ArrVal_16118 Int) (v_ArrVal_16128 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16124 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16133 (Array Int Int))) (let ((.cse12 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse11 (let ((.cse19 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse19 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse19 .cse12) 4)) v_ArrVal_16114)))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse11 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_16116) .cse12 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse4 (select .cse18 |c_~#queue~0.base|))) (let ((.cse10 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120)) (.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse16 (store (store .cse18 |c_~#queue~0.base| (store (store .cse10 .cse9 v_ArrVal_16123) .cse1 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse6 (select .cse16 |c_~#queue~0.base|))) (let ((.cse17 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse5 (select .cse17 .cse1))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse9 v_ArrVal_16130) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse13 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse1) 4)) v_ArrVal_16135)))) (let ((.cse7 (store (store .cse14 |c_~#queue~0.base| (store (store .cse13 .cse9 v_ArrVal_16136) .cse1 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse2 (select .cse8 .cse1)) (.cse3 (select .cse13 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse0 .cse1))) (< (+ 1 .cse2) v_ArrVal_16145) (= 800 .cse3) (= 800 .cse2) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse4 .cse1))) (= 800 .cse5) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse6 .cse1))) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_16144) .cse1 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse1) 800) (< (+ (select .cse10 .cse1) 1) v_ArrVal_16124) (< (+ (select .cse11 .cse12) 1) v_ArrVal_16118) (< (+ .cse3 1) v_ArrVal_16138)))))))))))))))))) is different from false [2022-12-13 09:03:12,734 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16130 Int) (v_ArrVal_16118 Int) (v_ArrVal_16128 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16124 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16112 (Array Int Int)) (v_ArrVal_16133 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post47#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_16112))) (let ((.cse5 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_16114))) (.cse9 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_16116) .cse1 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse0 (select .cse17 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120))) (let ((.cse15 (store (store .cse17 |c_~#queue~0.base| (store (store .cse6 .cse9 v_ArrVal_16123) .cse1 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse4 (select .cse15 |c_~#queue~0.base|))) (let ((.cse16 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse11 (select .cse16 .cse1))) (let ((.cse13 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse9 v_ArrVal_16130) .cse1 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse12 (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (store .cse14 (+ (* 4 (select .cse14 .cse1)) |c_~#queue~0.offset|) v_ArrVal_16135)))) (let ((.cse7 (store (store .cse13 |c_~#queue~0.base| (store (store .cse12 .cse9 v_ArrVal_16136) .cse1 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse10 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse2 (select .cse12 .cse1)) (.cse3 (select .cse8 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse0 .cse1))) (< (+ .cse2 1) v_ArrVal_16138) (< (+ .cse3 1) v_ArrVal_16145) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse4 .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_16118) (< (+ (select .cse6 .cse1) 1) v_ArrVal_16124) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_16144) .cse1 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse1) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse10 .cse1))) (= .cse11 800) (= 800 .cse2) (= 800 .cse3)))))))))))))))))) is different from false [2022-12-13 09:03:21,781 WARN L837 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork1_enqueue_#t~mem44#1| 800) (forall ((v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16130 Int) (v_ArrVal_16118 Int) (v_ArrVal_16128 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16124 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16112 (Array Int Int)) (v_ArrVal_16133 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse21 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse20 .cse21 (+ (select .cse20 .cse21) 1)))) |c_~#stored_elements~0.base| v_ArrVal_16112))) (let ((.cse10 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_16114))) (.cse7 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_16116) .cse1 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse2 (select .cse17 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120))) (let ((.cse15 (store (store .cse17 |c_~#queue~0.base| (store (store .cse0 .cse7 v_ArrVal_16123) .cse1 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse4 (select .cse15 |c_~#queue~0.base|))) (let ((.cse16 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse9 (select .cse16 .cse1))) (let ((.cse13 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse7 v_ArrVal_16130) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse12 (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_16135)))) (let ((.cse5 (store (store .cse13 |c_~#queue~0.base| (store (store .cse12 .cse7 v_ArrVal_16136) .cse1 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse11 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse3 (select .cse6 .cse1)) (.cse8 (select .cse12 .cse1))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_16124) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse2 .cse1))) (= .cse3 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse4 .cse1))) (< (+ .cse3 1) v_ArrVal_16145) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_16144) .cse1 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse1) 800) (< (+ .cse8 1) v_ArrVal_16138) (= .cse9 800) (< (+ (select .cse10 .cse1) 1) v_ArrVal_16118) (= .cse8 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse11 .cse1))))))))))))))))))))) is different from false [2022-12-13 09:03:34,044 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse21 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse22 (select .cse20 .cse21))) (or (forall ((v_ArrVal_16130 Int) (v_ArrVal_16118 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16109 Int) (v_ArrVal_16128 Int) (v_ArrVal_16124 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16112 (Array Int Int)) (v_ArrVal_16133 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse20 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16109) .cse21 (+ .cse22 1))) |c_~#stored_elements~0.base| v_ArrVal_16112))) (let ((.cse5 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_16114))) (.cse11 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse5 .cse11 v_ArrVal_16116) .cse1 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse0 (select .cse17 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120))) (let ((.cse15 (store (store .cse17 |c_~#queue~0.base| (store (store .cse4 .cse11 v_ArrVal_16123) .cse1 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse3 (select .cse15 |c_~#queue~0.base|))) (let ((.cse16 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse6 (select .cse16 .cse1))) (let ((.cse13 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse11 v_ArrVal_16130) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse12 (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* 4 (select .cse14 .cse1))) v_ArrVal_16135)))) (let ((.cse9 (store (store .cse13 |c_~#queue~0.base| (store (store .cse12 .cse11 v_ArrVal_16136) .cse1 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse10 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse8 (select .cse10 .cse1)) (.cse7 (select .cse12 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_16124) (< (+ (select .cse5 .cse1) 1) v_ArrVal_16118) (= 800 .cse6) (= 800 .cse7) (= 800 .cse8) (< (+ .cse8 1) v_ArrVal_16145) (< (select (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse11 v_ArrVal_16144) .cse1 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse1) 800) (< (+ .cse7 1) v_ArrVal_16138)))))))))))))))))) (= .cse22 800)))) is different from false [2022-12-13 09:03:36,229 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16130 Int) (v_ArrVal_16118 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16109 Int) (v_ArrVal_16106 Int) (v_ArrVal_16128 Int) (v_ArrVal_16124 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16112 (Array Int Int)) (v_ArrVal_16133 (Array Int Int))) (let ((.cse21 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16106)) (.cse22 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse6 (select .cse21 .cse22))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse19 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse21 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16109) .cse22 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_16112))) (let ((.cse12 (let ((.cse20 (select .cse19 |c_~#queue~0.base|))) (store .cse20 (+ (* 4 (select .cse20 .cse2)) |c_~#queue~0.offset|) v_ArrVal_16114))) (.cse9 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse12 .cse9 v_ArrVal_16116) .cse2 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse10 (select .cse18 |c_~#queue~0.base|))) (let ((.cse3 (store .cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120))) (let ((.cse16 (store (store .cse18 |c_~#queue~0.base| (store (store .cse3 .cse9 v_ArrVal_16123) .cse2 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse1 (select .cse16 |c_~#queue~0.base|))) (let ((.cse17 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse0 (select .cse17 .cse2))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse9 v_ArrVal_16130) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse13 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse2) 4)) v_ArrVal_16135)))) (let ((.cse7 (store (store .cse14 |c_~#queue~0.base| (store (store .cse13 .cse9 v_ArrVal_16136) .cse2 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse5 (select .cse8 .cse2)) (.cse11 (select .cse13 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse1 .cse2))) (< (+ (select .cse3 .cse2) 1) v_ArrVal_16124) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse4 .cse2))) (= 800 .cse5) (< (+ .cse5 1) v_ArrVal_16145) (= 800 .cse6) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_16144) .cse2 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse2) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse10 .cse2))) (< (+ .cse11 1) v_ArrVal_16138) (< (+ (select .cse12 .cse2) 1) v_ArrVal_16118) (= 800 .cse11)))))))))))))))))))) is different from false [2022-12-13 09:03:37,123 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16130 Int) (v_ArrVal_16118 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16109 Int) (v_ArrVal_16106 Int) (v_ArrVal_16128 Int) (v_ArrVal_16124 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16112 (Array Int Int)) (v_ArrVal_16133 (Array Int Int))) (let ((.cse22 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse21 (let ((.cse23 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse23 (+ (* (select .cse23 .cse22) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16106)))) (let ((.cse11 (select .cse21 .cse22))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse19 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse21 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16109) .cse22 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_16112))) (let ((.cse9 (let ((.cse20 (select .cse19 |c_~#queue~0.base|))) (store .cse20 (+ |c_~#queue~0.offset| (* (select .cse20 .cse1) 4)) v_ArrVal_16114))) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_16116) .cse1 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse12 (select .cse18 |c_~#queue~0.base|))) (let ((.cse2 (store .cse12 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120))) (let ((.cse16 (store (store .cse18 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_16123) .cse1 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse0 (select .cse16 |c_~#queue~0.base|))) (let ((.cse17 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse10 (select .cse17 .cse1))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse6 v_ArrVal_16130) .cse1 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse13 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_16135)))) (let ((.cse4 (store (store .cse14 |c_~#queue~0.base| (store (store .cse13 .cse6 v_ArrVal_16136) .cse1 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse3 (select .cse13 .cse1)) (.cse8 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_16124) (= 800 .cse3) (< (+ .cse3 1) v_ArrVal_16138) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_16144) .cse1 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse1) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse7 .cse1))) (= .cse8 800) (< (+ (select .cse9 .cse1) 1) v_ArrVal_16118) (< (+ .cse8 1) v_ArrVal_16145) (= .cse10 800) (= 800 .cse11) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse12 .cse1))))))))))))))))))))))) is different from false [2022-12-13 09:03:37,405 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16130 Int) (v_ArrVal_16118 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16109 Int) (v_ArrVal_16106 Int) (v_ArrVal_16128 Int) (v_ArrVal_16124 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16112 (Array Int Int)) (v_ArrVal_16133 (Array Int Int))) (let ((.cse22 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse21 (let ((.cse23 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse23 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse23 .cse22) 4)) v_ArrVal_16106)))) (let ((.cse3 (select .cse21 .cse22))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse19 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse21 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_16109) .cse22 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_16112))) (let ((.cse4 (let ((.cse20 (select .cse19 |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_16114))) (.cse12 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse4 .cse12 v_ArrVal_16116) .cse2 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse1 (select .cse18 |c_~#queue~0.base|))) (let ((.cse7 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120))) (let ((.cse16 (store (store .cse18 |c_~#queue~0.base| (store (store .cse7 .cse12 v_ArrVal_16123) .cse2 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse5 (select .cse16 |c_~#queue~0.base|))) (let ((.cse17 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse8 (select .cse17 .cse2))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse12 v_ArrVal_16130) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse13 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_16135)))) (let ((.cse10 (store (store .cse14 |c_~#queue~0.base| (store (store .cse13 .cse12 v_ArrVal_16136) .cse2 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (let ((.cse11 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse0 (select .cse11 .cse2)) (.cse6 (select .cse13 .cse2))) (or (< (+ .cse0 1) v_ArrVal_16145) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse1 .cse2))) (= .cse0 800) (= .cse3 800) (< (+ (select .cse4 .cse2) 1) v_ArrVal_16118) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse5 .cse2))) (< (+ .cse6 1) v_ArrVal_16138) (< (+ (select .cse7 .cse2) 1) v_ArrVal_16124) (= 800 .cse8) (= 800 .cse6) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse9 .cse2))) (< (select (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse12 v_ArrVal_16144) .cse2 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse2) 800))))))))))))))))))))) is different from false [2022-12-13 09:04:01,810 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16130 Int) (v_ArrVal_16118 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16105 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16109 Int) (v_ArrVal_16106 Int) (v_ArrVal_16128 Int) (v_ArrVal_16124 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16112 (Array Int Int)) (v_ArrVal_16133 (Array Int Int))) (let ((.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse21 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem46#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_16105))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_16106)))) (let ((.cse12 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (select .cse22 .cse4))) (let ((.cse19 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse12 v_ArrVal_16109) .cse4 (+ 1 .cse2))) |c_~#stored_elements~0.base| v_ArrVal_16112))) (let ((.cse6 (let ((.cse20 (select .cse19 |c_~#queue~0.base|))) (store .cse20 (+ (* 4 (select .cse20 .cse4)) |c_~#queue~0.offset|) v_ArrVal_16114)))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse6 .cse12 v_ArrVal_16116) .cse4 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse3 (select .cse18 |c_~#queue~0.base|))) (let ((.cse7 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120))) (let ((.cse16 (store (store .cse18 |c_~#queue~0.base| (store (store .cse7 .cse12 v_ArrVal_16123) .cse4 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse9 (select .cse16 |c_~#queue~0.base|))) (let ((.cse17 (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse0 (select .cse17 .cse4))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse12 v_ArrVal_16130) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse13 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_16135)))) (let ((.cse10 (store (store .cse14 |c_~#queue~0.base| (store (store .cse13 .cse12 v_ArrVal_16136) .cse4 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse11 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse1 (select .cse11 .cse4)) (.cse5 (select .cse13 .cse4))) (or (= .cse0 800) (= 800 .cse1) (= 800 .cse2) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse3 .cse4))) (< (+ .cse5 1) v_ArrVal_16138) (< (+ (select .cse6 .cse4) 1) v_ArrVal_16118) (< (+ .cse1 1) v_ArrVal_16145) (< (+ (select .cse7 .cse4) 1) v_ArrVal_16124) (= .cse5 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse8 .cse4))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse9 .cse4))) (< (select (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse12 v_ArrVal_16144) .cse4 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse4) 800))))))))))))))))))))) is different from false [2022-12-13 09:04:02,697 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16130 Int) (v_ArrVal_16118 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16105 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16109 Int) (v_ArrVal_16106 Int) (v_ArrVal_16128 Int) (v_ArrVal_16124 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16112 (Array Int Int)) (v_ArrVal_16133 (Array Int Int))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse21 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse24 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse25 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse24 .cse25 (+ (select .cse24 .cse25) 1)))) |c_~#stored_elements~0.base| v_ArrVal_16105))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_16106)))) (let ((.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select .cse22 .cse3))) (let ((.cse19 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse9 v_ArrVal_16109) .cse3 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_16112))) (let ((.cse5 (let ((.cse20 (select .cse19 |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_16114)))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_16116) .cse3 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse11 (select .cse18 |c_~#queue~0.base|))) (let ((.cse10 (store .cse11 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120))) (let ((.cse16 (store (store .cse18 |c_~#queue~0.base| (store (store .cse10 .cse9 v_ArrVal_16123) .cse3 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse12 (select .cse16 |c_~#queue~0.base|))) (let ((.cse17 (store .cse12 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse4 (select .cse17 .cse3))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse9 v_ArrVal_16130) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse13 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* 4 (select .cse15 .cse3))) v_ArrVal_16135)))) (let ((.cse7 (store (store .cse14 |c_~#queue~0.base| (store (store .cse13 .cse9 v_ArrVal_16136) .cse3 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse0 (select .cse8 .cse3)) (.cse1 (select .cse13 .cse3))) (or (= 800 .cse0) (< (+ .cse1 1) v_ArrVal_16138) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse2 .cse3))) (= 800 .cse4) (< (+ (select .cse5 .cse3) 1) v_ArrVal_16118) (= .cse6 800) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_16144) .cse3 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse3) 800) (< (+ (select .cse10 .cse3) 1) v_ArrVal_16124) (< (+ .cse0 1) v_ArrVal_16145) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse11 .cse3))) (= 800 .cse1) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse12 .cse3))))))))))))))))))))))) is different from false [2022-12-13 09:04:03,005 WARN L837 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork1_enqueue_#t~mem44#1| 800) (forall ((v_ArrVal_16130 Int) (v_ArrVal_16118 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16105 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16109 Int) (v_ArrVal_16106 Int) (v_ArrVal_16128 Int) (v_ArrVal_16124 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16112 (Array Int Int)) (v_ArrVal_16133 (Array Int Int))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse21 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse24 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse25 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse24 .cse25 (+ (select .cse24 .cse25) 1)))) |c_~#stored_elements~0.base| v_ArrVal_16105))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_16106)))) (let ((.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select .cse22 .cse3))) (let ((.cse19 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse9 v_ArrVal_16109) .cse3 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_16112))) (let ((.cse5 (let ((.cse20 (select .cse19 |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_16114)))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_16116) .cse3 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse11 (select .cse18 |c_~#queue~0.base|))) (let ((.cse10 (store .cse11 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120))) (let ((.cse16 (store (store .cse18 |c_~#queue~0.base| (store (store .cse10 .cse9 v_ArrVal_16123) .cse3 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse12 (select .cse16 |c_~#queue~0.base|))) (let ((.cse17 (store .cse12 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse4 (select .cse17 .cse3))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse9 v_ArrVal_16130) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse13 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* 4 (select .cse15 .cse3))) v_ArrVal_16135)))) (let ((.cse7 (store (store .cse14 |c_~#queue~0.base| (store (store .cse13 .cse9 v_ArrVal_16136) .cse3 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse0 (select .cse8 .cse3)) (.cse1 (select .cse13 .cse3))) (or (= 800 .cse0) (< (+ .cse1 1) v_ArrVal_16138) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse2 .cse3))) (= 800 .cse4) (< (+ (select .cse5 .cse3) 1) v_ArrVal_16118) (= .cse6 800) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_16144) .cse3 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse3) 800) (< (+ (select .cse10 .cse3) 1) v_ArrVal_16124) (< (+ .cse0 1) v_ArrVal_16145) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse11 .cse3))) (= 800 .cse1) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse12 .cse3)))))))))))))))))))))))) is different from false [2022-12-13 09:04:03,936 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse24 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse25 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse26 (select .cse24 .cse25))) (or (forall ((v_ArrVal_16130 Int) (v_ArrVal_16118 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16105 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16109 Int) (v_ArrVal_16106 Int) (v_ArrVal_16128 Int) (v_ArrVal_16124 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16112 (Array Int Int)) (v_ArrVal_16133 (Array Int Int))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse21 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse24 .cse25 (+ .cse26 1))) |c_~#stored_elements~0.base| v_ArrVal_16105))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_16106)))) (let ((.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select .cse22 .cse3))) (let ((.cse19 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse9 v_ArrVal_16109) .cse3 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_16112))) (let ((.cse5 (let ((.cse20 (select .cse19 |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_16114)))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_16116) .cse3 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse11 (select .cse18 |c_~#queue~0.base|))) (let ((.cse10 (store .cse11 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120))) (let ((.cse16 (store (store .cse18 |c_~#queue~0.base| (store (store .cse10 .cse9 v_ArrVal_16123) .cse3 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse12 (select .cse16 |c_~#queue~0.base|))) (let ((.cse17 (store .cse12 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse4 (select .cse17 .cse3))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse9 v_ArrVal_16130) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse13 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* 4 (select .cse15 .cse3))) v_ArrVal_16135)))) (let ((.cse7 (store (store .cse14 |c_~#queue~0.base| (store (store .cse13 .cse9 v_ArrVal_16136) .cse3 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse0 (select .cse8 .cse3)) (.cse1 (select .cse13 .cse3))) (or (= 800 .cse0) (< (+ .cse1 1) v_ArrVal_16138) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse2 .cse3))) (= 800 .cse4) (< (+ (select .cse5 .cse3) 1) v_ArrVal_16118) (= .cse6 800) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_16144) .cse3 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse3) 800) (< (+ (select .cse10 .cse3) 1) v_ArrVal_16124) (< (+ .cse0 1) v_ArrVal_16145) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse11 .cse3))) (= 800 .cse1) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse12 .cse3))))))))))))))))))))))) (= .cse26 800)))) is different from false [2022-12-13 09:04:05,490 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse24 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse25 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse26 (select .cse24 .cse25))) (or (forall ((v_ArrVal_16130 Int) (v_ArrVal_16118 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16105 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16101 Int) (v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16109 Int) (v_ArrVal_16106 Int) (v_ArrVal_16128 Int) (v_ArrVal_16124 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16112 (Array Int Int)) (v_ArrVal_16133 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse21 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse24 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16101) .cse25 (+ .cse26 1))) |c_~#stored_elements~0.base| v_ArrVal_16105))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* (select .cse23 .cse1) 4)) v_ArrVal_16106)))) (let ((.cse12 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select .cse22 .cse1))) (let ((.cse19 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse12 v_ArrVal_16109) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_16112))) (let ((.cse5 (let ((.cse20 (select .cse19 |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_16114)))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse5 .cse12 v_ArrVal_16116) .cse1 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse3 (select .cse18 |c_~#queue~0.base|))) (let ((.cse8 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120))) (let ((.cse16 (store (store .cse18 |c_~#queue~0.base| (store (store .cse8 .cse12 v_ArrVal_16123) .cse1 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse7 (select .cse16 |c_~#queue~0.base|))) (let ((.cse17 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse9 (select .cse17 .cse1))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse12 v_ArrVal_16130) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse13 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_16135)))) (let ((.cse10 (store (store .cse14 |c_~#queue~0.base| (store (store .cse13 .cse12 v_ArrVal_16136) .cse1 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse11 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse4 (select .cse13 .cse1)) (.cse2 (select .cse11 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse0 .cse1))) (< (+ .cse2 1) v_ArrVal_16145) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse3 .cse1))) (= .cse4 800) (< (+ (select .cse5 .cse1) 1) v_ArrVal_16118) (= .cse6 800) (< (+ .cse4 1) v_ArrVal_16138) (= 800 .cse2) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse7 .cse1))) (< (+ (select .cse8 .cse1) 1) v_ArrVal_16124) (= .cse9 800) (< (select (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse12 v_ArrVal_16144) .cse1 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse1) 800))))))))))))))))))))) (= .cse26 800)))) is different from false [2022-12-13 09:04:08,030 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16130 Int) (v_ArrVal_16118 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16105 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16101 Int) (v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16100 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16109 Int) (v_ArrVal_16106 Int) (v_ArrVal_16128 Int) (v_ArrVal_16124 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16112 (Array Int Int)) (v_ArrVal_16133 (Array Int Int))) (let ((.cse25 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16100)) (.cse26 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (select .cse25 .cse26))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse22 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse25 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16101) .cse26 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_16105))) (let ((.cse23 (let ((.cse24 (select .cse22 |c_~#queue~0.base|))) (store .cse24 (+ |c_~#queue~0.offset| (* (select .cse24 .cse1) 4)) v_ArrVal_16106)))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse9 (select .cse23 .cse1))) (let ((.cse20 (store (store .cse22 |c_~#queue~0.base| (store (store .cse23 .cse7 v_ArrVal_16109) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_16112))) (let ((.cse8 (let ((.cse21 (select .cse20 |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_16114)))) (let ((.cse19 (store (store .cse20 |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_16116) .cse1 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse0 (select .cse19 |c_~#queue~0.base|))) (let ((.cse13 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120))) (let ((.cse17 (store (store .cse19 |c_~#queue~0.base| (store (store .cse13 .cse7 v_ArrVal_16123) .cse1 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse12 (select .cse17 |c_~#queue~0.base|))) (let ((.cse18 (store .cse12 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse11 (select .cse18 .cse1))) (let ((.cse15 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse7 v_ArrVal_16130) .cse1 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse14 (let ((.cse16 (select .cse15 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse1) 4)) v_ArrVal_16135)))) (let ((.cse5 (store (store .cse15 |c_~#queue~0.base| (store (store .cse14 .cse7 v_ArrVal_16136) .cse1 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse4 (select .cse6 .cse1)) (.cse10 (select .cse14 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse2 .cse1))) (= .cse3 800) (< (+ .cse4 1) v_ArrVal_16145) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_16144) .cse1 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse1) 800) (< (+ (select .cse8 .cse1) 1) v_ArrVal_16118) (= .cse9 800) (< (+ .cse10 1) v_ArrVal_16138) (= 800 .cse11) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse12 .cse1))) (< (+ (select .cse13 .cse1) 1) v_ArrVal_16124) (= .cse4 800) (= .cse10 800))))))))))))))))))))))) is different from false [2022-12-13 09:04:09,128 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250| (select .cse0 .cse1))) (forall ((v_ArrVal_16130 Int) (v_ArrVal_16118 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16105 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16101 Int) (v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16100 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16109 Int) (v_ArrVal_16106 Int) (v_ArrVal_16128 Int) (v_ArrVal_16124 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16112 (Array Int Int)) (v_ArrVal_16133 (Array Int Int))) (let ((.cse27 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16100))) (let ((.cse13 (select .cse27 .cse1))) (let ((.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse24 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse27 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16101) .cse1 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_16105))) (let ((.cse25 (let ((.cse26 (select .cse24 |c_~#queue~0.base|))) (store .cse26 (+ |c_~#queue~0.offset| (* 4 (select .cse26 .cse4))) v_ArrVal_16106)))) (let ((.cse12 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (select .cse25 .cse4))) (let ((.cse22 (store (store .cse24 |c_~#queue~0.base| (store (store .cse25 .cse12 v_ArrVal_16109) .cse4 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_16112))) (let ((.cse15 (let ((.cse23 (select .cse22 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_16114)))) (let ((.cse21 (store (store .cse22 |c_~#queue~0.base| (store (store .cse15 .cse12 v_ArrVal_16116) .cse4 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse7 (select .cse21 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120))) (let ((.cse19 (store (store .cse21 |c_~#queue~0.base| (store (store .cse3 .cse12 v_ArrVal_16123) .cse4 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse6 (select .cse19 |c_~#queue~0.base|))) (let ((.cse20 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse9 (select .cse20 .cse4))) (let ((.cse17 (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse12 v_ArrVal_16130) .cse4 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse16 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_16135)))) (let ((.cse10 (store (store .cse17 |c_~#queue~0.base| (store (store .cse16 .cse12 v_ArrVal_16136) .cse4 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse14 (select .cse10 |c_~#queue~0.base|))) (let ((.cse11 (store .cse14 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse5 (select .cse16 .cse4)) (.cse2 (select .cse11 .cse4))) (or (< (+ .cse2 1) v_ArrVal_16145) (< (+ (select .cse3 .cse4) 1) v_ArrVal_16124) (< (+ .cse5 1) v_ArrVal_16138) (= 800 .cse5) (= 800 .cse2) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse6 .cse4))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse7 .cse4))) (= 800 .cse8) (= .cse9 800) (< (select (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse12 v_ArrVal_16144) .cse4 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse4) 800) (= 800 .cse13) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse14 .cse4))) (< (+ (select .cse15 .cse4) 1) v_ArrVal_16118)))))))))))))))))))))))))) is different from false [2022-12-13 09:04:09,558 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16130 Int) (v_ArrVal_16118 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16105 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16101 Int) (v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16100 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16109 Int) (v_ArrVal_16106 Int) (v_ArrVal_16128 Int) (v_ArrVal_16124 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16112 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250| Int) (v_ArrVal_16133 (Array Int Int))) (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse27 (store .cse14 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250|) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_16100)) (.cse15 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse10 (select .cse27 .cse15))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse24 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse27 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_16101) .cse15 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_16105))) (let ((.cse25 (let ((.cse26 (select .cse24 |c_~#queue~0.base|))) (store .cse26 (+ |c_~#queue~0.offset| (* (select .cse26 .cse1) 4)) v_ArrVal_16106)))) (let ((.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (select .cse25 .cse1))) (let ((.cse22 (store (store .cse24 |c_~#queue~0.base| (store (store .cse25 .cse8 v_ArrVal_16109) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_16112))) (let ((.cse0 (let ((.cse23 (select .cse22 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_16114)))) (let ((.cse21 (store (store .cse22 |c_~#queue~0.base| (store (store .cse0 .cse8 v_ArrVal_16116) .cse1 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse5 (select .cse21 |c_~#queue~0.base|))) (let ((.cse12 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120))) (let ((.cse19 (store (store .cse21 |c_~#queue~0.base| (store (store .cse12 .cse8 v_ArrVal_16123) .cse1 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse11 (select .cse19 |c_~#queue~0.base|))) (let ((.cse20 (store .cse11 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse13 (select .cse20 .cse1))) (let ((.cse17 (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse8 v_ArrVal_16130) .cse1 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse16 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* 4 (select .cse18 .cse1))) v_ArrVal_16135)))) (let ((.cse6 (store (store .cse17 |c_~#queue~0.base| (store (store .cse16 .cse8 v_ArrVal_16136) .cse1 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse4 (select .cse7 .cse1)) (.cse9 (select .cse16 .cse1))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_16118) (= 800 .cse2) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse3 .cse1))) (< (+ .cse4 1) v_ArrVal_16145) (= .cse4 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse5 .cse1))) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_16144) .cse1 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse1) 800) (< (+ .cse9 1) v_ArrVal_16138) (= 800 .cse10) (= 800 .cse9) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse11 .cse1))) (< (+ (select .cse12 .cse1) 1) v_ArrVal_16124) (= 800 .cse13) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250| (select .cse14 .cse15)))))))))))))))))))))))))) is different from false [2022-12-13 09:04:31,106 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16130 Int) (v_ArrVal_16096 Int) (v_ArrVal_16118 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16105 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16101 Int) (v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16100 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16109 Int) (v_ArrVal_16106 Int) (v_ArrVal_16128 Int) (v_ArrVal_16124 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16098 (Array Int Int)) (v_ArrVal_16112 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250| Int) (v_ArrVal_16133 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16096)) |c_~#stored_elements~0.base| v_ArrVal_16098))) (let ((.cse13 (select .cse26 |c_~#queue~0.base|))) (let ((.cse27 (store .cse13 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250|) |c_~#queue~0.offset|) v_ArrVal_16100)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse10 (select .cse27 .cse2))) (let ((.cse23 (store (store .cse26 |c_~#queue~0.base| (store (store .cse27 .cse8 v_ArrVal_16101) .cse2 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_16105))) (let ((.cse24 (let ((.cse25 (select .cse23 |c_~#queue~0.base|))) (store .cse25 (+ (* (select .cse25 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_16106)))) (let ((.cse3 (select .cse24 .cse2))) (let ((.cse21 (store (store .cse23 |c_~#queue~0.base| (store (store .cse24 .cse8 v_ArrVal_16109) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_16112))) (let ((.cse14 (let ((.cse22 (select .cse21 |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_16114)))) (let ((.cse20 (store (store .cse21 |c_~#queue~0.base| (store (store .cse14 .cse8 v_ArrVal_16116) .cse2 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse9 (select .cse20 |c_~#queue~0.base|))) (let ((.cse1 (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120))) (let ((.cse18 (store (store .cse20 |c_~#queue~0.base| (store (store .cse1 .cse8 v_ArrVal_16123) .cse2 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse5 (select .cse18 |c_~#queue~0.base|))) (let ((.cse19 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse12 (select .cse19 .cse2))) (let ((.cse16 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse8 v_ArrVal_16130) .cse2 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse15 (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_16135)))) (let ((.cse6 (store (store .cse16 |c_~#queue~0.base| (store (store .cse15 .cse8 v_ArrVal_16136) .cse2 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse11 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse4 (select .cse15 .cse2)) (.cse0 (select .cse7 .cse2))) (or (= 800 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_16124) (= .cse3 800) (< (+ .cse4 1) v_ArrVal_16138) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse5 .cse2))) (= .cse4 800) (not (<= v_ArrVal_16096 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post47#1| 1))) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_16144) .cse2 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse2) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse9 .cse2))) (= 800 .cse10) (< (+ .cse0 1) v_ArrVal_16145) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse11 .cse2))) (= 800 .cse12) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250| (select .cse13 .cse2))) (< (+ (select .cse14 .cse2) 1) v_ArrVal_16118))))))))))))))))))))))))) is different from false [2022-12-13 09:04:31,338 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16130 Int) (v_ArrVal_16096 Int) (v_ArrVal_16118 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16105 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16101 Int) (v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16100 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16109 Int) (v_ArrVal_16106 Int) (v_ArrVal_16128 Int) (v_ArrVal_16124 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16098 (Array Int Int)) (v_ArrVal_16112 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250| Int) (v_ArrVal_16133 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16096)) |c_~#stored_elements~0.base| v_ArrVal_16098))) (let ((.cse13 (select .cse26 |c_~#queue~0.base|))) (let ((.cse27 (store .cse13 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250|) |c_~#queue~0.offset|) v_ArrVal_16100)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse10 (select .cse27 .cse2))) (let ((.cse23 (store (store .cse26 |c_~#queue~0.base| (store (store .cse27 .cse8 v_ArrVal_16101) .cse2 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_16105))) (let ((.cse24 (let ((.cse25 (select .cse23 |c_~#queue~0.base|))) (store .cse25 (+ (* (select .cse25 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_16106)))) (let ((.cse3 (select .cse24 .cse2))) (let ((.cse21 (store (store .cse23 |c_~#queue~0.base| (store (store .cse24 .cse8 v_ArrVal_16109) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_16112))) (let ((.cse14 (let ((.cse22 (select .cse21 |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_16114)))) (let ((.cse20 (store (store .cse21 |c_~#queue~0.base| (store (store .cse14 .cse8 v_ArrVal_16116) .cse2 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse9 (select .cse20 |c_~#queue~0.base|))) (let ((.cse1 (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120))) (let ((.cse18 (store (store .cse20 |c_~#queue~0.base| (store (store .cse1 .cse8 v_ArrVal_16123) .cse2 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse5 (select .cse18 |c_~#queue~0.base|))) (let ((.cse19 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse12 (select .cse19 .cse2))) (let ((.cse16 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse8 v_ArrVal_16130) .cse2 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse15 (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_16135)))) (let ((.cse6 (store (store .cse16 |c_~#queue~0.base| (store (store .cse15 .cse8 v_ArrVal_16136) .cse2 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse11 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse4 (select .cse15 .cse2)) (.cse0 (select .cse7 .cse2))) (or (= 800 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_16124) (= .cse3 800) (< (+ .cse4 1) v_ArrVal_16138) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse5 .cse2))) (= .cse4 800) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_16144) .cse2 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse2) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse9 .cse2))) (= 800 .cse10) (< (+ .cse0 1) v_ArrVal_16145) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse11 .cse2))) (= 800 .cse12) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250| (select .cse13 .cse2))) (< (+ (select .cse14 .cse2) 1) v_ArrVal_16118) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem46#1| 1) v_ArrVal_16096))))))))))))))))))))))))) is different from false [2022-12-13 09:04:47,027 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16130 Int) (v_ArrVal_16096 Int) (v_ArrVal_16094 Int) (v_ArrVal_16118 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16105 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16101 Int) (v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16100 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16109 Int) (v_ArrVal_16106 Int) (v_ArrVal_16128 Int) (v_ArrVal_16124 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16098 (Array Int Int)) (v_ArrVal_16112 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250| Int) (v_ArrVal_16133 (Array Int Int))) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse28 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16094) .cse8 v_ArrVal_16096)) |c_~#stored_elements~0.base| v_ArrVal_16098))) (let ((.cse11 (select .cse28 |c_~#queue~0.base|))) (let ((.cse29 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250|) |c_~#queue~0.offset|) v_ArrVal_16100)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse14 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (select .cse29 .cse2))) (let ((.cse25 (store (store .cse28 |c_~#queue~0.base| (store (store .cse29 .cse14 v_ArrVal_16101) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_16105))) (let ((.cse26 (let ((.cse27 (select .cse25 |c_~#queue~0.base|))) (store .cse27 (+ |c_~#queue~0.offset| (* 4 (select .cse27 .cse2))) v_ArrVal_16106)))) (let ((.cse16 (select .cse26 .cse2))) (let ((.cse23 (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse14 v_ArrVal_16109) .cse2 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_16112))) (let ((.cse5 (let ((.cse24 (select .cse23 |c_~#queue~0.base|))) (store .cse24 (+ (* (select .cse24 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_16114)))) (let ((.cse22 (store (store .cse23 |c_~#queue~0.base| (store (store .cse5 .cse14 v_ArrVal_16116) .cse2 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse15 (select .cse22 |c_~#queue~0.base|))) (let ((.cse9 (store .cse15 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120))) (let ((.cse20 (store (store .cse22 |c_~#queue~0.base| (store (store .cse9 .cse14 v_ArrVal_16123) .cse2 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse1 (select .cse20 |c_~#queue~0.base|))) (let ((.cse21 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse10 (select .cse21 .cse2))) (let ((.cse18 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse14 v_ArrVal_16130) .cse2 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse17 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_16135)))) (let ((.cse12 (store (store .cse18 |c_~#queue~0.base| (store (store .cse17 .cse14 v_ArrVal_16136) .cse2 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse4 (select .cse12 |c_~#queue~0.base|))) (let ((.cse13 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse0 (select .cse13 .cse2)) (.cse6 (select .cse17 .cse2))) (or (= .cse0 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse1 .cse2))) (= .cse3 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse4 .cse2))) (< (+ 1 (select .cse5 .cse2)) v_ArrVal_16118) (< (+ 1 .cse6) v_ArrVal_16138) (< (+ (select .cse7 .cse8) 1) v_ArrVal_16096) (< (+ .cse0 1) v_ArrVal_16145) (< (+ 1 (select .cse9 .cse2)) v_ArrVal_16124) (= 800 .cse10) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250| (select .cse11 .cse2))) (< (select (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse14 v_ArrVal_16144) .cse2 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse2) 800) (= 800 .cse6) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse15 .cse2))) (= .cse16 800)))))))))))))))))))))))))) is different from false [2022-12-13 09:04:50,456 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16130 Int) (v_ArrVal_16096 Int) (v_ArrVal_16094 Int) (v_ArrVal_16118 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16105 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (v_ArrVal_16092 Int) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16101 Int) (v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16100 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16109 Int) (v_ArrVal_16106 Int) (v_ArrVal_16128 Int) (v_ArrVal_16124 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16098 (Array Int Int)) (v_ArrVal_16112 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250| Int) (v_ArrVal_16133 (Array Int Int))) (let ((.cse8 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16092)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse28 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16094) .cse9 v_ArrVal_16096)) |c_~#stored_elements~0.base| v_ArrVal_16098))) (let ((.cse16 (select .cse28 |c_~#queue~0.base|))) (let ((.cse29 (store .cse16 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250|) |c_~#queue~0.offset|) v_ArrVal_16100)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (select .cse29 .cse2))) (let ((.cse25 (store (store .cse28 |c_~#queue~0.base| (store (store .cse29 .cse5 v_ArrVal_16101) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_16105))) (let ((.cse26 (let ((.cse27 (select .cse25 |c_~#queue~0.base|))) (store .cse27 (+ |c_~#queue~0.offset| (* (select .cse27 .cse2) 4)) v_ArrVal_16106)))) (let ((.cse0 (select .cse26 .cse2))) (let ((.cse23 (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse5 v_ArrVal_16109) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_16112))) (let ((.cse1 (let ((.cse24 (select .cse23 |c_~#queue~0.base|))) (store .cse24 (+ (* (select .cse24 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_16114)))) (let ((.cse22 (store (store .cse23 |c_~#queue~0.base| (store (store .cse1 .cse5 v_ArrVal_16116) .cse2 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse14 (select .cse22 |c_~#queue~0.base|))) (let ((.cse10 (store .cse14 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120))) (let ((.cse20 (store (store .cse22 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_16123) .cse2 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse13 (select .cse20 |c_~#queue~0.base|))) (let ((.cse21 (store .cse13 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse11 (select .cse21 .cse2))) (let ((.cse18 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse5 v_ArrVal_16130) .cse2 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse17 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_16135)))) (let ((.cse3 (store (store .cse18 |c_~#queue~0.base| (store (store .cse17 .cse5 v_ArrVal_16136) .cse2 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse15 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse15 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse6 (select .cse17 .cse2)) (.cse12 (select .cse4 .cse2))) (or (= 800 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_16118) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_16144) .cse2 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse2) 800) (= 800 .cse6) (= 800 .cse7) (< (+ .cse6 1) v_ArrVal_16138) (< (+ (select .cse8 .cse9) 1) v_ArrVal_16096) (< (+ (select .cse10 .cse2) 1) v_ArrVal_16124) (= 800 .cse11) (= .cse12 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse13 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse14 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse15 .cse2))) (< (+ .cse12 1) v_ArrVal_16145) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250| (select .cse16 .cse2)))))))))))))))))))))))))))) is different from false [2022-12-13 09:04:51,884 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_253| Int)) (let ((.cse30 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_16130 Int) (v_ArrVal_16096 Int) (v_ArrVal_16094 Int) (v_ArrVal_16118 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16105 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (v_ArrVal_16092 Int) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16101 Int) (v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16100 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16109 Int) (v_ArrVal_16106 Int) (v_ArrVal_16128 Int) (v_ArrVal_16124 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16098 (Array Int Int)) (v_ArrVal_16112 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250| Int) (v_ArrVal_16133 (Array Int Int))) (let ((.cse10 (store .cse30 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_253|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16092))) (let ((.cse28 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_16094) .cse11 v_ArrVal_16096)) |c_~#stored_elements~0.base| v_ArrVal_16098))) (let ((.cse5 (select .cse28 |c_~#queue~0.base|))) (let ((.cse29 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250|) |c_~#queue~0.offset|) v_ArrVal_16100)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse12 (select .cse29 .cse1))) (let ((.cse25 (store (store .cse28 |c_~#queue~0.base| (store (store .cse29 .cse9 v_ArrVal_16101) .cse1 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_16105))) (let ((.cse26 (let ((.cse27 (select .cse25 |c_~#queue~0.base|))) (store .cse27 (+ |c_~#queue~0.offset| (* (select .cse27 .cse1) 4)) v_ArrVal_16106)))) (let ((.cse13 (select .cse26 .cse1))) (let ((.cse23 (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse9 v_ArrVal_16109) .cse1 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_16112))) (let ((.cse16 (let ((.cse24 (select .cse23 |c_~#queue~0.base|))) (store .cse24 (+ (* (select .cse24 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_16114)))) (let ((.cse22 (store (store .cse23 |c_~#queue~0.base| (store (store .cse16 .cse9 v_ArrVal_16116) .cse1 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse14 (select .cse22 |c_~#queue~0.base|))) (let ((.cse6 (store .cse14 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120))) (let ((.cse20 (store (store .cse22 |c_~#queue~0.base| (store (store .cse6 .cse9 v_ArrVal_16123) .cse1 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse0 (select .cse20 |c_~#queue~0.base|))) (let ((.cse21 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse3 (select .cse21 .cse1))) (let ((.cse18 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse9 v_ArrVal_16130) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse17 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_16135)))) (let ((.cse7 (store (store .cse18 |c_~#queue~0.base| (store (store .cse17 .cse9 v_ArrVal_16136) .cse1 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse4 (select .cse8 .cse1)) (.cse15 (select .cse17 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse2 .cse1))) (= 800 .cse3) (< (+ .cse4 1) v_ArrVal_16145) (= .cse4 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250| (select .cse5 .cse1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_16124) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_16144) .cse1 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse1) 800) (< (+ 1 (select .cse10 .cse11)) v_ArrVal_16096) (= 800 .cse12) (= 800 .cse13) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse14 .cse1))) (= 800 .cse15) (< (+ .cse15 1) v_ArrVal_16138) (< (+ (select .cse16 .cse1) 1) v_ArrVal_16118)))))))))))))))))))))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_253| (select .cse30 .cse11)))))) is different from false [2022-12-13 09:04:52,434 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_16130 Int) (v_ArrVal_16096 Int) (v_ArrVal_16094 Int) (v_ArrVal_16118 Int) (v_ArrVal_16116 Int) (v_ArrVal_16138 Int) (v_ArrVal_16114 Int) (v_ArrVal_16136 Int) (v_ArrVal_16135 Int) (v_ArrVal_16147 (Array Int Int)) (v_ArrVal_16105 (Array Int Int)) (v_ArrVal_16126 (Array Int Int)) (v_ArrVal_16092 Int) (v_ArrVal_16140 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| Int) (v_ArrVal_16101 Int) (v_ArrVal_16123 Int) (v_ArrVal_16145 Int) (v_ArrVal_16100 Int) (v_ArrVal_16144 Int) (v_ArrVal_16120 Int) (v_ArrVal_16142 Int) (v_ArrVal_16109 Int) (v_ArrVal_16106 Int) (v_ArrVal_16128 Int) (v_ArrVal_16124 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| Int) (v_ArrVal_16119 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_253| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| Int) (v_ArrVal_16098 (Array Int Int)) (v_ArrVal_16112 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250| Int) (v_ArrVal_16133 (Array Int Int))) (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse10 (store .cse14 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_253|)) v_ArrVal_16092)) (.cse11 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse29 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_16094) .cse11 v_ArrVal_16096)) |c_~#stored_elements~0.base| v_ArrVal_16098))) (let ((.cse4 (select .cse29 |c_~#queue~0.base|))) (let ((.cse30 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250|) |c_~#queue~0.offset|) v_ArrVal_16100)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (select .cse30 .cse1))) (let ((.cse26 (store (store .cse29 |c_~#queue~0.base| (store (store .cse30 .cse9 v_ArrVal_16101) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_16105))) (let ((.cse27 (let ((.cse28 (select .cse26 |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_16106)))) (let ((.cse17 (select .cse27 .cse1))) (let ((.cse24 (store (store .cse26 |c_~#queue~0.base| (store (store .cse27 .cse9 v_ArrVal_16109) .cse1 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_16112))) (let ((.cse13 (let ((.cse25 (select .cse24 |c_~#queue~0.base|))) (store .cse25 (+ (* (select .cse25 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_16114)))) (let ((.cse23 (store (store .cse24 |c_~#queue~0.base| (store (store .cse13 .cse9 v_ArrVal_16116) .cse1 v_ArrVal_16118)) |c_~#stored_elements~0.base| v_ArrVal_16119))) (let ((.cse0 (select .cse23 |c_~#queue~0.base|))) (let ((.cse16 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241|)) v_ArrVal_16120))) (let ((.cse21 (store (store .cse23 |c_~#queue~0.base| (store (store .cse16 .cse9 v_ArrVal_16123) .cse1 v_ArrVal_16124)) |c_~#stored_elements~0.base| v_ArrVal_16126))) (let ((.cse5 (select .cse21 |c_~#queue~0.base|))) (let ((.cse22 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238|)) v_ArrVal_16128))) (let ((.cse12 (select .cse22 .cse1))) (let ((.cse19 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse9 v_ArrVal_16130) .cse1 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_16133))) (let ((.cse18 (let ((.cse20 (select .cse19 |c_~#queue~0.base|))) (store .cse20 (+ |c_~#queue~0.offset| (* 4 (select .cse20 .cse1))) v_ArrVal_16135)))) (let ((.cse7 (store (store .cse19 |c_~#queue~0.base| (store (store .cse18 .cse9 v_ArrVal_16136) .cse1 v_ArrVal_16138)) |c_~#stored_elements~0.base| v_ArrVal_16140))) (let ((.cse15 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse15 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232|) |c_~#queue~0.offset|) v_ArrVal_16142))) (let ((.cse2 (select .cse8 .cse1)) (.cse6 (select .cse18 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_241| (select .cse0 .cse1))) (= .cse2 800) (= .cse3 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_250| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_238| (select .cse5 .cse1))) (< (+ .cse6 1) v_ArrVal_16138) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_16144) .cse1 v_ArrVal_16145)) |c_~#stored_elements~0.base| v_ArrVal_16147) |c_~#queue~0.base|) .cse1) 800) (< (+ (select .cse10 .cse11) 1) v_ArrVal_16096) (= 800 .cse12) (< (+ (select .cse13 .cse1) 1) v_ArrVal_16118) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_253| (select .cse14 .cse11))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_232| (select .cse15 .cse1))) (< (+ .cse2 1) v_ArrVal_16145) (= 800 .cse6) (< (+ (select .cse16 .cse1) 1) v_ArrVal_16124) (= .cse17 800))))))))))))))))))))))))))) is different from false