/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-44940e9-m [2022-11-10 07:27:33,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-10 07:27:33,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-10 07:27:33,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-10 07:27:33,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-10 07:27:33,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-10 07:27:33,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-10 07:27:33,465 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-10 07:27:33,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-10 07:27:33,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-10 07:27:33,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-10 07:27:33,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-10 07:27:33,471 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-10 07:27:33,473 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-10 07:27:33,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-10 07:27:33,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-10 07:27:33,475 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-10 07:27:33,476 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-10 07:27:33,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-10 07:27:33,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-10 07:27:33,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-10 07:27:33,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-10 07:27:33,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-10 07:27:33,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-10 07:27:33,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-10 07:27:33,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-10 07:27:33,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-10 07:27:33,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-10 07:27:33,490 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-10 07:27:33,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-10 07:27:33,491 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-10 07:27:33,492 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-10 07:27:33,493 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-10 07:27:33,493 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-10 07:27:33,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-10 07:27:33,494 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-10 07:27:33,495 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-10 07:27:33,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-10 07:27:33,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-10 07:27:33,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-10 07:27:33,496 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-10 07:27:33,497 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf [2022-11-10 07:27:33,516 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-10 07:27:33,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-10 07:27:33,517 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-10 07:27:33,517 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-10 07:27:33,517 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-10 07:27:33,518 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-10 07:27:33,518 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-10 07:27:33,518 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-10 07:27:33,518 INFO L138 SettingsManager]: * Use SBE=true [2022-11-10 07:27:33,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-10 07:27:33,519 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-10 07:27:33,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-10 07:27:33,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-10 07:27:33,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-10 07:27:33,519 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-10 07:27:33,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-10 07:27:33,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-10 07:27:33,519 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-10 07:27:33,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-10 07:27:33,520 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-10 07:27:33,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-10 07:27:33,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-10 07:27:33,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-10 07:27:33,520 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-10 07:27:33,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-10 07:27:33,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-10 07:27:33,520 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-10 07:27:33,520 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-10 07:27:33,520 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-10 07:27:33,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-10 07:27:33,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-10 07:27:33,521 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-10 07:27:33,521 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-10 07:27:33,521 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-10 07:27:33,521 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-10 07:27:33,521 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-10 07:27:33,521 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-10 07:27:33,521 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-10 07:27:33,521 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-11-10 07:27:33,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-10 07:27:33,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-10 07:27:33,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-10 07:27:33,713 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-10 07:27:33,713 INFO L275 PluginConnector]: CDTParser initialized [2022-11-10 07:27:33,714 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2022-11-10 07:27:33,757 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38c5ebe10/ba775661e6cc4104901971a0a55d5032/FLAGfed67c171 [2022-11-10 07:27:34,184 INFO L306 CDTParser]: Found 1 translation units. [2022-11-10 07:27:34,184 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2022-11-10 07:27:34,202 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38c5ebe10/ba775661e6cc4104901971a0a55d5032/FLAGfed67c171 [2022-11-10 07:27:34,534 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38c5ebe10/ba775661e6cc4104901971a0a55d5032 [2022-11-10 07:27:34,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-10 07:27:34,537 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-10 07:27:34,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-10 07:27:34,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-10 07:27:34,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-10 07:27:34,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:27:34" (1/1) ... [2022-11-10 07:27:34,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e89db9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:34, skipping insertion in model container [2022-11-10 07:27:34,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:27:34" (1/1) ... [2022-11-10 07:27:34,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-10 07:27:34,588 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-10 07:27:34,711 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-10 07:27:34,900 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2022-11-10 07:27:34,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2022-11-10 07:27:34,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2022-11-10 07:27:34,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2022-11-10 07:27:34,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2022-11-10 07:27:34,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2022-11-10 07:27:34,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2022-11-10 07:27:34,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-10 07:27:34,953 INFO L203 MainTranslator]: Completed pre-run [2022-11-10 07:27:34,960 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-10 07:27:34,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2022-11-10 07:27:34,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2022-11-10 07:27:34,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2022-11-10 07:27:34,985 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2022-11-10 07:27:34,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2022-11-10 07:27:34,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2022-11-10 07:27:34,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2022-11-10 07:27:34,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-10 07:27:35,028 INFO L208 MainTranslator]: Completed translation [2022-11-10 07:27:35,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:35 WrapperNode [2022-11-10 07:27:35,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-10 07:27:35,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-10 07:27:35,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-10 07:27:35,032 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-10 07:27:35,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:35" (1/1) ... [2022-11-10 07:27:35,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:35" (1/1) ... [2022-11-10 07:27:35,117 INFO L138 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 345 [2022-11-10 07:27:35,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-10 07:27:35,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-10 07:27:35,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-10 07:27:35,118 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-10 07:27:35,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:35" (1/1) ... [2022-11-10 07:27:35,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:35" (1/1) ... [2022-11-10 07:27:35,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:35" (1/1) ... [2022-11-10 07:27:35,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:35" (1/1) ... [2022-11-10 07:27:35,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:35" (1/1) ... [2022-11-10 07:27:35,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:35" (1/1) ... [2022-11-10 07:27:35,173 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:35" (1/1) ... [2022-11-10 07:27:35,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:35" (1/1) ... [2022-11-10 07:27:35,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-10 07:27:35,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-10 07:27:35,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-10 07:27:35,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-10 07:27:35,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:35" (1/1) ... [2022-11-10 07:27:35,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-10 07:27:35,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:27:35,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-10 07:27:35,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-10 07:27:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-11-10 07:27:35,300 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-11-10 07:27:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-11-10 07:27:35,300 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-11-10 07:27:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-10 07:27:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-10 07:27:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-10 07:27:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-10 07:27:35,301 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-10 07:27:35,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-10 07:27:35,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-10 07:27:35,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-10 07:27:35,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-10 07:27:35,302 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-10 07:27:35,457 INFO L235 CfgBuilder]: Building ICFG [2022-11-10 07:27:35,459 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-10 07:27:36,012 INFO L276 CfgBuilder]: Performing block encoding [2022-11-10 07:27:36,020 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-10 07:27:36,020 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-10 07:27:36,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:27:36 BoogieIcfgContainer [2022-11-10 07:27:36,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-10 07:27:36,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-10 07:27:36,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-10 07:27:36,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-10 07:27:36,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:27:34" (1/3) ... [2022-11-10 07:27:36,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3efd9374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:27:36, skipping insertion in model container [2022-11-10 07:27:36,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:27:35" (2/3) ... [2022-11-10 07:27:36,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3efd9374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:27:36, skipping insertion in model container [2022-11-10 07:27:36,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:27:36" (3/3) ... [2022-11-10 07:27:36,034 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2022-11-10 07:27:36,040 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-10 07:27:36,046 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-10 07:27:36,046 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2022-11-10 07:27:36,046 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-10 07:27:36,153 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-10 07:27:36,205 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:27:36,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:27:36,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:27:36,229 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:27:36,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-10 07:27:36,260 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:27:36,270 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr0ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:27:36,275 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;@714ac2d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:27:36,276 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:27:36,278 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 07:27:36,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:27:36,284 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 07:27:36,289 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr0ASSERT_VIOLATIONDATA_RACE was SAFE (1/44) [2022-11-10 07:27:36,298 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:27:36,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:27:36,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:27:36,299 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:27:36,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-11-10 07:27:36,319 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:27:36,320 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr1ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:27:36,320 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;@714ac2d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:27:36,320 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:27:36,321 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 07:27:36,321 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr1ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:27:36,322 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 07:27:36,322 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr1ASSERT_VIOLATIONDATA_RACE was SAFE (2/44) [2022-11-10 07:27:36,325 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:27:36,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:27:36,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:27:36,365 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:27:36,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-11-10 07:27:36,379 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:27:36,382 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr2ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:27:36,382 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;@714ac2d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:27:36,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:27:36,383 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 07:27:36,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr2ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:27:36,384 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 07:27:36,384 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr2ASSERT_VIOLATIONDATA_RACE was SAFE (3/44) [2022-11-10 07:27:36,388 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:27:36,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:27:36,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:27:36,404 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:27:36,422 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:27:36,422 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr3ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:27:36,423 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;@714ac2d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:27:36,423 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:27:36,423 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 07:27:36,423 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr3ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:27:36,424 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 07:27:36,424 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr3ASSERT_VIOLATIONDATA_RACE was SAFE (4/44) [2022-11-10 07:27:36,428 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:27:36,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:27:36,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:27:36,430 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:27:36,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-11-10 07:27:36,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2022-11-10 07:27:36,443 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:27:36,443 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr4ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:27:36,443 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;@714ac2d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:27:36,443 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:27:36,444 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 07:27:36,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr4ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:27:36,444 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 07:27:36,445 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr4ASSERT_VIOLATIONDATA_RACE was SAFE (5/44) [2022-11-10 07:27:36,448 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:27:36,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:27:36,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:27:36,453 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:27:36,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2022-11-10 07:27:36,457 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:27:36,458 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr5ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:27:36,458 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;@714ac2d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:27:36,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:27:36,459 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 07:27:36,459 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr5ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:27:36,459 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 07:27:36,460 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr5ASSERT_VIOLATIONDATA_RACE was SAFE (6/44) [2022-11-10 07:27:36,463 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:27:36,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:27:36,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:27:36,482 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:27:36,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2022-11-10 07:27:36,486 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:27:36,486 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr6ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:27:36,487 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;@714ac2d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:27:36,487 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:27:36,487 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 07:27:36,487 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr6ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:27:36,487 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 07:27:36,488 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr6ASSERT_VIOLATIONDATA_RACE was SAFE (7/44) [2022-11-10 07:27:36,491 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:27:36,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:27:36,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:27:36,493 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:27:36,498 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:27:36,498 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr7ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:27:36,498 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;@714ac2d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:27:36,498 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:27:36,498 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 07:27:36,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr7ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:27:36,499 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 07:27:36,499 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr7ASSERT_VIOLATIONDATA_RACE was SAFE (8/44) [2022-11-10 07:27:36,507 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:27:36,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:27:36,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:27:36,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2022-11-10 07:27:36,518 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:27:36,524 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:27:36,524 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr8ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:27:36,524 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;@714ac2d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:27:36,525 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:27:36,525 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 07:27:36,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr8ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:27:36,525 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 07:27:36,525 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr8ASSERT_VIOLATIONDATA_RACE was SAFE (9/44) [2022-11-10 07:27:36,528 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:27:36,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:27:36,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:27:36,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2022-11-10 07:27:36,535 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:27:36,540 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:27:36,540 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr9ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:27:36,540 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;@714ac2d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:27:36,541 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:27:36,541 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 07:27:36,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr9ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:27:36,541 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 07:27:36,541 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr9ASSERT_VIOLATIONDATA_RACE was SAFE (10/44) [2022-11-10 07:27:36,545 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:27:36,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:27:36,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:27:36,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2022-11-10 07:27:36,556 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:27:36,561 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:27:36,561 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:27:36,562 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;@714ac2d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:27:36,562 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:27:36,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Waiting until timeout for monitored process [2022-11-10 07:27:36,591 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:27:36,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:27:36,594 INFO L85 PathProgramCache]: Analyzing trace with hash -310861093, now seen corresponding path program 1 times [2022-11-10 07:27:36,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:27:36,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666704670] [2022-11-10 07:27:36,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:27:36,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:27:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:27:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:27:37,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:27:37,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666704670] [2022-11-10 07:27:37,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666704670] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:27:37,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 07:27:37,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 07:27:37,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866307726] [2022-11-10 07:27:37,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:27:37,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 07:27:37,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:27:37,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 07:27:37,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 07:27:37,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:37,157 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:27:37,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:27:37,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:37,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:27:37,190 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:27:37,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-10 07:27:37,191 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-10 07:27:37,192 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE was SAFE (11/44) [2022-11-10 07:27:37,194 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:27:37,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:27:37,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:27:37,209 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:27:37,215 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:27:37,215 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:27:37,215 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;@714ac2d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:27:37,216 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:27:37,222 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:27:37,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:27:37,222 INFO L85 PathProgramCache]: Analyzing trace with hash -350431602, now seen corresponding path program 1 times [2022-11-10 07:27:37,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:27:37,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835678447] [2022-11-10 07:27:37,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:27:37,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:27:37,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2022-11-10 07:27:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:27:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:27:37,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:27:37,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835678447] [2022-11-10 07:27:37,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835678447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:27:37,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 07:27:37,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 07:27:37,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376085828] [2022-11-10 07:27:37,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:27:37,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 07:27:37,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:27:37,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 07:27:37,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 07:27:37,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:37,522 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:27:37,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:27:37,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:37,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:27:37,564 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:27:37,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-10 07:27:37,565 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-10 07:27:37,565 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE was SAFE (12/44) [2022-11-10 07:27:37,570 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:27:37,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:27:37,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:27:37,595 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:27:37,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Waiting until timeout for monitored process [2022-11-10 07:27:37,626 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:27:37,626 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:27:37,626 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;@714ac2d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:27:37,626 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:27:37,947 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:27:37,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:27:37,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1376993376, now seen corresponding path program 1 times [2022-11-10 07:27:37,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:27:37,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418099339] [2022-11-10 07:27:37,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:27:37,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:27:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:27:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:27:37,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:27:37,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418099339] [2022-11-10 07:27:37,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418099339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:27:37,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 07:27:37,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-10 07:27:37,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7181898] [2022-11-10 07:27:37,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:27:37,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-10 07:27:37,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:27:37,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-10 07:27:37,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-10 07:27:37,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:37,998 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:27:37,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:27:37,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:38,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:38,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-10 07:27:38,033 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:27:38,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:27:38,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1506076095, now seen corresponding path program 1 times [2022-11-10 07:27:38,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:27:38,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373284800] [2022-11-10 07:27:38,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:27:38,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:27:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:27:38,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:27:38,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:27:38,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373284800] [2022-11-10 07:27:38,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373284800] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:27:38,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 07:27:38,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-10 07:27:38,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71086068] [2022-11-10 07:27:38,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:27:38,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 07:27:38,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:27:38,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 07:27:38,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-10 07:27:38,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:38,106 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:27:38,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:27:38,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:38,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:38,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:38,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:27:38,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-10 07:27:38,202 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:27:38,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:27:38,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1888324694, now seen corresponding path program 1 times [2022-11-10 07:27:38,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:27:38,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690966572] [2022-11-10 07:27:38,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:27:38,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:27:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:27:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:27:38,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:27:38,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690966572] [2022-11-10 07:27:38,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690966572] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 07:27:38,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093190384] [2022-11-10 07:27:38,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:27:38,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:27:38,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:27:38,335 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 07:27:38,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-10 07:27:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:27:38,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-10 07:27:38,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 07:27:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:27:38,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 07:27:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:27:38,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093190384] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 07:27:38,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 07:27:38,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-10 07:27:38,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690866050] [2022-11-10 07:27:38,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 07:27:38,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-10 07:27:38,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:27:38,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-10 07:27:38,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-10 07:27:38,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:38,643 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:27:38,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 7 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-11-10 07:27:38,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:38,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:27:38,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:38,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:27:38,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:27:38,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-10 07:27:38,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:27:38,927 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:27:38,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:27:38,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1692983195, now seen corresponding path program 2 times [2022-11-10 07:27:38,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:27:38,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386229756] [2022-11-10 07:27:38,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:27:38,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:27:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:27:39,338 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:27:39,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:27:39,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386229756] [2022-11-10 07:27:39,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386229756] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 07:27:39,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344728694] [2022-11-10 07:27:39,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-10 07:27:39,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:27:39,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:27:39,342 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 07:27:39,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-10 07:27:39,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-10 07:27:39,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 07:27:39,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-10 07:27:39,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 07:27:39,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-10 07:27:39,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:39,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 07:27:39,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:39,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:39,841 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 07:27:39,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 07:27:39,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:39,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:39,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:39,866 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 07:27:39,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 07:27:39,887 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-11-10 07:27:39,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-10 07:27:39,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344728694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:27:39,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-10 07:27:39,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2022-11-10 07:27:39,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481841442] [2022-11-10 07:27:39,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:27:39,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-10 07:27:39,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:27:39,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-10 07:27:39,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-10 07:27:39,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:39,889 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:27:39,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 23.166666666666668) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:27:39,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:39,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:27:39,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:27:39,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:40,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:40,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:27:40,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:27:40,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:27:40,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-10 07:27:40,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:27:40,295 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:27:40,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:27:40,296 INFO L85 PathProgramCache]: Analyzing trace with hash -2143382183, now seen corresponding path program 1 times [2022-11-10 07:27:40,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:27:40,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849980873] [2022-11-10 07:27:40,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:27:40,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:27:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:27:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-11-10 07:27:40,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:27:40,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849980873] [2022-11-10 07:27:40,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849980873] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:27:40,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 07:27:40,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-10 07:27:40,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867065361] [2022-11-10 07:27:40,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:27:40,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 07:27:40,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:27:40,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 07:27:40,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-10 07:27:40,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:40,532 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:27:40,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:27:40,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:40,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:27:40,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:27:40,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:27:40,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:40,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:40,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:27:40,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:27:40,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:27:40,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:27:40,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-10 07:27:40,591 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:27:40,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:27:40,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2052698214, now seen corresponding path program 1 times [2022-11-10 07:27:40,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:27:40,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409499323] [2022-11-10 07:27:40,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:27:40,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:27:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:27:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:27:41,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:27:41,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409499323] [2022-11-10 07:27:41,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409499323] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 07:27:41,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514071623] [2022-11-10 07:27:41,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:27:41,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:27:41,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:27:41,052 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 07:27:41,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-10 07:27:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:27:41,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 1259 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-10 07:27:41,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 07:27:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:27:41,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 07:27:41,888 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:27:41,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514071623] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 07:27:41,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 07:27:41,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-10 07:27:41,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179643812] [2022-11-10 07:27:41,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 07:27:41,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-10 07:27:41,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:27:41,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-10 07:27:41,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-11-10 07:27:41,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:41,892 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:27:41,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 55.27272727272727) internal successors, (608), 11 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:27:41,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:41,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:27:41,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:27:41,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:27:41,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:27:41,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:41,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:41,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:27:41,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:27:41,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:27:41,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:27:41,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:27:42,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-10 07:27:42,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:27:42,197 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:27:42,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:27:42,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1630498826, now seen corresponding path program 2 times [2022-11-10 07:27:42,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:27:42,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336868382] [2022-11-10 07:27:42,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:27:42,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:27:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:27:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1632 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1632 trivial. 0 not checked. [2022-11-10 07:27:43,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:27:43,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336868382] [2022-11-10 07:27:43,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336868382] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:27:43,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 07:27:43,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-10 07:27:43,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025290092] [2022-11-10 07:27:43,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:27:43,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 07:27:43,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:27:43,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 07:27:43,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 07:27:43,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:43,664 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:27:43,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.333333333333336) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:27:43,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:43,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:27:43,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:27:43,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:27:43,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:27:43,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:27:43,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:43,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:43,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:27:43,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:27:43,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:27:43,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:27:43,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:27:43,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:27:43,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-10 07:27:43,883 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:27:43,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:27:43,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1315870638, now seen corresponding path program 1 times [2022-11-10 07:27:43,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:27:43,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801522029] [2022-11-10 07:27:43,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:27:43,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:27:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:27:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1632 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1632 trivial. 0 not checked. [2022-11-10 07:27:45,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:27:45,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801522029] [2022-11-10 07:27:45,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801522029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:27:45,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 07:27:45,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-10 07:27:45,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844880926] [2022-11-10 07:27:45,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:27:45,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 07:27:45,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:27:45,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 07:27:45,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 07:27:45,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:45,257 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:27:45,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:27:45,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:45,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:27:45,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:27:45,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:27:45,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:27:45,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:27:45,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:27:45,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:45,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:27:45,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:27:45,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:27:45,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:27:45,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:27:45,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:27:45,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:27:45,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:27:45,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-10 07:27:45,444 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:27:45,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:27:45,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1103856933, now seen corresponding path program 1 times [2022-11-10 07:27:45,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:27:45,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275596600] [2022-11-10 07:27:45,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:27:45,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:27:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:27:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1632 trivial. 0 not checked. [2022-11-10 07:27:49,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:27:49,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275596600] [2022-11-10 07:27:49,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275596600] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 07:27:49,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860665126] [2022-11-10 07:27:49,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:27:49,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:27:49,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:27:49,196 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 07:27:49,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-10 07:27:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:27:49,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 2120 conjuncts, 148 conjunts are in the unsatisfiable core [2022-11-10 07:27:49,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 07:27:49,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-10 07:27:49,993 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-10 07:27:49,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-10 07:27:50,008 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 07:27:50,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-10 07:27:54,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-10 07:27:55,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 07:27:55,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:55,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 07:27:55,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:55,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:55,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 07:27:55,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:55,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:55,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:55,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 07:27:56,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:27:56,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:27:56,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:27:56,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:27:56,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:27:56,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:27:56,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:27:56,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:27:57,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:27:57,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:27:57,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:27:58,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:27:58,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:27:58,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:27:58,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:27:58,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:58,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:58,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:58,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-10 07:27:58,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 07:27:58,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 34 [2022-11-10 07:27:58,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:58,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:58,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:58,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2022-11-10 07:27:58,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:58,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:58,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:58,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2022-11-10 07:27:58,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:58,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:58,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:58,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2022-11-10 07:27:58,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:58,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:58,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:58,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2022-11-10 07:27:58,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:58,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:58,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:58,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:58,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:27:58,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2022-11-10 07:27:58,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 0 proven. 383 refuted. 0 times theorem prover too weak. 1253 trivial. 0 not checked. [2022-11-10 07:27:58,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 07:28:02,292 INFO L356 Elim1Store]: treesize reduction 156, result has 31.3 percent of original size [2022-11-10 07:28:02,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 81 [2022-11-10 07:28:02,358 INFO L356 Elim1Store]: treesize reduction 156, result has 31.3 percent of original size [2022-11-10 07:28:02,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 83 [2022-11-10 07:28:02,415 INFO L356 Elim1Store]: treesize reduction 156, result has 31.3 percent of original size [2022-11-10 07:28:02,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 83 [2022-11-10 07:28:02,467 INFO L356 Elim1Store]: treesize reduction 156, result has 31.3 percent of original size [2022-11-10 07:28:02,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 83 [2022-11-10 07:28:02,481 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) (.cse5 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) (.cse1 (+ 3 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) (.cse0 (not (= (* (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) .cse3) 4) 16)))) (and (or .cse0 (forall ((v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 .cse1) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse2) 0)))) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 .cse3) 0)) (not (= (select v_arrayElimArr_2 .cse1) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse4) 0))) (forall ((v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 .cse1) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse2) 0) (not (= (select v_arrayElimArr_3 .cse3) 0)))) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse1) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))) .cse0) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select v_arrayElimArr_4 .cse1) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0))) (or .cse0 (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse1) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 .cse3) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 .cse1) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse4) 0))) .cse0)))) is different from false [2022-11-10 07:28:03,403 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) (.cse5 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) (.cse1 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) (.cse0 (not (= 16 (* (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) .cse3) 4)))) (.cse2 (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 3))) (and (or .cse0 (forall ((v_arrayElimArr_3 (Array Int Int))) (or (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1) 0) (not (= (select v_arrayElimArr_3 .cse2) 0))))) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 .cse3) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse4) 0) (not (= (select v_arrayElimArr_2 .cse2) 0)))) (or .cse0 (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse2) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0)))) (or .cse0 (forall ((v_arrayElimArr_2 (Array Int Int))) (or (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse4) 0) (not (= (select v_arrayElimArr_2 .cse2) 0))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse2) 0)) (not (= (select v_arrayElimArr_4 .cse3) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse3) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))) (forall ((v_arrayElimArr_3 (Array Int Int))) (or (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1) 0) (not (= (select v_arrayElimArr_3 .cse3) 0)) (not (= (select v_arrayElimArr_3 .cse2) 0)))) (or .cse0 (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse2) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))))))) is different from false [2022-11-10 07:28:03,690 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_writer_fnThread1of1ForFork0_~arg#1.offset| 20))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) (.cse3 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) (.cse1 (+ |c_writer_fnThread1of1ForFork0_~arg#1.offset| 3)) (.cse0 (not (= 16 (* (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~arg#1.base|) .cse4) 4))))) (and (or .cse0 (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_1 .cse1) 0))))) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse1) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse2) 0))) .cse0) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse3) 0) (not (= 0 (select v_arrayElimArr_2 .cse1))) (not (= (select v_arrayElimArr_2 .cse4) 0)))) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (or (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0) (not (= (select v_arrayElimArr_3 .cse1) 0)))) .cse0) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 .cse4) 0)))) (forall ((v_arrayElimArr_3 (Array Int Int))) (or (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0) (not (= (select v_arrayElimArr_3 .cse4) 0)) (not (= (select v_arrayElimArr_3 .cse1) 0)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse1) 0)) (not (= (select v_arrayElimArr_4 .cse4) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse2) 0))) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse3) 0) (not (= 0 (select v_arrayElimArr_2 .cse1))))) .cse0)))) is different from false [2022-11-10 07:28:04,650 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 20 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) (.cse4 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) (.cse5 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) (.cse1 (+ 3 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|)) (.cse0 (not (= (* (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) .cse3) 4) 16)))) (and (or .cse0 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse1) 0)) (= 0 (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|))))) (or .cse0 (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 .cse1) 0)) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse2) 0)))) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 .cse1) 0)) (not (= (select v_arrayElimArr_3 .cse3) 0)) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse2) 0))) (or .cse0 (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse4) 0) (not (= (select v_arrayElimArr_4 .cse1) 0))))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0) (not (= (select v_arrayElimArr_2 .cse3) 0)) (not (= (select v_arrayElimArr_2 .cse1) 0)))) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse4) 0) (not (= (select v_arrayElimArr_4 .cse1) 0)) (not (= (select v_arrayElimArr_4 .cse3) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 .cse3) 0)) (= 0 (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|)))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0) (not (= (select v_arrayElimArr_2 .cse1) 0)))) .cse0)))) is different from false [2022-11-10 07:28:05,691 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 20 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) (.cse4 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) (.cse5 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) (.cse3 (not (= (* (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) .cse2) 4) 16))) (.cse0 (+ 3 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|))) (and (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse0) 0)) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1) 0) (not (= (select v_arrayElimArr_4 .cse2) 0)))) (or .cse3 (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse4) 0) (not (= (select v_arrayElimArr_3 .cse0) 0))))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0) (not (= (select v_arrayElimArr_2 .cse0) 0)))) .cse3) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse0) 0)) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1) 0))) .cse3) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse4) 0) (not (= (select v_arrayElimArr_3 .cse0) 0)) (not (= (select v_arrayElimArr_3 .cse2) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 .cse2) 0)) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0) (not (= (select v_arrayElimArr_2 .cse0) 0)))) (or .cse3 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_1 .cse0) 0)))))))) is different from false [2022-11-10 07:28:06,370 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 20 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) (.cse5 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) (.cse4 (not (= (* (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) .cse2) 4) 16))) (.cse0 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) (.cse1 (+ 3 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|))) (and (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse0) 0) (not (= (select v_arrayElimArr_4 .cse1) 0)) (not (= (select v_arrayElimArr_4 .cse2) 0)))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse3) 0) (not (= (select v_arrayElimArr_2 .cse1) 0)))) .cse4) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_1 .cse1) 0)))) .cse4) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 .cse1) 0)) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0) (not (= (select v_arrayElimArr_3 .cse2) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse3) 0) (not (= (select v_arrayElimArr_2 .cse2) 0)) (not (= (select v_arrayElimArr_2 .cse1) 0)))) (or (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 .cse1) 0)) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0))) .cse4) (or .cse4 (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse0) 0) (not (= (select v_arrayElimArr_4 .cse1) 0)))))))) is different from false [2022-11-10 07:28:06,849 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) (.cse5 (+ 20 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) (.cse3 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) (.cse0 (not (= (* (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) .cse5) 4) 16))) (.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#reader~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse6 0))) (.cse1 (+ 3 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|))) (and (or .cse0 (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 .cse1) 0)) (= (select (select (store (store .cse2 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse3) 0)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store .cse2 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse4) 0) (not (= (select v_arrayElimArr_2 .cse5) 0)) (not (= (select v_arrayElimArr_2 .cse1) 0)))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store .cse2 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse4) 0) (not (= (select v_arrayElimArr_2 .cse1) 0)))) .cse0) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse1) 0)) (not (= (select v_arrayElimArr_4 .cse5) 0)) (= (select (select (store (store .cse2 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse6) 0))) (or .cse0 (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse1) 0)) (= (select (select (store (store .cse2 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse6) 0)))) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 .cse1) 0)) (= (select (select (store (store .cse2 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse3) 0) (not (= (select v_arrayElimArr_3 .cse5) 0)))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store .cse2 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_1 .cse1) 0)))) .cse0) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store .cse2 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 .cse5) 0))))))) is different from false [2022-11-10 07:28:06,895 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) (.cse6 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) (.cse2 (+ 20 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) (.cse4 (not (= (* (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) .cse2) 4) 16))) (.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#reader~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5 0) .cse6 0))) (.cse3 (+ 3 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|))) (and (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1) 0) (not (= (select v_arrayElimArr_2 .cse2) 0)) (not (= (select v_arrayElimArr_2 .cse3) 0)))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1) 0) (not (= (select v_arrayElimArr_2 .cse3) 0)))) .cse4) (or (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0) (not (= (select v_arrayElimArr_3 .cse3) 0)))) .cse4) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse3) 0)) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))) .cse4) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse3) 0)) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_1 .cse2) 0)))) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse6) 0) (not (= (select v_arrayElimArr_4 .cse3) 0)))) .cse4) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse6) 0) (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select v_arrayElimArr_4 .cse2) 0)))) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0) (not (= (select v_arrayElimArr_3 .cse3) 0)) (not (= (select v_arrayElimArr_3 .cse2) 0))))))) is different from false [2022-11-10 07:28:07,248 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 07:28:07,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 36 treesize of output 52 [2022-11-10 07:28:07,257 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 07:28:07,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 64 [2022-11-10 07:28:07,269 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 07:28:07,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 64 [2022-11-10 07:28:07,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 20 [2022-11-10 07:28:07,312 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 07:28:07,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54 [2022-11-10 07:28:07,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 98 treesize of output 70 [2022-11-10 07:28:07,328 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-10 07:28:07,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 46 [2022-11-10 07:28:07,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 20 [2022-11-10 07:28:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1632 trivial. 3 not checked. [2022-11-10 07:28:08,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860665126] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 07:28:08,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 07:28:08,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 30, 27] total 76 [2022-11-10 07:28:08,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059907326] [2022-11-10 07:28:08,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 07:28:08,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-10 07:28:08,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:28:08,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-10 07:28:08,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=4196, Unknown=152, NotChecked=1128, Total=5852 [2022-11-10 07:28:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:08,677 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:28:08,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 8.578947368421053) internal successors, (652), 77 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:28:08,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:08,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:08,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:08,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:28:08,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:08,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:28:08,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:08,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:08,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:28:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:28:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:45,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-10 07:28:45,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-10 07:28:45,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:28:45,861 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:28:45,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:28:45,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2136224665, now seen corresponding path program 2 times [2022-11-10 07:28:45,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:28:45,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078569441] [2022-11-10 07:28:45,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:28:45,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:28:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:28:49,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1669 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1635 trivial. 0 not checked. [2022-11-10 07:28:49,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:28:49,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078569441] [2022-11-10 07:28:49,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078569441] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 07:28:49,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550131428] [2022-11-10 07:28:49,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-10 07:28:49,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:28:49,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:28:49,787 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 07:28:49,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-10 07:28:50,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-10 07:28:50,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 07:28:50,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 2198 conjuncts, 134 conjunts are in the unsatisfiable core [2022-11-10 07:28:50,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 07:28:50,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-10 07:28:50,621 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-10 07:28:50,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-10 07:28:50,651 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 07:28:50,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-10 07:28:55,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 07:28:55,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:55,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 07:28:55,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:55,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:55,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 07:28:55,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:55,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:55,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:55,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 07:28:56,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:56,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:56,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:56,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:56,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:56,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:56,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:56,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:56,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:56,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:56,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:56,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:56,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:56,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:56,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:56,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:56,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:56,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:56,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:56,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:56,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:56,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:56,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:57,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:57,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:57,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:57,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:57,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:57,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:57,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:57,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:57,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:57,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:57,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:57,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:57,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:28:57,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1669 backedges. 0 proven. 413 refuted. 0 times theorem prover too weak. 1256 trivial. 0 not checked. [2022-11-10 07:28:57,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 07:28:57,862 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))) is different from false [2022-11-10 07:28:58,036 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0))) is different from false [2022-11-10 07:28:58,053 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0))) is different from false [2022-11-10 07:28:58,091 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_5043 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|))) (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0))) is different from false [2022-11-10 07:28:58,101 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0))) is different from false [2022-11-10 07:28:58,197 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5043 (Array Int Int)) (v_ArrVal_5030 (Array Int Int))) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| v_ArrVal_5030) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5043 (Array Int Int)) (v_ArrVal_5030 (Array Int Int))) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| v_ArrVal_5030) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_5043 (Array Int Int)) (v_ArrVal_5030 (Array Int Int))) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| v_ArrVal_5030) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_5043 (Array Int Int)) (v_ArrVal_5030 (Array Int Int))) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| v_ArrVal_5030) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0))) is different from false [2022-11-10 07:28:59,510 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5043 (Array Int Int)) (v_ArrVal_5030 (Array Int Int))) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_5030) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_5043 (Array Int Int)) (v_ArrVal_5030 (Array Int Int))) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_5030) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5043 (Array Int Int)) (v_ArrVal_5030 (Array Int Int))) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_5030) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_5043 (Array Int Int)) (v_ArrVal_5030 (Array Int Int))) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_5030) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))) is different from false [2022-11-10 07:28:59,520 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#reader~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_5043 (Array Int Int)) (v_ArrVal_5030 (Array Int Int))) (= 0 (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_5030) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1))) (forall ((v_ArrVal_5043 (Array Int Int)) (v_ArrVal_5030 (Array Int Int))) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_5030) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5043 (Array Int Int)) (v_ArrVal_5030 (Array Int Int))) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_5030) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_5043 (Array Int Int)) (v_ArrVal_5030 (Array Int Int))) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_5030) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))))) is different from false [2022-11-10 07:28:59,532 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#reader~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_5043 (Array Int Int)) (v_ArrVal_5030 (Array Int Int))) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_5030) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_5043 (Array Int Int)) (v_ArrVal_5030 (Array Int Int))) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_5030) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_5043 (Array Int Int)) (v_ArrVal_5030 (Array Int Int))) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_5030) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_5043 (Array Int Int)) (v_ArrVal_5030 (Array Int Int))) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_5030) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))))) is different from false [2022-11-10 07:28:59,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 07:28:59,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 36 treesize of output 52 [2022-11-10 07:28:59,620 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 07:28:59,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 122 [2022-11-10 07:28:59,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 90 treesize of output 82 [2022-11-10 07:28:59,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-11-10 07:29:00,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1669 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1635 trivial. 31 not checked. [2022-11-10 07:29:00,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550131428] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 07:29:00,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 07:29:00,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28, 21] total 70 [2022-11-10 07:29:00,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292867712] [2022-11-10 07:29:00,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 07:29:00,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-11-10 07:29:00,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:29:00,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-11-10 07:29:00,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=3408, Unknown=61, NotChecked=1152, Total=4970 [2022-11-10 07:29:00,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:00,790 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:29:00,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 10.385714285714286) internal successors, (727), 71 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:29:00,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:00,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:00,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:00,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:29:00,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:00,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:29:00,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:00,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:00,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-10 07:29:00,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:04,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:04,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:04,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:29:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:29:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-10 07:29:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-10 07:29:04,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-10 07:29:04,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:29:04,248 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:29:04,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:29:04,248 INFO L85 PathProgramCache]: Analyzing trace with hash 90250956, now seen corresponding path program 1 times [2022-11-10 07:29:04,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:29:04,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186223608] [2022-11-10 07:29:04,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:29:04,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:29:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:29:09,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1679 backedges. 0 proven. 418 refuted. 0 times theorem prover too weak. 1261 trivial. 0 not checked. [2022-11-10 07:29:09,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:29:09,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186223608] [2022-11-10 07:29:09,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186223608] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 07:29:09,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753701806] [2022-11-10 07:29:09,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:29:09,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:29:09,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:29:09,777 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 07:29:09,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-10 07:29:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:29:10,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 2317 conjuncts, 150 conjunts are in the unsatisfiable core [2022-11-10 07:29:10,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 07:29:10,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-10 07:29:10,656 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-10 07:29:10,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-10 07:29:10,694 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 07:29:10,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-10 07:29:17,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 07:29:17,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:29:17,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 07:29:17,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:29:17,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:29:17,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 07:29:17,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:29:17,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:29:17,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:29:17,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 07:29:18,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:29:18,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:29:18,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:29:18,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:29:18,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:29:18,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:29:18,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:29:18,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:29:18,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:29:18,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:29:18,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:29:18,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:29:18,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:29:18,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:29:18,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:18,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:18,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:18,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:18,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:18,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:18,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:18,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:18,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-11-10 07:29:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1679 backedges. 0 proven. 771 refuted. 0 times theorem prover too weak. 908 trivial. 0 not checked. [2022-11-10 07:29:19,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 07:29:20,073 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6254 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_6254 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_6254 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_6254 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0))) is different from false [2022-11-10 07:29:20,107 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6254 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|))) (forall ((v_ArrVal_6254 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_6254 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_6254 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0))) is different from false [2022-11-10 07:29:20,713 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6254 (Array Int Int)) (v_ArrVal_6253 (Array Int Int))) (= (select (select (store (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_ArrVal_6253) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_6254 (Array Int Int)) (v_ArrVal_6253 (Array Int Int))) (= (select (select (store (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_ArrVal_6253) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_6254 (Array Int Int)) (v_ArrVal_6253 (Array Int Int))) (= (select (select (store (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_ArrVal_6253) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_6254 (Array Int Int)) (v_ArrVal_6253 (Array Int Int))) (= (select (select (store (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_ArrVal_6253) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0))) is different from false [2022-11-10 07:29:20,771 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6254 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_6254 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_6254 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_6254 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1))))) is different from false [2022-11-10 07:29:20,783 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6254 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_6254 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_6254 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_6254 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0))) is different from false [2022-11-10 07:29:21,284 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#reader~0#1.base| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|)) (forall ((v_ArrVal_6221 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| v_ArrVal_6221) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_6221 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| v_ArrVal_6221) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_6221 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| v_ArrVal_6221) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_6221 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| v_ArrVal_6221) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (not (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_ULTIMATE.start_main_~#reader~0#1.base|))) is different from false [2022-11-10 07:29:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1679 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1640 trivial. 33 not checked. [2022-11-10 07:29:22,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753701806] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 07:29:22,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 07:29:22,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 23] total 75 [2022-11-10 07:29:22,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209467703] [2022-11-10 07:29:22,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 07:29:22,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-11-10 07:29:22,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:29:22,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-11-10 07:29:22,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=4344, Unknown=142, NotChecked=846, Total=5700 [2022-11-10 07:29:22,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:22,792 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:29:22,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 11.88) internal successors, (891), 76 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:29:22,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:22,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:22,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:22,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:29:22,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:22,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:29:22,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:22,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:22,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-10 07:29:22,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-10 07:29:22,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:27,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:27,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:27,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:29:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:29:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-10 07:29:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-10 07:29:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-10 07:29:27,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-10 07:29:27,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:29:27,299 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:29:27,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:29:27,299 INFO L85 PathProgramCache]: Analyzing trace with hash -836440657, now seen corresponding path program 1 times [2022-11-10 07:29:27,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:29:27,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399170417] [2022-11-10 07:29:27,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:29:27,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:29:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:29:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1656 trivial. 0 not checked. [2022-11-10 07:29:30,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:29:30,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399170417] [2022-11-10 07:29:30,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399170417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:29:30,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 07:29:30,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-10 07:29:30,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739811409] [2022-11-10 07:29:30,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:29:30,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-10 07:29:30,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:29:30,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-10 07:29:30,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-11-10 07:29:30,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:30,545 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:29:30,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 11.61111111111111) internal successors, (209), 19 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:29:30,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:30,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:30,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:30,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:29:30,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:30,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:29:30,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:30,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:30,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-10 07:29:30,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-10 07:29:30,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-10 07:29:30,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:31,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:31,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:31,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:31,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:29:31,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:31,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:29:31,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:31,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:31,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-10 07:29:31,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-10 07:29:31,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-10 07:29:31,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 07:29:31,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-10 07:29:31,813 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:29:31,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:29:31,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1243532603, now seen corresponding path program 1 times [2022-11-10 07:29:31,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:29:31,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988244370] [2022-11-10 07:29:31,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:29:31,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:29:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:29:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1656 trivial. 0 not checked. [2022-11-10 07:29:33,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:29:33,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988244370] [2022-11-10 07:29:33,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988244370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:29:33,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 07:29:33,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-10 07:29:33,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412567789] [2022-11-10 07:29:33,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:29:33,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 07:29:33,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:29:33,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 07:29:33,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 07:29:33,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:33,103 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:29:33,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:29:33,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:33,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:33,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:33,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:29:33,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:33,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:29:33,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:33,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:33,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-10 07:29:33,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-10 07:29:33,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-10 07:29:33,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 07:29:33,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:33,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:29:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:29:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-10 07:29:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-10 07:29:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-10 07:29:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 07:29:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:33,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-10 07:29:33,435 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:29:33,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:29:33,435 INFO L85 PathProgramCache]: Analyzing trace with hash -446569654, now seen corresponding path program 1 times [2022-11-10 07:29:33,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:29:33,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131212236] [2022-11-10 07:29:33,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:29:33,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:29:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:29:38,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1656 trivial. 0 not checked. [2022-11-10 07:29:38,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:29:38,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131212236] [2022-11-10 07:29:38,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131212236] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:29:38,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 07:29:38,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-11-10 07:29:38,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276896909] [2022-11-10 07:29:38,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:29:38,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-10 07:29:38,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:29:38,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-10 07:29:38,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2022-11-10 07:29:38,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:38,436 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:29:38,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 10.666666666666666) internal successors, (256), 25 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:29:38,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:38,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:38,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:38,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:29:38,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:38,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:29:38,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:38,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:38,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-10 07:29:38,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-10 07:29:38,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-10 07:29:38,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 07:29:38,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:38,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:55,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:55,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:55,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:55,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:29:55,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:55,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:29:55,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:55,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:55,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-10 07:29:55,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-10 07:29:55,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-10 07:29:55,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 07:29:55,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:55,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-10 07:29:55,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-10 07:29:55,588 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:29:55,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:29:55,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1402212096, now seen corresponding path program 1 times [2022-11-10 07:29:55,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:29:55,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6897569] [2022-11-10 07:29:55,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:29:55,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:29:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:29:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 85 proven. 211 refuted. 0 times theorem prover too weak. 1706 trivial. 0 not checked. [2022-11-10 07:29:57,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:29:57,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6897569] [2022-11-10 07:29:57,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6897569] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 07:29:57,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816641013] [2022-11-10 07:29:57,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:29:57,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:29:57,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:29:57,717 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 07:29:57,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-10 07:29:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:29:58,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 2510 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-10 07:29:58,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 07:29:59,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-10 07:29:59,714 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 07:29:59,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 10 [2022-11-10 07:29:59,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 32 proven. 587 refuted. 0 times theorem prover too weak. 1383 trivial. 0 not checked. [2022-11-10 07:29:59,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 07:30:00,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 99 proven. 105 refuted. 0 times theorem prover too weak. 1798 trivial. 0 not checked. [2022-11-10 07:30:00,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816641013] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 07:30:00,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 07:30:00,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 25, 15] total 45 [2022-11-10 07:30:00,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803783877] [2022-11-10 07:30:00,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 07:30:00,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-10 07:30:00,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:30:00,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-10 07:30:00,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1846, Unknown=0, NotChecked=0, Total=1980 [2022-11-10 07:30:00,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:30:00,173 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:30:00,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 15.044444444444444) internal successors, (677), 45 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:30:00,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:30:00,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:30:00,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:30:00,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:30:00,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:30:00,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:30:00,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:30:00,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:30:00,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-11-10 07:30:00,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-10 07:30:00,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-10 07:30:00,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 07:30:00,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:30:00,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-10 07:30:00,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:30:27,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:30:27,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:30:27,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:30:27,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:30:27,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:30:27,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:30:27,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:30:27,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:30:27,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-10 07:30:27,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-10 07:30:27,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-10 07:30:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 07:30:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:30:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-10 07:30:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-11-10 07:30:27,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-10 07:30:27,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-10 07:30:27,352 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:30:27,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:30:27,352 INFO L85 PathProgramCache]: Analyzing trace with hash -512181721, now seen corresponding path program 1 times [2022-11-10 07:30:27,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:30:27,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862772323] [2022-11-10 07:30:27,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:30:27,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:30:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:36:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 34853 backedges. 567 proven. 6073 refuted. 0 times theorem prover too weak. 28213 trivial. 0 not checked. [2022-11-10 07:36:18,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:36:18,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862772323] [2022-11-10 07:36:18,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862772323] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 07:36:18,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239738089] [2022-11-10 07:36:18,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:36:18,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:36:18,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:36:18,425 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 07:36:18,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-10 07:36:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:36:22,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 6345 conjuncts, 141 conjunts are in the unsatisfiable core [2022-11-10 07:36:22,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 07:36:41,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-10 07:37:39,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 07:37:39,823 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-10 07:37:39,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 79 treesize of output 48 [2022-11-10 07:37:43,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 149 treesize of output 79 [2022-11-10 07:37:46,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:37:46,468 INFO L356 Elim1Store]: treesize reduction 70, result has 29.3 percent of original size [2022-11-10 07:37:46,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 53 [2022-11-10 07:37:46,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:37:46,761 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 07:37:46,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 52 [2022-11-10 07:37:46,964 INFO L134 CoverageAnalysis]: Checked inductivity of 34853 backedges. 1290 proven. 22555 refuted. 0 times theorem prover too weak. 11008 trivial. 0 not checked. [2022-11-10 07:37:46,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 07:39:42,009 INFO L356 Elim1Store]: treesize reduction 75, result has 48.6 percent of original size [2022-11-10 07:39:42,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 261132 treesize of output 251663 [2022-11-10 07:39:54,554 WARN L233 SmtUtils]: Spent 12.54s on a formula simplification. DAG size of input: 1507 DAG size of output: 1503 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-10 07:39:55,395 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-10 07:39:55,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 248259 treesize of output 244661 Received shutdown request... [2022-11-10 07:41:37,222 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:41:37,226 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-10 07:41:37,227 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-10 07:41:37,227 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-10 07:41:37,227 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-10 07:41:37,227 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-10 07:41:37,227 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-10 07:41:37,227 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-10 07:41:37,227 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-10 07:41:37,227 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-10 07:41:37,227 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-10 07:41:37,227 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-10 07:41:37,227 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-10 07:41:37,227 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-10 07:41:37,227 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-10 07:41:37,228 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-10 07:41:37,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-10 07:41:37,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-10 07:41:37,436 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 2040 with TraceHistMax 52,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∨-2-2-1 context. [2022-11-10 07:41:37,439 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-10 07:41:37,440 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE was TIMEOUT (13/44) [2022-11-10 07:41:37,441 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-10 07:41:37,441 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-10 07:41:37,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:41:37 BasicIcfg [2022-11-10 07:41:37,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-10 07:41:37,455 INFO L158 Benchmark]: Toolchain (without parser) took 842917.70ms. Allocated memory was 176.2MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 144.2MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-11-10 07:41:37,455 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory was 131.0MB in the beginning and 130.9MB in the end (delta: 72.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-11-10 07:41:37,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.04ms. Allocated memory is still 176.2MB. Free memory was 143.8MB in the beginning and 121.8MB in the end (delta: 22.0MB). Peak memory consumption was 25.4MB. Max. memory is 8.0GB. [2022-11-10 07:41:37,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.99ms. Allocated memory is still 176.2MB. Free memory was 121.6MB in the beginning and 116.1MB in the end (delta: 5.4MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-11-10 07:41:37,456 INFO L158 Benchmark]: Boogie Preprocessor took 73.45ms. Allocated memory is still 176.2MB. Free memory was 116.1MB in the beginning and 111.5MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-11-10 07:41:37,456 INFO L158 Benchmark]: RCFGBuilder took 830.67ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 111.5MB in the beginning and 197.8MB in the end (delta: -86.3MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-11-10 07:41:37,456 INFO L158 Benchmark]: TraceAbstraction took 841431.09ms. Allocated memory was 243.3MB in the beginning and 3.6GB in the end (delta: 3.3GB). Free memory was 197.3MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-11-10 07:41:37,457 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory was 131.0MB in the beginning and 130.9MB in the end (delta: 72.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 489.04ms. Allocated memory is still 176.2MB. Free memory was 143.8MB in the beginning and 121.8MB in the end (delta: 22.0MB). Peak memory consumption was 25.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 87.99ms. Allocated memory is still 176.2MB. Free memory was 121.6MB in the beginning and 116.1MB in the end (delta: 5.4MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 73.45ms. Allocated memory is still 176.2MB. Free memory was 116.1MB in the beginning and 111.5MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 830.67ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 111.5MB in the beginning and 197.8MB in the end (delta: -86.3MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 841431.09ms. Allocated memory was 243.3MB in the beginning and 3.6GB in the end (delta: 3.3GB). Free memory was 197.3MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 40, Number of trivial persistent sets: 40, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 40, Number of trivial persistent sets: 40, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 47, Number of trivial persistent sets: 47, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 47, Number of trivial persistent sets: 47, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6051, positive: 6035, positive conditional: 74, positive unconditional: 5961, negative: 16, negative conditional: 3, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 5909, Positive cache size: 5896, Positive conditional cache size: 0, Positive unconditional cache size: 5896, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Independence queries for same thread: 3, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6050, positive: 6034, positive conditional: 73, positive unconditional: 5961, negative: 16, negative conditional: 3, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 5909, Positive cache size: 5896, Positive conditional cache size: 0, Positive unconditional cache size: 5896, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Independence queries for same thread: 6, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 14322, positive: 14234, positive conditional: 263, positive unconditional: 13971, negative: 88, negative conditional: 13, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 14569, Positive cache size: 14494, Positive conditional cache size: 0, Positive unconditional cache size: 14494, Negative cache size: 75, Negative conditional cache size: 0, Negative unconditional cache size: 75, Independence queries for same thread: 19, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 14870, positive: 14772, positive conditional: 801, positive unconditional: 13971, negative: 98, negative conditional: 23, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 14569, Positive cache size: 14494, Positive conditional cache size: 0, Positive unconditional cache size: 14494, Negative cache size: 75, Negative conditional cache size: 0, Negative unconditional cache size: 75, Independence queries for same thread: 42, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 16849, positive: 16676, positive conditional: 955, positive unconditional: 15721, negative: 173, negative conditional: 60, negative unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 23178, Positive cache size: 22995, Positive conditional cache size: 0, Positive unconditional cache size: 22995, Negative cache size: 183, Negative conditional cache size: 0, Negative unconditional cache size: 183, Independence queries for same thread: 75, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 16978, positive: 16783, positive conditional: 981, positive unconditional: 15802, negative: 195, negative conditional: 69, negative unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 24357, Positive cache size: 24161, Positive conditional cache size: 0, Positive unconditional cache size: 24161, Negative cache size: 196, Negative conditional cache size: 0, Negative unconditional cache size: 196, Independence queries for same thread: 109, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 17708, positive: 17505, positive conditional: 1703, positive unconditional: 15802, negative: 203, negative conditional: 77, negative unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 24357, Positive cache size: 24161, Positive conditional cache size: 0, Positive unconditional cache size: 24161, Negative cache size: 196, Negative conditional cache size: 0, Negative unconditional cache size: 196, Independence queries for same thread: 163, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 17971, positive: 17737, positive conditional: 1728, positive unconditional: 16009, negative: 234, negative conditional: 95, negative unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 25887, Positive cache size: 25633, Positive conditional cache size: 0, Positive unconditional cache size: 25633, Negative cache size: 254, Negative conditional cache size: 0, Negative unconditional cache size: 254, Independence queries for same thread: 218, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 21899, positive: 21648, positive conditional: 1848, positive unconditional: 19800, negative: 251, negative conditional: 95, negative unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 28807, Positive cache size: 28536, Positive conditional cache size: 0, Positive unconditional cache size: 28536, Negative cache size: 271, Negative conditional cache size: 0, Negative unconditional cache size: 271, Independence queries for same thread: 275, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 21699, positive: 21428, positive conditional: 1967, positive unconditional: 19461, negative: 271, negative conditional: 109, negative unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 39099, Positive cache size: 38689, Positive conditional cache size: 0, Positive unconditional cache size: 38689, Negative cache size: 410, Negative conditional cache size: 0, Negative unconditional cache size: 410, Independence queries for same thread: 336, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 23602, positive: 23263, positive conditional: 2084, positive unconditional: 21179, negative: 339, negative conditional: 140, negative unconditional: 199, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 40548, Positive cache size: 40101, Positive conditional cache size: 0, Positive unconditional cache size: 40101, Negative cache size: 447, Negative conditional cache size: 0, Negative unconditional cache size: 447, Independence queries for same thread: 404, Statistics for Abstraction: - StatisticsResult: Independence relation #12 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 31826, positive: 30217, positive conditional: 6088, positive unconditional: 24129, negative: 1609, negative conditional: 1365, negative unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 41379, Positive cache size: 40892, Positive conditional cache size: 0, Positive unconditional cache size: 40892, Negative cache size: 487, Negative conditional cache size: 0, Negative unconditional cache size: 487, Independence queries for same thread: 735, Statistics for Abstraction: - StatisticsResult: Independence relation #13 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 31953, positive: 30344, positive conditional: 6123, positive unconditional: 24221, negative: 1609, negative conditional: 1357, negative unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 44470, Positive cache size: 43937, Positive conditional cache size: 0, Positive unconditional cache size: 43937, Negative cache size: 533, Negative conditional cache size: 0, Negative unconditional cache size: 533, Independence queries for same thread: 1075, Statistics for Abstraction: - StatisticsResult: Independence relation #14 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 34016, positive: 32389, positive conditional: 6222, positive unconditional: 26167, negative: 1627, negative conditional: 1356, negative unconditional: 271, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 48079, Positive cache size: 47484, Positive conditional cache size: 0, Positive unconditional cache size: 47484, Negative cache size: 595, Negative conditional cache size: 0, Negative unconditional cache size: 595, Independence queries for same thread: 1415, Statistics for Abstraction: - StatisticsResult: Independence relation #15 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 275826, positive: 200077, positive conditional: 164058, positive unconditional: 36019, negative: 75749, negative conditional: 73767, negative unconditional: 1982, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 49970, Positive cache size: 48244, Positive conditional cache size: 0, Positive unconditional cache size: 48244, Negative cache size: 1726, Negative conditional cache size: 0, Negative unconditional cache size: 1726, Independence queries for same thread: 15171, Statistics for Abstraction: - StatisticsResult: Independence relation #16 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 552308, positive: 388829, positive conditional: 352951, positive unconditional: 35878, negative: 163479, negative conditional: 161489, negative unconditional: 1990, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 52470, Positive cache size: 50740, Positive conditional cache size: 0, Positive unconditional cache size: 50740, Negative cache size: 1730, Negative conditional cache size: 0, Negative unconditional cache size: 1730, Independence queries for same thread: 48032, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 81, Number of trivial persistent sets: 60, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 6051, positive: 6035, positive conditional: 74, positive unconditional: 5961, negative: 16, negative conditional: 3, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 5909, Positive cache size: 5896, Positive conditional cache size: 0, Positive unconditional cache size: 5896, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Independence queries for same thread: 3, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 81, Number of trivial persistent sets: 60, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 6050, positive: 6034, positive conditional: 73, positive unconditional: 5961, negative: 16, negative conditional: 3, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 5909, Positive cache size: 5896, Positive conditional cache size: 0, Positive unconditional cache size: 5896, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Independence queries for same thread: 6, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 138, Number of trivial persistent sets: 90, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 14322, positive: 14234, positive conditional: 263, positive unconditional: 13971, negative: 88, negative conditional: 13, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 14569, Positive cache size: 14494, Positive conditional cache size: 0, Positive unconditional cache size: 14494, Negative cache size: 75, Negative conditional cache size: 0, Negative unconditional cache size: 75, Independence queries for same thread: 19, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 138, Number of trivial persistent sets: 90, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 14870, positive: 14772, positive conditional: 801, positive unconditional: 13971, negative: 98, negative conditional: 23, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 14569, Positive cache size: 14494, Positive conditional cache size: 0, Positive unconditional cache size: 14494, Negative cache size: 75, Negative conditional cache size: 0, Negative unconditional cache size: 75, Independence queries for same thread: 42, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 196, Number of trivial persistent sets: 147, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 16849, positive: 16676, positive conditional: 955, positive unconditional: 15721, negative: 173, negative conditional: 60, negative unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 23178, Positive cache size: 22995, Positive conditional cache size: 0, Positive unconditional cache size: 22995, Negative cache size: 183, Negative conditional cache size: 0, Negative unconditional cache size: 183, Independence queries for same thread: 75, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 203, Number of trivial persistent sets: 154, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 16978, positive: 16783, positive conditional: 981, positive unconditional: 15802, negative: 195, negative conditional: 69, negative unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 24357, Positive cache size: 24161, Positive conditional cache size: 0, Positive unconditional cache size: 24161, Negative cache size: 196, Negative conditional cache size: 0, Negative unconditional cache size: 196, Independence queries for same thread: 109, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 203, Number of trivial persistent sets: 154, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 17708, positive: 17505, positive conditional: 1703, positive unconditional: 15802, negative: 203, negative conditional: 77, negative unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 24357, Positive cache size: 24161, Positive conditional cache size: 0, Positive unconditional cache size: 24161, Negative cache size: 196, Negative conditional cache size: 0, Negative unconditional cache size: 196, Independence queries for same thread: 163, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 209, Number of trivial persistent sets: 160, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 17971, positive: 17737, positive conditional: 1728, positive unconditional: 16009, negative: 234, negative conditional: 95, negative unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 25887, Positive cache size: 25633, Positive conditional cache size: 0, Positive unconditional cache size: 25633, Negative cache size: 254, Negative conditional cache size: 0, Negative unconditional cache size: 254, Independence queries for same thread: 218, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 215, Number of trivial persistent sets: 166, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 21899, positive: 21648, positive conditional: 1848, positive unconditional: 19800, negative: 251, negative conditional: 95, negative unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 28807, Positive cache size: 28536, Positive conditional cache size: 0, Positive unconditional cache size: 28536, Negative cache size: 271, Negative conditional cache size: 0, Negative unconditional cache size: 271, Independence queries for same thread: 275, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 215, Number of trivial persistent sets: 168, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 21699, positive: 21428, positive conditional: 1967, positive unconditional: 19461, negative: 271, negative conditional: 109, negative unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 39099, Positive cache size: 38689, Positive conditional cache size: 0, Positive unconditional cache size: 38689, Negative cache size: 410, Negative conditional cache size: 0, Negative unconditional cache size: 410, Independence queries for same thread: 336, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 243, Number of trivial persistent sets: 196, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 23602, positive: 23263, positive conditional: 2084, positive unconditional: 21179, negative: 339, negative conditional: 140, negative unconditional: 199, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 40548, Positive cache size: 40101, Positive conditional cache size: 0, Positive unconditional cache size: 40101, Negative cache size: 447, Negative conditional cache size: 0, Negative unconditional cache size: 447, Independence queries for same thread: 404, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 969, Number of trivial persistent sets: 912, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 31826, positive: 30217, positive conditional: 6088, positive unconditional: 24129, negative: 1609, negative conditional: 1365, negative unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 41379, Positive cache size: 40892, Positive conditional cache size: 0, Positive unconditional cache size: 40892, Negative cache size: 487, Negative conditional cache size: 0, Negative unconditional cache size: 487, Independence queries for same thread: 735, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 1012, Number of trivial persistent sets: 954, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 31953, positive: 30344, positive conditional: 6123, positive unconditional: 24221, negative: 1609, negative conditional: 1357, negative unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 44470, Positive cache size: 43937, Positive conditional cache size: 0, Positive unconditional cache size: 43937, Negative cache size: 533, Negative conditional cache size: 0, Negative unconditional cache size: 533, Independence queries for same thread: 1075, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 1020, Number of trivial persistent sets: 962, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 34016, positive: 32389, positive conditional: 6222, positive unconditional: 26167, negative: 1627, negative conditional: 1356, negative unconditional: 271, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 48079, Positive cache size: 47484, Positive conditional cache size: 0, Positive unconditional cache size: 47484, Negative cache size: 595, Negative conditional cache size: 0, Negative unconditional cache size: 595, Independence queries for same thread: 1415, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 6310, Number of trivial persistent sets: 6176, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 275826, positive: 200077, positive conditional: 164058, positive unconditional: 36019, negative: 75749, negative conditional: 73767, negative unconditional: 1982, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 49970, Positive cache size: 48244, Positive conditional cache size: 0, Positive unconditional cache size: 48244, Negative cache size: 1726, Negative conditional cache size: 0, Negative unconditional cache size: 1726, Independence queries for same thread: 15171, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 6236, Number of trivial persistent sets: 6102, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 552308, positive: 388829, positive conditional: 352951, positive unconditional: 35878, negative: 163479, negative conditional: 161489, negative unconditional: 1990, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1103928, positive: 857971, positive conditional: 547919, positive unconditional: 310052, negative: 245957, negative conditional: 240021, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1055896, positive: 857971, positive conditional: 0, positive unconditional: 857971, negative: 197925, negative conditional: 0, negative unconditional: 197925, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52470, positive: 50740, positive conditional: 0, positive unconditional: 50740, negative: 1730, negative conditional: 0, negative unconditional: 1730, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1055896, positive: 807231, positive conditional: 0, positive unconditional: 807231, negative: 196195, negative conditional: 0, negative unconditional: 196195, unknown: 52470, unknown conditional: 0, unknown unconditional: 52470] , Statistics on independence cache: Total cache size (in pairs): 52470, Positive cache size: 50740, Positive conditional cache size: 0, Positive unconditional cache size: 50740, Negative cache size: 1730, Negative conditional cache size: 0, Negative unconditional cache size: 1730, Independence queries for same thread: 48032, Statistics for Abstraction: - PositiveResult [Line: 820]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 820]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 815]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 815]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 816]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 816]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1062]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1062]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1064]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1065]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 823]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 823]: there are no data races For all program executions holds that there are no data races at this location - TimeoutResultAtElement [Line: 1079]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PartialOrderCegarLoop was analyzing trace of length 2040 with TraceHistMax 52,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∨-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr0ASSERT_VIOLATIONDATA_RACE with 1 thread instances CFG has 5 procedures, 594 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr1ASSERT_VIOLATIONDATA_RACE with 1 thread instances CFG has 5 procedures, 594 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr2ASSERT_VIOLATIONDATA_RACE with 1 thread instances CFG has 5 procedures, 594 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr3ASSERT_VIOLATIONDATA_RACE with 1 thread instances CFG has 5 procedures, 594 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr4ASSERT_VIOLATIONDATA_RACE with 1 thread instances CFG has 5 procedures, 594 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr5ASSERT_VIOLATIONDATA_RACE with 1 thread instances CFG has 5 procedures, 594 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr6ASSERT_VIOLATIONDATA_RACE with 1 thread instances CFG has 5 procedures, 594 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr7ASSERT_VIOLATIONDATA_RACE with 1 thread instances CFG has 5 procedures, 594 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr8ASSERT_VIOLATIONDATA_RACE with 1 thread instances CFG has 5 procedures, 594 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr9ASSERT_VIOLATIONDATA_RACE with 1 thread instances CFG has 5 procedures, 594 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE with 1 thread instances CFG has 5 procedures, 594 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE with 1 thread instances CFG has 5 procedures, 594 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 127 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE with 1 thread instances CFG has 5 procedures, 594 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 839.8s, OverallIterations: 16, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 91.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 359, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 71.3s InterpolantComputationTime, 10827 NumberOfCodeBlocks, 10595 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 14026 ConstructedInterpolants, 300 QuantifiedInterpolants, 163357 SizeOfPredicates, 174 NumberOfNonLiveVariables, 11109 ConjunctsInSsa, 539 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 26891/31305 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown