/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 02:32:59,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-10 02:32:59,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-10 02:32:59,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-10 02:32:59,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-10 02:32:59,380 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-10 02:32:59,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-10 02:32:59,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-10 02:32:59,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-10 02:32:59,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-10 02:32:59,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-10 02:32:59,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-10 02:32:59,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-10 02:32:59,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-10 02:32:59,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-10 02:32:59,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-10 02:32:59,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-10 02:32:59,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-10 02:32:59,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-10 02:32:59,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-10 02:32:59,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-10 02:32:59,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-10 02:32:59,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-10 02:32:59,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-10 02:32:59,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-10 02:32:59,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-10 02:32:59,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-10 02:32:59,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-10 02:32:59,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-10 02:32:59,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-10 02:32:59,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-10 02:32:59,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-10 02:32:59,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-10 02:32:59,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-10 02:32:59,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-10 02:32:59,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-10 02:32:59,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-10 02:32:59,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-10 02:32:59,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-10 02:32:59,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-10 02:32:59,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-10 02:32:59,427 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf [2022-11-10 02:32:59,453 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-10 02:32:59,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-10 02:32:59,454 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-10 02:32:59,454 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-10 02:32:59,454 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-10 02:32:59,454 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-10 02:32:59,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-10 02:32:59,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-10 02:32:59,455 INFO L138 SettingsManager]: * Use SBE=true [2022-11-10 02:32:59,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-10 02:32:59,456 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-10 02:32:59,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-10 02:32:59,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-10 02:32:59,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-10 02:32:59,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-10 02:32:59,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-10 02:32:59,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-10 02:32:59,457 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-10 02:32:59,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-10 02:32:59,457 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-10 02:32:59,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-10 02:32:59,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-10 02:32:59,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-10 02:32:59,457 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-10 02:32:59,457 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-10 02:32:59,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-10 02:32:59,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-10 02:32:59,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-10 02:32:59,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-10 02:32:59,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-10 02:32:59,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-10 02:32:59,459 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-10 02:32:59,459 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-10 02:32:59,459 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-10 02:32:59,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-10 02:32:59,459 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-10 02:32:59,459 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-10 02:32:59,459 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-10 02:32:59,460 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 02:32:59,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-10 02:32:59,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-10 02:32:59,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-10 02:32:59,685 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-10 02:32:59,686 INFO L275 PluginConnector]: CDTParser initialized [2022-11-10 02:32:59,687 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 02:32:59,732 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f10059f08/326c7d4ecdf3409091de11ea45923af0/FLAG5cb6f079d [2022-11-10 02:33:00,164 INFO L306 CDTParser]: Found 1 translation units. [2022-11-10 02:33:00,165 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2022-11-10 02:33:00,190 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f10059f08/326c7d4ecdf3409091de11ea45923af0/FLAG5cb6f079d [2022-11-10 02:33:00,488 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f10059f08/326c7d4ecdf3409091de11ea45923af0 [2022-11-10 02:33:00,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-10 02:33:00,491 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-10 02:33:00,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-10 02:33:00,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-10 02:33:00,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-10 02:33:00,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:33:00" (1/1) ... [2022-11-10 02:33:00,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a13d08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:00, skipping insertion in model container [2022-11-10 02:33:00,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:33:00" (1/1) ... [2022-11-10 02:33:00,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-10 02:33:00,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-10 02:33:00,653 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-10 02:33:00,831 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 02:33:00,833 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 02:33:00,835 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 02:33:00,880 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 02:33:00,880 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 02:33:00,883 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 02:33:00,885 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 02:33:00,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-10 02:33:00,903 INFO L203 MainTranslator]: Completed pre-run [2022-11-10 02:33:00,919 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-10 02:33:00,960 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 02:33:00,960 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 02:33:00,961 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 02:33:00,968 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 02:33:00,968 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 02:33:00,970 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 02:33:00,970 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 02:33:00,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-10 02:33:01,021 INFO L208 MainTranslator]: Completed translation [2022-11-10 02:33:01,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:01 WrapperNode [2022-11-10 02:33:01,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-10 02:33:01,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-10 02:33:01,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-10 02:33:01,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-10 02:33:01,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:01" (1/1) ... [2022-11-10 02:33:01,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:01" (1/1) ... [2022-11-10 02:33:01,078 INFO L138 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 345 [2022-11-10 02:33:01,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-10 02:33:01,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-10 02:33:01,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-10 02:33:01,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-10 02:33:01,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:01" (1/1) ... [2022-11-10 02:33:01,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:01" (1/1) ... [2022-11-10 02:33:01,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:01" (1/1) ... [2022-11-10 02:33:01,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:01" (1/1) ... [2022-11-10 02:33:01,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:01" (1/1) ... [2022-11-10 02:33:01,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:01" (1/1) ... [2022-11-10 02:33:01,138 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:01" (1/1) ... [2022-11-10 02:33:01,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:01" (1/1) ... [2022-11-10 02:33:01,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-10 02:33:01,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-10 02:33:01,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-10 02:33:01,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-10 02:33:01,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:01" (1/1) ... [2022-11-10 02:33:01,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-10 02:33:01,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:01,179 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 02:33:01,219 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 02:33:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-11-10 02:33:01,224 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-11-10 02:33:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-11-10 02:33:01,224 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-11-10 02:33:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-10 02:33:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-10 02:33:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-10 02:33:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-10 02:33:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-10 02:33:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-10 02:33:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-10 02:33:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-10 02:33:01,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-10 02:33:01,226 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 02:33:01,378 INFO L235 CfgBuilder]: Building ICFG [2022-11-10 02:33:01,380 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-10 02:33:01,819 INFO L276 CfgBuilder]: Performing block encoding [2022-11-10 02:33:01,830 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-10 02:33:01,830 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-10 02:33:01,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:33:01 BoogieIcfgContainer [2022-11-10 02:33:01,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-10 02:33:01,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-10 02:33:01,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-10 02:33:01,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-10 02:33:01,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:33:00" (1/3) ... [2022-11-10 02:33:01,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7587229f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:33:01, skipping insertion in model container [2022-11-10 02:33:01,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:01" (2/3) ... [2022-11-10 02:33:01,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7587229f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:33:01, skipping insertion in model container [2022-11-10 02:33:01,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:33:01" (3/3) ... [2022-11-10 02:33:01,842 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2022-11-10 02:33:01,848 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-10 02:33:01,854 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-10 02:33:01,854 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2022-11-10 02:33:01,855 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-10 02:33:01,980 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-10 02:33:02,017 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:02,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:02,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:02,020 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 02:33:02,023 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 02:33:02,046 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:02,055 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr0ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:02,059 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;@3b644b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:02,060 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:02,062 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 02:33:02,064 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:02,068 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 02:33:02,069 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr0ASSERT_VIOLATIONDATA_RACE was SAFE (1/44) [2022-11-10 02:33:02,079 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:02,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:02,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:02,081 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 02:33:02,118 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:02,118 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr1ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:02,119 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@3b644b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:02,119 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:02,119 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 02:33:02,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr1ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:02,120 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 02:33:02,120 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr1ASSERT_VIOLATIONDATA_RACE was SAFE (2/44) [2022-11-10 02:33:02,124 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 02:33:02,142 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:02,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:02,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:02,147 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 02:33:02,148 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 02:33:02,152 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:02,153 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr2ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:02,153 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;@3b644b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:02,153 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:02,154 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 02:33:02,154 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr2ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:02,155 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 02:33:02,155 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr2ASSERT_VIOLATIONDATA_RACE was SAFE (3/44) [2022-11-10 02:33:02,160 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:02,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:02,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:02,162 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 02:33:02,167 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 02:33:02,180 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:02,180 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr3ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:02,181 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;@3b644b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:02,181 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:02,181 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 02:33:02,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr3ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:02,182 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 02:33:02,182 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr3ASSERT_VIOLATIONDATA_RACE was SAFE (4/44) [2022-11-10 02:33:02,185 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:02,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:02,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:02,190 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 02:33:02,209 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 02:33:02,220 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:02,221 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr4ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:02,221 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;@3b644b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:02,221 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:02,222 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 02:33:02,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr4ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:02,222 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 02:33:02,223 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr4ASSERT_VIOLATIONDATA_RACE was SAFE (5/44) [2022-11-10 02:33:02,226 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:02,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:02,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:02,255 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 02:33:02,315 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 02:33:02,317 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:02,318 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr5ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:02,318 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;@3b644b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:02,318 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:02,319 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 02:33:02,319 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr5ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:02,319 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 02:33:02,320 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr5ASSERT_VIOLATIONDATA_RACE was SAFE (6/44) [2022-11-10 02:33:02,323 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:02,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:02,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:02,325 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 02:33:02,330 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:02,330 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr6ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:02,331 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;@3b644b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:02,331 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:02,331 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 02:33:02,331 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr6ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:02,331 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 02:33:02,332 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr6ASSERT_VIOLATIONDATA_RACE was SAFE (7/44) [2022-11-10 02:33:02,335 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:02,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:02,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:02,337 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 02:33:02,346 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 02:33:02,347 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 02:33:02,349 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:02,349 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr7ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:02,349 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;@3b644b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:02,349 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:02,350 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 02:33:02,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr7ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:02,350 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 02:33:02,350 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr7ASSERT_VIOLATIONDATA_RACE was SAFE (8/44) [2022-11-10 02:33:02,354 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:02,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:02,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:02,370 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 02:33:02,371 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 02:33:02,374 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:02,374 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr8ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:02,374 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;@3b644b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:02,374 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:02,374 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 02:33:02,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr8ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:02,375 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 02:33:02,375 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr8ASSERT_VIOLATIONDATA_RACE was SAFE (9/44) [2022-11-10 02:33:02,378 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:02,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:02,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:02,389 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 02:33:02,394 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:02,395 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr9ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:02,395 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;@3b644b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:02,395 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:02,395 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 02:33:02,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr9ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:02,396 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 02:33:02,396 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr9ASSERT_VIOLATIONDATA_RACE was SAFE (10/44) [2022-11-10 02:33:02,401 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:02,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:02,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:02,419 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 02:33:02,419 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 02:33:02,444 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:02,444 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 02:33:02,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:02,446 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;@3b644b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:02,446 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:02,467 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:02,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:02,470 INFO L85 PathProgramCache]: Analyzing trace with hash -310861093, now seen corresponding path program 1 times [2022-11-10 02:33:02,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:02,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631556501] [2022-11-10 02:33:02,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:02,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:03,033 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 02:33:03,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:03,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631556501] [2022-11-10 02:33:03,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631556501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:33:03,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 02:33:03,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 02:33:03,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729588418] [2022-11-10 02:33:03,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:33:03,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 02:33:03,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:33:03,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 02:33:03,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 02:33:03,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:03,060 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:33:03,061 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 02:33:03,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:03,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:03,093 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:03,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-10 02:33:03,094 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-10 02:33:03,096 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE was SAFE (11/44) [2022-11-10 02:33:03,099 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:03,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:03,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:03,101 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 02:33:03,102 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 02:33:03,104 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:03,105 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:03,105 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;@3b644b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:03,105 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:03,112 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:03,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:03,112 INFO L85 PathProgramCache]: Analyzing trace with hash -350431602, now seen corresponding path program 1 times [2022-11-10 02:33:03,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:03,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204767188] [2022-11-10 02:33:03,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:03,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:03,331 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 02:33:03,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:03,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204767188] [2022-11-10 02:33:03,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204767188] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:33:03,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 02:33:03,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 02:33:03,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573238718] [2022-11-10 02:33:03,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:33:03,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 02:33:03,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:33:03,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 02:33:03,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 02:33:03,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:03,337 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:33:03,337 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 02:33:03,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:03,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:03,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:03,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-10 02:33:03,375 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-10 02:33:03,375 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE was SAFE (12/44) [2022-11-10 02:33:03,378 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:03,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:03,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:03,420 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 02:33:03,421 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 02:33:03,423 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:03,423 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:03,424 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;@3b644b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:03,424 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:03,740 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:03,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:03,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1376993376, now seen corresponding path program 1 times [2022-11-10 02:33:03,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:03,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158660086] [2022-11-10 02:33:03,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:03,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:03,794 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 02:33:03,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:03,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158660086] [2022-11-10 02:33:03,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158660086] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:33:03,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 02:33:03,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-10 02:33:03,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154704292] [2022-11-10 02:33:03,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:33:03,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-10 02:33:03,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:33:03,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-10 02:33:03,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-10 02:33:03,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:03,796 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:33:03,797 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 02:33:03,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:03,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:03,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-10 02:33:03,834 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:03,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:03,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1506076095, now seen corresponding path program 1 times [2022-11-10 02:33:03,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:03,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54390085] [2022-11-10 02:33:03,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:03,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:03,898 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 02:33:03,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:03,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54390085] [2022-11-10 02:33:03,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54390085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:33:03,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 02:33:03,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-10 02:33:03,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458243136] [2022-11-10 02:33:03,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:33:03,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 02:33:03,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:33:03,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 02:33:03,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-10 02:33:03,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:03,901 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:33:03,901 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 02:33:03,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:03,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:04,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:04,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:04,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-10 02:33:04,022 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:04,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:04,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1888324694, now seen corresponding path program 1 times [2022-11-10 02:33:04,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:04,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895627084] [2022-11-10 02:33:04,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:04,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:04,180 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 02:33:04,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:04,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895627084] [2022-11-10 02:33:04,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895627084] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 02:33:04,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503176465] [2022-11-10 02:33:04,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:04,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 02:33:04,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:04,198 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 02:33:04,200 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 02:33:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:04,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-10 02:33:04,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 02:33:04,451 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 02:33:04,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 02:33:04,519 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 02:33:04,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503176465] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 02:33:04,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 02:33:04,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-10 02:33:04,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958369680] [2022-11-10 02:33:04,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 02:33:04,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-10 02:33:04,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:33:04,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-10 02:33:04,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-10 02:33:04,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:04,524 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:33:04,524 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 02:33:04,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:04,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:04,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:04,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:04,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:04,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:04,628 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 02:33:04,817 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 02:33:04,817 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:04,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:04,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1692983195, now seen corresponding path program 2 times [2022-11-10 02:33:04,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:04,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159335942] [2022-11-10 02:33:04,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:04,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:05,243 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 02:33:05,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:05,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159335942] [2022-11-10 02:33:05,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159335942] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 02:33:05,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851215867] [2022-11-10 02:33:05,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-10 02:33:05,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 02:33:05,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:05,264 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 02:33:05,294 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 02:33:05,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-10 02:33:05,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 02:33:05,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-10 02:33:05,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 02:33:05,757 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 02:33:05,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:05,780 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 02:33:05,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:05,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:05,803 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 02:33:05,803 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 02:33:05,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:05,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:05,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:05,838 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 02:33:05,838 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 02:33:05,865 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 02:33:05,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-10 02:33:05,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851215867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:33:05,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-10 02:33:05,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2022-11-10 02:33:05,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619247521] [2022-11-10 02:33:05,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:33:05,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-10 02:33:05,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:33:05,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-10 02:33:05,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-10 02:33:05,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:05,869 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:33:05,869 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 02:33:05,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:05,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:05,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:05,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:06,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:06,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:06,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:06,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:33:06,113 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 02:33:06,300 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 02:33:06,301 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:06,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:06,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2143382183, now seen corresponding path program 1 times [2022-11-10 02:33:06,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:06,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195630153] [2022-11-10 02:33:06,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:06,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:06,601 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 02:33:06,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:06,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195630153] [2022-11-10 02:33:06,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195630153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:33:06,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 02:33:06,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-10 02:33:06,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052126222] [2022-11-10 02:33:06,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:33:06,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 02:33:06,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:33:06,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 02:33:06,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-10 02:33:06,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:06,605 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:33:06,605 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 02:33:06,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:06,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:06,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:06,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:33:06,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:06,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:06,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:06,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:06,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:33:06,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:06,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-10 02:33:06,672 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:06,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:06,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2052698214, now seen corresponding path program 1 times [2022-11-10 02:33:06,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:06,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66116393] [2022-11-10 02:33:06,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:06,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:07,063 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 02:33:07,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:07,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66116393] [2022-11-10 02:33:07,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66116393] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 02:33:07,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839753320] [2022-11-10 02:33:07,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:07,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 02:33:07,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:07,084 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 02:33:07,116 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 02:33:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:07,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 1259 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-10 02:33:07,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 02:33:07,684 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 02:33:07,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 02:33:07,950 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 02:33:07,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839753320] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 02:33:07,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 02:33:07,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-10 02:33:07,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223457310] [2022-11-10 02:33:07,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 02:33:07,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-10 02:33:07,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:33:07,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-10 02:33:07,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-11-10 02:33:07,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:07,953 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:33:07,954 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 02:33:07,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:07,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:07,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:07,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:33:07,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:07,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:08,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:08,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:08,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:08,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:33:08,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:08,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:33:08,073 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 02:33:08,272 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 02:33:08,272 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:08,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:08,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1630498826, now seen corresponding path program 2 times [2022-11-10 02:33:08,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:08,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312960065] [2022-11-10 02:33:08,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:08,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:09,906 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 02:33:09,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:09,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312960065] [2022-11-10 02:33:09,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312960065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:33:09,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 02:33:09,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-10 02:33:09,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241492058] [2022-11-10 02:33:09,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:33:09,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 02:33:09,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:33:09,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 02:33:09,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 02:33:09,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:09,908 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:33:09,908 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 02:33:09,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:09,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:09,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:09,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:33:09,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:09,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:33:09,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:10,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:10,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:10,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:10,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:33:10,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:10,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:33:10,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:10,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-10 02:33:10,123 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:10,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:10,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1315870638, now seen corresponding path program 1 times [2022-11-10 02:33:10,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:10,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138350134] [2022-11-10 02:33:10,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:10,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:11,637 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 02:33:11,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:11,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138350134] [2022-11-10 02:33:11,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138350134] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:33:11,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 02:33:11,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-10 02:33:11,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660476372] [2022-11-10 02:33:11,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:33:11,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 02:33:11,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:33:11,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 02:33:11,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 02:33:11,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:11,640 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:33:11,641 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 02:33:11,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:11,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:11,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:11,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:33:11,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:11,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:33:11,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:11,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:33:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:11,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:33:11,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:11,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:11,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-10 02:33:11,831 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:11,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:11,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1103856933, now seen corresponding path program 1 times [2022-11-10 02:33:11,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:11,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864533736] [2022-11-10 02:33:11,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:11,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:15,217 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 02:33:15,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:15,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864533736] [2022-11-10 02:33:15,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864533736] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 02:33:15,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449429907] [2022-11-10 02:33:15,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:15,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 02:33:15,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:15,232 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 02:33:15,261 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 02:33:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:15,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 2120 conjuncts, 148 conjunts are in the unsatisfiable core [2022-11-10 02:33:15,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 02:33:15,969 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 02:33:15,998 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-10 02:33:15,999 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 02:33:16,008 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 02:33:16,008 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 02:33:22,369 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 02:33:22,837 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 02:33:22,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:22,911 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 02:33:22,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:22,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:22,995 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 02:33:23,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:23,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:23,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:23,083 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 02:33:24,030 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 02:33:24,055 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 02:33:24,090 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 02:33:24,145 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 02:33:24,236 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 02:33:24,259 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 02:33:24,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 02:33:24,338 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 02:33:25,466 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 02:33:25,503 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 02:33:25,519 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 02:33:25,567 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 02:33:25,639 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 02:33:25,663 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 02:33:25,702 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 02:33:25,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:25,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:25,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:25,739 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 02:33:25,929 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 02:33:25,929 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 02:33:26,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:26,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:26,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:26,047 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 02:33:26,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:26,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:26,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:26,099 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 02:33:26,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:26,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:26,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:26,147 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 02:33:26,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:26,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:26,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:26,179 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 02:33:26,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:26,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:26,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:26,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:26,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:26,360 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 02:33:26,442 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 02:33:26,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 02:33:29,832 INFO L356 Elim1Store]: treesize reduction 156, result has 31.3 percent of original size [2022-11-10 02:33:29,833 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 02:33:29,882 INFO L356 Elim1Store]: treesize reduction 156, result has 31.3 percent of original size [2022-11-10 02:33:29,882 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 02:33:29,929 INFO L356 Elim1Store]: treesize reduction 156, result has 31.3 percent of original size [2022-11-10 02:33:29,930 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 02:33:29,976 INFO L356 Elim1Store]: treesize reduction 156, result has 31.3 percent of original size [2022-11-10 02:33:29,977 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 02:33:29,991 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 02:33:30,910 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 02:33:31,153 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 02:33:32,034 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 02:33:33,086 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 02:33:33,650 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 02:33:34,175 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 02:33:34,228 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 02:33:34,539 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 02:33:34,540 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 02:33:34,547 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 02:33:34,547 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 02:33:34,559 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 02:33:34,559 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 02:33:34,566 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 02:33:34,601 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 02:33:34,601 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 02:33:34,606 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 02:33:34,614 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-10 02:33:34,615 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 02:33:34,618 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 02:33:35,993 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 02:33:35,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449429907] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 02:33:35,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 02:33:35,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 30, 27] total 76 [2022-11-10 02:33:35,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430881060] [2022-11-10 02:33:35,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 02:33:35,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-10 02:33:35,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:33:35,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-10 02:33:35,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=4196, Unknown=152, NotChecked=1128, Total=5852 [2022-11-10 02:33:35,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:35,998 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:33:35,998 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 02:33:35,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:35,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:35,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:35,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:33:35,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:35,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:33:35,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:35,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:35,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:34:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:34:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-10 02:34:12,156 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 02:34:12,353 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 02:34:12,353 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:34:12,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:34:12,353 INFO L85 PathProgramCache]: Analyzing trace with hash -2136224665, now seen corresponding path program 2 times [2022-11-10 02:34:12,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:34:12,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137729659] [2022-11-10 02:34:12,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:34:12,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:34:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:34:16,281 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 02:34:16,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:34:16,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137729659] [2022-11-10 02:34:16,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137729659] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 02:34:16,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274296338] [2022-11-10 02:34:16,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-10 02:34:16,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 02:34:16,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:34:16,285 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 02:34:16,287 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 02:34:17,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-10 02:34:17,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 02:34:17,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 2198 conjuncts, 134 conjunts are in the unsatisfiable core [2022-11-10 02:34:17,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 02:34:17,088 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 02:34:17,128 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-10 02:34:17,128 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 02:34:17,167 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 02:34:17,168 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 02:34:22,433 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 02:34:22,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:22,519 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 02:34:22,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:22,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:22,590 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 02:34:22,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:22,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:22,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:22,663 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 02:34:23,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:23,275 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 02:34:23,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:23,315 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 02:34:23,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:23,363 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 02:34:23,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:23,409 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 02:34:23,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:23,515 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 02:34:23,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:23,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, 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 02:34:23,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:23,591 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 02:34:23,617 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 02:34:24,125 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 02:34:24,165 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 02:34:24,191 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 02:34:24,213 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 02:34:24,313 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 02:34:24,341 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 02:34:24,373 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 02:34:24,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, 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 02:34:25,207 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 02:34:25,219 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 02:34:25,233 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 02:34:25,267 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 02:34:25,289 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 02:34:25,299 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 02:34:25,310 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 02:34:25,321 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 02:34:25,362 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 02:34:25,378 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 02:34:25,392 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 02:34:25,402 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 02:34:25,432 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 02:34:25,468 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 02:34:25,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 02:34:25,786 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 02:34:25,799 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 02:34:25,829 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 02:34:25,838 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 02:34:25,912 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 02:34:27,504 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 02:34:27,515 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 02:34:27,610 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 02:34:27,610 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 02:34:27,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 02:34:27,614 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 02:34:27,617 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 02:34:27,620 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 02:34:28,713 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 02:34:28,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274296338] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 02:34:28,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 02:34:28,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28, 21] total 70 [2022-11-10 02:34:28,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416198523] [2022-11-10 02:34:28,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 02:34:28,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-11-10 02:34:28,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:34:28,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-11-10 02:34:28,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=3606, Unknown=102, NotChecked=910, Total=4970 [2022-11-10 02:34:28,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:28,717 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:34:28,718 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 02:34:28,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:28,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:28,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:28,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:34:28,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:28,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:34:28,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:28,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:28,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-10 02:34:28,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:32,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:32,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:32,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:32,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:34:32,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:32,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:34:32,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:32,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:32,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-10 02:34:32,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-10 02:34:32,041 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 02:34:32,213 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 02:34:32,213 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:34:32,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:34:32,214 INFO L85 PathProgramCache]: Analyzing trace with hash 90250956, now seen corresponding path program 1 times [2022-11-10 02:34:32,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:34:32,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300634539] [2022-11-10 02:34:32,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:34:32,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:34:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:34:37,719 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 02:34:37,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:34:37,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300634539] [2022-11-10 02:34:37,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300634539] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 02:34:37,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443873325] [2022-11-10 02:34:37,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:34:37,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 02:34:37,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:34:37,723 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 02:34:37,727 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 02:34:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:34:38,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 2317 conjuncts, 150 conjunts are in the unsatisfiable core [2022-11-10 02:34:38,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 02:34:38,544 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 02:34:38,573 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-10 02:34:38,573 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 02:34:38,608 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 02:34:38,608 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 02:34:41,938 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 02:34:41,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:41,973 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 02:34:42,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:42,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:42,015 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 02:34:42,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:42,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:42,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:42,069 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 02:34:42,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:42,482 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 02:34:42,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:42,515 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 02:34:42,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:42,548 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 02:34:42,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:42,567 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 02:34:42,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:42,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, 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 02:34:42,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:42,641 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 02:34:42,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:42,660 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 02:34:42,680 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 02:34:42,930 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 02:34:42,939 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 02:34:42,948 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 02:34:42,962 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 02:34:42,992 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 02:34:43,001 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 02:34:43,015 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 02:34:43,043 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 02:34:43,560 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 02:34:43,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 02:34:43,596 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 02:34:43,609 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 02:34:43,639 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 02:34:43,652 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 02:34:43,665 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 02:34:43,678 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 02:34:43,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 02:34:43,740 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 02:34:43,753 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 02:34:43,765 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 02:34:43,801 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 02:34:43,813 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 02:34:43,825 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 02:34:43,837 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 02:34:43,884 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 02:34:43,898 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 02:34:43,914 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 02:34:43,927 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 02:34:43,965 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 02:34:43,987 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 02:34:44,002 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 02:34:44,016 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 02:34:44,237 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 02:34:44,276 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 02:34:44,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 02:34:44,603 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6253 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_6253) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_6253 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_6253) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_6253 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_6253) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)))) (forall ((v_ArrVal_6253 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_6253) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_main_~#reader~0#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|))) is different from false [2022-11-10 02:34:45,137 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_6229 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| v_ArrVal_6229) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_6229 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| v_ArrVal_6229) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_6229 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| v_ArrVal_6229) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_6229 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| v_ArrVal_6229) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))) is different from false [2022-11-10 02:34:45,363 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_6229 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_6229) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_6229 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_6229) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_6229 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_6229) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_6229 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_6229) |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 02:34:47,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1679 backedges. 0 proven. 11 refuted. 3 times theorem prover too weak. 1637 trivial. 28 not checked. [2022-11-10 02:34:47,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443873325] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 02:34:47,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 02:34:47,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 24] total 70 [2022-11-10 02:34:47,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220043155] [2022-11-10 02:34:47,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 02:34:47,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-11-10 02:34:47,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:34:47,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-11-10 02:34:47,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=4148, Unknown=71, NotChecked=402, Total=4970 [2022-11-10 02:34:47,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:47,484 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:34:47,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 12.257142857142858) internal successors, (858), 71 states have internal predecessors, (858), 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 02:34:47,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:47,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:47,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:47,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:34:47,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:47,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:34:47,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:47,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:47,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-10 02:34:47,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-10 02:34:47,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:51,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:34:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:34:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-10 02:34:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-10 02:34:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-10 02:34:51,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-10 02:34:52,131 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 02:34:52,131 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:34:52,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:34:52,132 INFO L85 PathProgramCache]: Analyzing trace with hash -836440657, now seen corresponding path program 1 times [2022-11-10 02:34:52,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:34:52,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828764926] [2022-11-10 02:34:52,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:34:52,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:34:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:34:55,379 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 02:34:55,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:34:55,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828764926] [2022-11-10 02:34:55,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828764926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:34:55,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 02:34:55,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-10 02:34:55,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076713170] [2022-11-10 02:34:55,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:34:55,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-10 02:34:55,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:34:55,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-10 02:34:55,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-11-10 02:34:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:55,381 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:34:55,381 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 02:34:55,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:55,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:55,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:55,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:34:55,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:55,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:34:55,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:55,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:55,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-10 02:34:55,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-10 02:34:55,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-11-10 02:34:55,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:56,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:56,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:56,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:56,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:34:56,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:56,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:34:56,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:56,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:56,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-10 02:34:56,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-10 02:34:56,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-10 02:34:56,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 02:34:56,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-10 02:34:56,728 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:34:56,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:34:56,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1243532603, now seen corresponding path program 1 times [2022-11-10 02:34:56,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:34:56,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144080056] [2022-11-10 02:34:56,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:34:56,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:34:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:34:57,971 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 02:34:57,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:34:57,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144080056] [2022-11-10 02:34:57,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144080056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:34:57,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 02:34:57,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-10 02:34:57,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153012708] [2022-11-10 02:34:57,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:34:57,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 02:34:57,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:34:57,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 02:34:57,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 02:34:57,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:57,973 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:34:57,973 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 02:34:57,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:57,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:57,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:57,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:34:57,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:57,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:34:57,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:57,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:57,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-10 02:34:57,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-10 02:34:57,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-11-10 02:34:57,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 02:34:57,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:34:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:34:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-10 02:34:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-10 02:34:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-10 02:34:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 02:34:58,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:58,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-10 02:34:58,281 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:34:58,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:34:58,281 INFO L85 PathProgramCache]: Analyzing trace with hash -446569654, now seen corresponding path program 1 times [2022-11-10 02:34:58,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:34:58,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889663660] [2022-11-10 02:34:58,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:34:58,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:34:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:35:03,435 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 02:35:03,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:35:03,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889663660] [2022-11-10 02:35:03,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889663660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:35:03,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 02:35:03,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-11-10 02:35:03,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122109711] [2022-11-10 02:35:03,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:35:03,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-10 02:35:03,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:35:03,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-10 02:35:03,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2022-11-10 02:35:03,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:35:03,438 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:35:03,438 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 02:35:03,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:35:03,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:35:03,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:03,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:35:03,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:35:03,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:35:03,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:03,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:03,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-10 02:35:03,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-10 02:35:03,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-11-10 02:35:03,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 02:35:03,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:03,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:35:21,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:35:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:35:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:35:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:35:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:35:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-10 02:35:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-10 02:35:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-10 02:35:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 02:35:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-10 02:35:21,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-10 02:35:21,126 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:35:21,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:35:21,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1402212096, now seen corresponding path program 1 times [2022-11-10 02:35:21,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:35:21,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941847754] [2022-11-10 02:35:21,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:35:21,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:35:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:35:23,197 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 02:35:23,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:35:23,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941847754] [2022-11-10 02:35:23,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941847754] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 02:35:23,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226880203] [2022-11-10 02:35:23,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:35:23,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 02:35:23,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:35:23,209 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 02:35:23,247 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 02:35:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:35:24,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 2510 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-10 02:35:24,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 02:35:24,955 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 02:35:25,437 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 02:35:25,437 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 02:35:25,486 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 02:35:25,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 02:35:25,955 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 02:35:25,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226880203] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 02:35:25,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 02:35:25,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 25, 15] total 45 [2022-11-10 02:35:25,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158931472] [2022-11-10 02:35:25,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 02:35:25,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-10 02:35:25,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:35:25,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-10 02:35:25,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1846, Unknown=0, NotChecked=0, Total=1980 [2022-11-10 02:35:25,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:35:25,958 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:35:25,959 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 02:35:25,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:35:25,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:35:25,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:25,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:35:25,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:35:25,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:35:25,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:25,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:25,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-11-10 02:35:25,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-10 02:35:25,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-10 02:35:25,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 02:35:25,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:25,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-10 02:35:25,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:35:47,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:35:47,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:35:47,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:47,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:35:47,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:35:47,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:35:47,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:47,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:47,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-10 02:35:47,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-10 02:35:47,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-10 02:35:47,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 02:35:47,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:47,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-10 02:35:47,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-11-10 02:35:47,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-11-10 02:35:47,784 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 02:35:47,784 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:35:47,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:35:47,784 INFO L85 PathProgramCache]: Analyzing trace with hash -512181721, now seen corresponding path program 1 times [2022-11-10 02:35:47,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:35:47,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720927674] [2022-11-10 02:35:47,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:35:47,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:35:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:41:11,718 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 02:41:11,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:41:11,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720927674] [2022-11-10 02:41:11,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720927674] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 02:41:11,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82130376] [2022-11-10 02:41:11,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:41:11,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 02:41:11,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:41:11,721 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 02:41:11,721 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 02:41:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:41:15,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 6345 conjuncts, 141 conjunts are in the unsatisfiable core [2022-11-10 02:41:15,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 02:41:39,178 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 02:42:17,132 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 02:42:17,140 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-10 02:42:17,140 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 02:42:22,804 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 02:42:26,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:42:26,052 INFO L356 Elim1Store]: treesize reduction 70, result has 29.3 percent of original size [2022-11-10 02:42:26,053 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 02:42:26,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:42:26,490 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 02:42:26,490 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 02:42:26,737 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 02:42:26,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 02:44:18,701 INFO L356 Elim1Store]: treesize reduction 75, result has 48.6 percent of original size [2022-11-10 02:44:18,703 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 02:44:30,916 WARN L233 SmtUtils]: Spent 12.21s 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 02:44:31,752 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-10 02:44:31,754 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 02:47:06,528 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:47:06,543 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 02:47:06,543 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 02:47:06,543 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 02:47:06,543 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 02:47:06,543 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 02:47:06,544 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 02:47:06,544 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 02:47:06,544 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 02:47:06,544 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 02:47:06,544 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 02:47:06,544 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 02:47:06,544 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 02:47:06,544 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 02:47:06,544 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 02:47:06,544 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 02:47:06,598 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 02:47:06,759 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 02:47:06,760 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 02:47:06,764 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-10 02:47:06,764 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE was TIMEOUT (13/44) [2022-11-10 02:47:06,766 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-10 02:47:06,766 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-10 02:47:06,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:47:06 BasicIcfg [2022-11-10 02:47:06,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-10 02:47:06,777 INFO L158 Benchmark]: Toolchain (without parser) took 846286.20ms. Allocated memory was 162.5MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 132.9MB in the beginning and 866.3MB in the end (delta: -733.4MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-11-10 02:47:06,778 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 162.5MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-10 02:47:06,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.21ms. Allocated memory is still 204.5MB. Free memory was 178.1MB in the beginning and 151.9MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-11-10 02:47:06,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.16ms. Allocated memory is still 204.5MB. Free memory was 151.9MB in the beginning and 146.8MB in the end (delta: 5.1MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-11-10 02:47:06,778 INFO L158 Benchmark]: Boogie Preprocessor took 68.22ms. Allocated memory is still 204.5MB. Free memory was 146.8MB in the beginning and 142.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-11-10 02:47:06,778 INFO L158 Benchmark]: RCFGBuilder took 684.31ms. Allocated memory is still 204.5MB. Free memory was 142.6MB in the beginning and 102.8MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2022-11-10 02:47:06,779 INFO L158 Benchmark]: TraceAbstraction took 844943.67ms. Allocated memory was 204.5MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 102.3MB in the beginning and 866.3MB in the end (delta: -764.0MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-11-10 02:47:06,787 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.09ms. Allocated memory is still 162.5MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 524.21ms. Allocated memory is still 204.5MB. Free memory was 178.1MB in the beginning and 151.9MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.16ms. Allocated memory is still 204.5MB. Free memory was 151.9MB in the beginning and 146.8MB in the end (delta: 5.1MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.22ms. Allocated memory is still 204.5MB. Free memory was 146.8MB in the beginning and 142.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 684.31ms. Allocated memory is still 204.5MB. Free memory was 142.6MB in the beginning and 102.8MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * TraceAbstraction took 844943.67ms. Allocated memory was 204.5MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 102.3MB in the beginning and 866.3MB in the end (delta: -764.0MB). Peak memory consumption was 1.7GB. 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 31972, positive: 30341, positive conditional: 6212, positive unconditional: 24129, negative: 1631, negative conditional: 1387, negative unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 757, Statistics for Abstraction: - StatisticsResult: Independence relation #13 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 32099, positive: 30468, positive conditional: 6247, positive unconditional: 24221, negative: 1631, negative conditional: 1379, negative unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 1119, Statistics for Abstraction: - StatisticsResult: Independence relation #14 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 34162, positive: 32513, positive conditional: 6346, positive unconditional: 26167, negative: 1649, negative conditional: 1378, negative unconditional: 271, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 1481, Statistics for Abstraction: - StatisticsResult: Independence relation #15 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 169272, positive: 128219, positive conditional: 92200, positive unconditional: 36019, negative: 41053, negative conditional: 39071, negative unconditional: 1982, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 8928, Statistics for Abstraction: - StatisticsResult: Independence relation #16 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 315523, positive: 230229, positive conditional: 194351, positive unconditional: 35878, negative: 85294, negative conditional: 83304, negative unconditional: 1990, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 26295, 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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.1s, 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 31972, positive: 30341, positive conditional: 6212, positive unconditional: 24129, negative: 1631, negative conditional: 1387, negative unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 757, 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: 32099, positive: 30468, positive conditional: 6247, positive unconditional: 24221, negative: 1631, negative conditional: 1379, negative unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 1119, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 1020, Number of trivial persistent sets: 962, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 34162, positive: 32513, positive conditional: 6346, positive unconditional: 26167, negative: 1649, negative conditional: 1378, negative unconditional: 271, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 1481, 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: 169272, positive: 128219, positive conditional: 92200, positive unconditional: 36019, negative: 41053, negative conditional: 39071, negative unconditional: 1982, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 8928, 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: 315523, positive: 230229, positive conditional: 194351, positive unconditional: 35878, negative: 85294, negative conditional: 83304, negative unconditional: 1990, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 761027, positive: 627885, positive conditional: 317833, positive unconditional: 310052, negative: 133142, negative conditional: 127206, negative unconditional: 5936, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734732, positive: 627885, positive conditional: 0, positive unconditional: 627885, negative: 106847, negative conditional: 0, negative unconditional: 106847, 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: 734732, positive: 577145, positive conditional: 0, positive unconditional: 577145, negative: 105117, negative conditional: 0, negative unconditional: 105117, 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: 26295, 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.7s, 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.1s SatisfiabilityAnalysisTime, 0.4s 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.3s, 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.2s 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: 843.3s, OverallIterations: 16, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 86.2s, 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: 381, 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.7s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 71.1s InterpolantComputationTime, 10827 NumberOfCodeBlocks, 10595 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 14026 ConstructedInterpolants, 261 QuantifiedInterpolants, 162441 SizeOfPredicates, 174 NumberOfNonLiveVariables, 11109 ConjunctsInSsa, 539 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 26888/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