/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-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-44940e9-m [2022-11-10 07:28:04,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-10 07:28:04,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-10 07:28:04,684 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-10 07:28:04,684 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-10 07:28:04,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-10 07:28:04,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-10 07:28:04,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-10 07:28:04,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-10 07:28:04,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-10 07:28:04,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-10 07:28:04,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-10 07:28:04,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-10 07:28:04,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-10 07:28:04,691 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-10 07:28:04,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-10 07:28:04,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-10 07:28:04,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-10 07:28:04,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-10 07:28:04,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-10 07:28:04,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-10 07:28:04,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-10 07:28:04,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-10 07:28:04,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-10 07:28:04,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-10 07:28:04,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-10 07:28:04,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-10 07:28:04,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-10 07:28:04,713 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-10 07:28:04,714 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-10 07:28:04,714 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-10 07:28:04,714 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-10 07:28:04,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-10 07:28:04,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-10 07:28:04,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-10 07:28:04,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-10 07:28:04,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-10 07:28:04,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-10 07:28:04,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-10 07:28:04,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-10 07:28:04,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-10 07:28:04,718 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf [2022-11-10 07:28:04,745 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-10 07:28:04,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-10 07:28:04,745 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-10 07:28:04,745 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-10 07:28:04,746 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-10 07:28:04,746 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-10 07:28:04,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-10 07:28:04,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-10 07:28:04,747 INFO L138 SettingsManager]: * Use SBE=true [2022-11-10 07:28:04,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-10 07:28:04,747 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-10 07:28:04,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-10 07:28:04,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-10 07:28:04,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-10 07:28:04,747 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-10 07:28:04,747 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-10 07:28:04,747 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-10 07:28:04,748 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-10 07:28:04,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-10 07:28:04,748 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-10 07:28:04,748 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-10 07:28:04,748 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-10 07:28:04,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-10 07:28:04,748 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-10 07:28:04,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-10 07:28:04,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-10 07:28:04,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-10 07:28:04,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-10 07:28:04,749 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-10 07:28:04,749 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-10 07:28:04,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-10 07:28:04,749 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-10 07:28:04,749 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-10 07:28:04,749 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-10 07:28:04,749 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-10 07:28:04,749 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-10 07:28:04,749 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-10 07:28:04,749 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-10 07:28:04,750 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-11-10 07:28:04,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-10 07:28:04,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-10 07:28:04,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-10 07:28:04,959 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-10 07:28:04,961 INFO L275 PluginConnector]: CDTParser initialized [2022-11-10 07:28:04,962 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2022-11-10 07:28:05,056 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e4dbde7d/8dc68d4a5ff24e438cafa8b0b0936364/FLAGce4f7c8f3 [2022-11-10 07:28:05,510 INFO L306 CDTParser]: Found 1 translation units. [2022-11-10 07:28:05,511 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2022-11-10 07:28:05,524 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e4dbde7d/8dc68d4a5ff24e438cafa8b0b0936364/FLAGce4f7c8f3 [2022-11-10 07:28:05,539 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e4dbde7d/8dc68d4a5ff24e438cafa8b0b0936364 [2022-11-10 07:28:05,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-10 07:28:05,543 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-10 07:28:05,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-10 07:28:05,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-10 07:28:05,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-10 07:28:05,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:28:05" (1/1) ... [2022-11-10 07:28:05,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5733221d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:05, skipping insertion in model container [2022-11-10 07:28:05,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:28:05" (1/1) ... [2022-11-10 07:28:05,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-10 07:28:05,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-10 07:28:05,753 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-10 07:28:05,945 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-2.i[39095,39108] [2022-11-10 07:28:05,947 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-2.i[39180,39193] [2022-11-10 07:28:05,949 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-2.i[39232,39245] [2022-11-10 07:28:06,005 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-2.i[49285,49298] [2022-11-10 07:28:06,006 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-2.i[49334,49347] [2022-11-10 07:28:06,009 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-2.i[49462,49475] [2022-11-10 07:28:06,009 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-2.i[49520,49533] [2022-11-10 07:28:06,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-10 07:28:06,019 INFO L203 MainTranslator]: Completed pre-run [2022-11-10 07:28:06,030 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-10 07:28:06,052 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-2.i[39095,39108] [2022-11-10 07:28:06,053 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-2.i[39180,39193] [2022-11-10 07:28:06,053 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-2.i[39232,39245] [2022-11-10 07:28:06,059 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-2.i[49285,49298] [2022-11-10 07:28:06,059 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-2.i[49334,49347] [2022-11-10 07:28:06,061 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-2.i[49462,49475] [2022-11-10 07:28:06,062 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-2.i[49520,49533] [2022-11-10 07:28:06,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-10 07:28:06,103 INFO L208 MainTranslator]: Completed translation [2022-11-10 07:28:06,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:06 WrapperNode [2022-11-10 07:28:06,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-10 07:28:06,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-10 07:28:06,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-10 07:28:06,105 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-10 07:28:06,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:06" (1/1) ... [2022-11-10 07:28:06,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:06" (1/1) ... [2022-11-10 07:28:06,197 INFO L138 Inliner]: procedures = 309, calls = 63, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 332 [2022-11-10 07:28:06,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-10 07:28:06,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-10 07:28:06,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-10 07:28:06,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-10 07:28:06,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:06" (1/1) ... [2022-11-10 07:28:06,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:06" (1/1) ... [2022-11-10 07:28:06,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:06" (1/1) ... [2022-11-10 07:28:06,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:06" (1/1) ... [2022-11-10 07:28:06,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:06" (1/1) ... [2022-11-10 07:28:06,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:06" (1/1) ... [2022-11-10 07:28:06,234 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:06" (1/1) ... [2022-11-10 07:28:06,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:06" (1/1) ... [2022-11-10 07:28:06,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-10 07:28:06,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-10 07:28:06,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-10 07:28:06,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-10 07:28:06,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:06" (1/1) ... [2022-11-10 07:28:06,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-10 07:28:06,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:28:06,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-10 07:28:06,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-10 07:28:06,318 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-11-10 07:28:06,318 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-11-10 07:28:06,318 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-11-10 07:28:06,318 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-11-10 07:28:06,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-10 07:28:06,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-10 07:28:06,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-10 07:28:06,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-10 07:28:06,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-10 07:28:06,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-10 07:28:06,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-10 07:28:06,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-10 07:28:06,320 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-10 07:28:06,438 INFO L235 CfgBuilder]: Building ICFG [2022-11-10 07:28:06,439 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-10 07:28:06,851 INFO L276 CfgBuilder]: Performing block encoding [2022-11-10 07:28:06,859 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-10 07:28:06,860 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-10 07:28:06,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:28:06 BoogieIcfgContainer [2022-11-10 07:28:06,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-10 07:28:06,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-10 07:28:06,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-10 07:28:06,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-10 07:28:06,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:28:05" (1/3) ... [2022-11-10 07:28:06,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc43541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:28:06, skipping insertion in model container [2022-11-10 07:28:06,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:06" (2/3) ... [2022-11-10 07:28:06,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc43541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:28:06, skipping insertion in model container [2022-11-10 07:28:06,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:28:06" (3/3) ... [2022-11-10 07:28:06,872 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2022-11-10 07:28:06,877 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-10 07:28:06,883 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-10 07:28:06,883 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2022-11-10 07:28:06,883 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-10 07:28:07,013 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-10 07:28:07,054 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:28:07,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:28:07,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:28:07,056 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:28:07,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-10 07:28:07,079 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:28:07,087 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr0ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:28:07,091 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;@53c8f5a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:28:07,091 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:28:07,093 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 07:28:07,095 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:28:07,099 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 07:28:07,100 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr0ASSERT_VIOLATIONDATA_RACE was SAFE (1/44) [2022-11-10 07:28:07,106 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:28:07,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:28:07,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:28:07,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:28:07,140 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:28:07,141 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr1ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:28:07,141 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;@53c8f5a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:28:07,141 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:28:07,141 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 07:28:07,142 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr1ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:28:07,142 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 07:28:07,143 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr1ASSERT_VIOLATIONDATA_RACE was SAFE (2/44) [2022-11-10 07:28:07,146 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:28:07,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:28:07,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:28:07,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-11-10 07:28:07,192 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:28:07,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-11-10 07:28:07,212 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:28:07,213 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr2ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:28:07,213 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;@53c8f5a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:28:07,213 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:28:07,213 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 07:28:07,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr2ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:28:07,214 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 07:28:07,215 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr2ASSERT_VIOLATIONDATA_RACE was SAFE (3/44) [2022-11-10 07:28:07,218 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:28:07,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:28:07,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:28:07,232 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:28:07,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-11-10 07:28:07,238 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:28:07,241 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr3ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:28:07,241 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;@53c8f5a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:28:07,241 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:28:07,242 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 07:28:07,242 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr3ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:28:07,242 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 07:28:07,243 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr3ASSERT_VIOLATIONDATA_RACE was SAFE (4/44) [2022-11-10 07:28:07,246 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:28:07,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:28:07,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:28:07,261 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:28:07,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2022-11-10 07:28:07,277 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:28:07,277 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr4ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:28:07,278 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;@53c8f5a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:28:07,278 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:28:07,278 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 07:28:07,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr4ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:28:07,278 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 07:28:07,279 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr4ASSERT_VIOLATIONDATA_RACE was SAFE (5/44) [2022-11-10 07:28:07,282 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:28:07,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:28:07,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:28:07,291 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:28:07,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2022-11-10 07:28:07,294 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:28:07,295 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr5ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:28:07,295 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;@53c8f5a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:28:07,295 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:28:07,295 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 07:28:07,296 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr5ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:28:07,296 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 07:28:07,296 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr5ASSERT_VIOLATIONDATA_RACE was SAFE (6/44) [2022-11-10 07:28:07,299 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:28:07,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:28:07,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:28:07,301 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:28:07,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2022-11-10 07:28:07,310 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:28:07,311 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr6ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:28:07,311 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;@53c8f5a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:28:07,311 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:28:07,312 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 07:28:07,312 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr6ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:28:07,312 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 07:28:07,312 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr6ASSERT_VIOLATIONDATA_RACE was SAFE (7/44) [2022-11-10 07:28:07,316 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:28:07,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:28:07,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:28:07,325 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:28:07,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2022-11-10 07:28:07,329 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:28:07,329 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr7ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:28:07,330 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;@53c8f5a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:28:07,330 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:28:07,330 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 07:28:07,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr7ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:28:07,333 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 07:28:07,334 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr7ASSERT_VIOLATIONDATA_RACE was SAFE (8/44) [2022-11-10 07:28:07,338 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:28:07,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:28:07,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:28:07,340 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:28:07,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2022-11-10 07:28:07,345 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:28:07,346 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr8ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:28:07,346 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;@53c8f5a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:28:07,347 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:28:07,347 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 07:28:07,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr8ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:28:07,347 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 07:28:07,347 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr8ASSERT_VIOLATIONDATA_RACE was SAFE (9/44) [2022-11-10 07:28:07,350 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:28:07,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:28:07,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:28:07,361 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:28:07,373 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:28:07,373 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr9ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:28:07,373 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;@53c8f5a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:28:07,373 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:28:07,373 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 07:28:07,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr9ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:28:07,374 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 07:28:07,374 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr9ASSERT_VIOLATIONDATA_RACE was SAFE (10/44) [2022-11-10 07:28:07,378 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:28:07,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:28:07,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:28:07,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2022-11-10 07:28:07,394 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:28:07,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Waiting until timeout for monitored process [2022-11-10 07:28:07,422 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:28:07,423 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:28:07,423 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@53c8f5a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:28:07,423 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:28:07,438 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:28:07,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:28:07,442 INFO L85 PathProgramCache]: Analyzing trace with hash -191310369, now seen corresponding path program 1 times [2022-11-10 07:28:07,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:28:07,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497579693] [2022-11-10 07:28:07,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:28:07,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:28:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:28:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:28:07,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:28:07,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497579693] [2022-11-10 07:28:07,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497579693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:28:07,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 07:28:07,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 07:28:07,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586957102] [2022-11-10 07:28:07,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:28:07,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 07:28:07,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:28:08,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 07:28:08,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 07:28:08,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:08,009 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:28:08,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:28:08,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:08,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:08,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:28:08,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-10 07:28:08,051 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-10 07:28:08,052 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE was SAFE (11/44) [2022-11-10 07:28:08,056 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:28:08,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:28:08,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:28:08,058 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:28:08,061 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:28:08,061 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:28:08,062 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;@53c8f5a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:28:08,062 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:28:08,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2022-11-10 07:28:08,071 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:28:08,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:28:08,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1044539061, now seen corresponding path program 1 times [2022-11-10 07:28:08,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:28:08,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72239924] [2022-11-10 07:28:08,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:28:08,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:28:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:28:08,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:28:08,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:28:08,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72239924] [2022-11-10 07:28:08,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72239924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:28:08,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 07:28:08,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 07:28:08,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425983684] [2022-11-10 07:28:08,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:28:08,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 07:28:08,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:28:08,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 07:28:08,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 07:28:08,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:08,411 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:28:08,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:28:08,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:08,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:08,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 07:28:08,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-10 07:28:08,432 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-10 07:28:08,432 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE was SAFE (12/44) [2022-11-10 07:28:08,435 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 07:28:08,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 07:28:08,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:28:08,437 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 07:28:08,463 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 07:28:08,464 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 07:28:08,464 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;@53c8f5a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 07:28:08,464 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 07:28:08,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Waiting until timeout for monitored process [2022-11-10 07:28:08,733 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:28:08,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:28:08,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1529789003, now seen corresponding path program 1 times [2022-11-10 07:28:08,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:28:08,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298895339] [2022-11-10 07:28:08,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:28:08,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:28:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:28:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:28:08,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:28:08,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298895339] [2022-11-10 07:28:08,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298895339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:28:08,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 07:28:08,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-10 07:28:08,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243431194] [2022-11-10 07:28:08,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:28:08,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-10 07:28:08,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:28:08,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-10 07:28:08,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-10 07:28:08,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:08,766 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:28:08,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:28:08,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:08,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:08,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-10 07:28:08,788 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:28:08,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:28:08,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1658871722, now seen corresponding path program 1 times [2022-11-10 07:28:08,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:28:08,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953720665] [2022-11-10 07:28:08,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:28:08,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:28:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:28:08,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:28:08,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:28:08,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953720665] [2022-11-10 07:28:08,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953720665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:28:08,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 07:28:08,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-10 07:28:08,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012458451] [2022-11-10 07:28:08,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:28:08,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 07:28:08,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:28:08,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 07:28:08,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-10 07:28:08,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:08,840 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:28:08,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:28:08,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:08,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:08,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:08,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:08,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-10 07:28:08,981 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:28:08,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:28:08,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1776734729, now seen corresponding path program 1 times [2022-11-10 07:28:08,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:28:08,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652826837] [2022-11-10 07:28:08,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:28:08,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:28:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:28:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:28:09,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:28:09,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652826837] [2022-11-10 07:28:09,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652826837] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 07:28:09,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711935942] [2022-11-10 07:28:09,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:28:09,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:28:09,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:28:09,135 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 07:28:09,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-10 07:28:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:28:09,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-10 07:28:09,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 07:28:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:28:09,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 07:28:09,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:28:09,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711935942] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 07:28:09,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 07:28:09,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-10 07:28:09,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89964494] [2022-11-10 07:28:09,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 07:28:09,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-10 07:28:09,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:28:09,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-10 07:28:09,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-10 07:28:09,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:09,394 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:28:09,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:28:09,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:09,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:09,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:09,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:09,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:09,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:09,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-10 07:28:09,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:28:09,672 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:28:09,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:28:09,672 INFO L85 PathProgramCache]: Analyzing trace with hash -296005014, now seen corresponding path program 2 times [2022-11-10 07:28:09,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:28:09,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628246320] [2022-11-10 07:28:09,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:28:09,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:28:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:28:10,124 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:28:10,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:28:10,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628246320] [2022-11-10 07:28:10,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628246320] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 07:28:10,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467748764] [2022-11-10 07:28:10,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-10 07:28:10,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:28:10,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:28:10,129 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 07:28:10,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-10 07:28:10,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-10 07:28:10,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 07:28:10,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-10 07:28:10,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 07:28:10,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 07:28:10,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:10,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 07:28:10,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:10,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:10,615 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 07:28:10,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 07:28:10,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:10,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:10,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:10,642 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 07:28:10,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 07:28:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2022-11-10 07:28:10,663 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-10 07:28:10,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467748764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:28:10,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-10 07:28:10,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2022-11-10 07:28:10,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836585458] [2022-11-10 07:28:10,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:28:10,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-10 07:28:10,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:28:10,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-10 07:28:10,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-10 07:28:10,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:10,665 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:28:10,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:28:10,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:10,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:10,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:10,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:10,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:10,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:10,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:10,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:28:10,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-10 07:28:11,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:28:11,102 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:28:11,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:28:11,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1027964215, now seen corresponding path program 1 times [2022-11-10 07:28:11,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:28:11,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537729376] [2022-11-10 07:28:11,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:28:11,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:28:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:28:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2022-11-10 07:28:11,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:28:11,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537729376] [2022-11-10 07:28:11,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537729376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:28:11,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 07:28:11,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-10 07:28:11,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266207656] [2022-11-10 07:28:11,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:28:11,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 07:28:11,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:28:11,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 07:28:11,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-10 07:28:11,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:11,294 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:28:11,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:28:11,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:11,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:11,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:11,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:28:11,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:11,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:11,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:11,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:11,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:28:11,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:11,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-10 07:28:11,343 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:28:11,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:28:11,343 INFO L85 PathProgramCache]: Analyzing trace with hash -748196360, now seen corresponding path program 1 times [2022-11-10 07:28:11,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:28:11,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151345420] [2022-11-10 07:28:11,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:28:11,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:28:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:28:11,664 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:28:11,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:28:11,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151345420] [2022-11-10 07:28:11,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151345420] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 07:28:11,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249725314] [2022-11-10 07:28:11,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:28:11,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:28:11,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:28:11,666 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 07:28:11,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-10 07:28:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:28:11,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 1180 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-10 07:28:11,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 07:28:12,143 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:28:12,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 07:28:12,390 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 07:28:12,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249725314] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 07:28:12,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 07:28:12,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-10 07:28:12,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136252429] [2022-11-10 07:28:12,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 07:28:12,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-10 07:28:12,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:28:12,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-10 07:28:12,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-11-10 07:28:12,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:12,392 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:28:12,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 52.27272727272727) internal successors, (575), 11 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:28:12,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:12,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:12,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:12,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:28:12,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:12,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:12,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:12,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:12,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:12,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:28:12,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:12,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:28:12,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-10 07:28:12,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:28:12,689 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:28:12,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:28:12,689 INFO L85 PathProgramCache]: Analyzing trace with hash 801071928, now seen corresponding path program 2 times [2022-11-10 07:28:12,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:28:12,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922351872] [2022-11-10 07:28:12,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:28:12,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:28:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:28:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2022-11-10 07:28:14,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:28:14,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922351872] [2022-11-10 07:28:14,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922351872] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:28:14,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 07:28:14,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-10 07:28:14,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113755913] [2022-11-10 07:28:14,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:28:14,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 07:28:14,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:28:14,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 07:28:14,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 07:28:14,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:14,294 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:28:14,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:28:14,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:14,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:14,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:14,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:28:14,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:14,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:28:14,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:28:14,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:14,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:28:14,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:14,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-10 07:28:14,487 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:28:14,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:28:14,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1228503580, now seen corresponding path program 1 times [2022-11-10 07:28:14,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:28:14,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403445539] [2022-11-10 07:28:14,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:28:14,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:28:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:28:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2022-11-10 07:28:15,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:28:15,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403445539] [2022-11-10 07:28:15,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403445539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:28:15,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 07:28:15,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-10 07:28:15,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066437748] [2022-11-10 07:28:15,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:28:15,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 07:28:15,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:28:15,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 07:28:15,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 07:28:15,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:15,882 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:28:15,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 6 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:28:15,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:15,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:15,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:15,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:28:15,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:15,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:28:15,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:15,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:16,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:16,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:16,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:16,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:28:16,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:16,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:28:16,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:16,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:16,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-10 07:28:16,041 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:28:16,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:28:16,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1591211897, now seen corresponding path program 1 times [2022-11-10 07:28:16,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:28:16,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342245277] [2022-11-10 07:28:16,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:28:16,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:28:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:28:19,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2022-11-10 07:28:19,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:28:19,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342245277] [2022-11-10 07:28:19,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342245277] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 07:28:19,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489595144] [2022-11-10 07:28:19,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:28:19,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:28:19,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:28:19,332 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 07:28:19,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-10 07:28:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:28:19,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 1989 conjuncts, 140 conjunts are in the unsatisfiable core [2022-11-10 07:28:19,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 07:28:19,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-10 07:28:19,961 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-10 07:28:19,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-10 07:28:20,020 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 07:28:20,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 07:28:26,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 07:28:26,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:26,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 07:28:26,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:26,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:26,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 07:28:26,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:26,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:26,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:26,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 07:28:26,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:27,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:27,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:27,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:27,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:27,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:27,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:27,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:27,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:27,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:27,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 07:28:27,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 07:28:27,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:27,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:27,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:27,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:27,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 07:28:27,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:27,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:27,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:27,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 20 proven. 376 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2022-11-10 07:28:27,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 07:28:27,985 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3666 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3666 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3666 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_3666 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0))) is different from false [2022-11-10 07:28:28,147 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3666 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3666 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3666 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_3666 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0))) is different from false [2022-11-10 07:28:28,162 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3666 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_3666 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3666 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3666 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0))) is different from false [2022-11-10 07:28:28,321 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3666 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3666 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3666 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_3666 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0))) is different from false [2022-11-10 07:28:31,567 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_3653 (Array Int Int)) (v_ArrVal_3666 (Array Int Int))) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork0_#in~arg#1.base| v_ArrVal_3653) |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3653 (Array Int Int)) (v_ArrVal_3666 (Array Int Int))) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork0_#in~arg#1.base| v_ArrVal_3653) |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_3653 (Array Int Int)) (v_ArrVal_3666 (Array Int Int))) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork0_#in~arg#1.base| v_ArrVal_3653) |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_3653 (Array Int Int)) (v_ArrVal_3666 (Array Int Int))) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork0_#in~arg#1.base| v_ArrVal_3653) |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0))))) is different from false [2022-11-10 07:28:31,814 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 07:28:31,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2022-11-10 07:28:31,820 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 07:28:31,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 122 [2022-11-10 07:28:31,827 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 45 treesize of output 41 [2022-11-10 07:28:31,829 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 86 treesize of output 78 [2022-11-10 07:28:33,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1548 trivial. 4 not checked. [2022-11-10 07:28:33,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489595144] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 07:28:33,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 07:28:33,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27, 19] total 65 [2022-11-10 07:28:33,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028118642] [2022-11-10 07:28:33,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 07:28:33,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-10 07:28:33,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:28:33,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-10 07:28:33,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=3217, Unknown=142, NotChecked=610, Total=4290 [2022-11-10 07:28:33,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:33,240 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:28:33,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 9.723076923076922) internal successors, (632), 66 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:28:33,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:33,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:33,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:33,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:28:33,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:33,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:28:33,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:33,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:33,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:28:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:28:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-10 07:28:35,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-10 07:28:35,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:28:35,740 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:28:35,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:28:35,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1660305059, now seen corresponding path program 1 times [2022-11-10 07:28:35,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:28:35,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856134816] [2022-11-10 07:28:35,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:28:35,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:28:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:28:40,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1554 trivial. 0 not checked. [2022-11-10 07:28:40,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:28:40,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856134816] [2022-11-10 07:28:40,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856134816] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 07:28:40,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380207911] [2022-11-10 07:28:40,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:28:40,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:28:40,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:28:40,430 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 07:28:40,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-10 07:28:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:28:41,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 2168 conjuncts, 138 conjunts are in the unsatisfiable core [2022-11-10 07:28:41,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 07:28:41,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-10 07:28:41,069 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-10 07:28:41,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-10 07:28:41,079 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 07:28:41,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 07:28:44,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 07:28:44,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:44,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 07:28:44,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:44,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:44,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 07:28:44,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:44,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:44,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:44,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 07:28:44,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:44,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:44,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:44,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:44,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:44,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:44,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:44,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:44,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:44,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:44,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:44,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:44,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:28:44,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:44,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:45,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:45,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:45,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:45,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:45,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:45,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:45,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:45,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 07:28:45,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:45,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,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 07:28:46,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 07:28:46,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:28:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 1182 trivial. 0 not checked. [2022-11-10 07:28:46,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 07:28:47,101 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4801 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|))) (forall ((v_ArrVal_4801 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4801 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4801 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0))) is different from false [2022-11-10 07:28:47,118 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4801 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4801 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4801 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4801 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))) is different from false [2022-11-10 07:28:47,890 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4801 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_~arg#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4801 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_~arg#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_4801 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_~arg#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4801 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_~arg#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0))) is different from false [2022-11-10 07:28:47,900 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4801 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_4801 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4801 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)))) (forall ((v_ArrVal_4801 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0))) is different from false [2022-11-10 07:28:49,804 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_4776 (Array Int Int)) (v_ArrVal_4801 (Array Int Int))) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork0_#in~arg#1.base| v_ArrVal_4776) |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4776 (Array Int Int)) (v_ArrVal_4801 (Array Int Int))) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork0_#in~arg#1.base| v_ArrVal_4776) |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4776 (Array Int Int)) (v_ArrVal_4801 (Array Int Int))) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork0_#in~arg#1.base| v_ArrVal_4776) |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_4776 (Array Int Int)) (v_ArrVal_4801 (Array Int Int))) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork0_#in~arg#1.base| v_ArrVal_4776) |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1) 0))))) is different from false [2022-11-10 07:28:49,814 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_4776 (Array Int Int)) (v_ArrVal_4801 (Array Int Int))) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork0_#in~arg#1.base| v_ArrVal_4776) |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4776 (Array Int Int)) (v_ArrVal_4801 (Array Int Int))) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork0_#in~arg#1.base| v_ArrVal_4776) |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_4776 (Array Int Int)) (v_ArrVal_4801 (Array Int Int))) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork0_#in~arg#1.base| v_ArrVal_4776) |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_4776 (Array Int Int)) (v_ArrVal_4801 (Array Int Int))) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork0_#in~arg#1.base| v_ArrVal_4776) |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_4801) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))))) is different from false [2022-11-10 07:28:49,906 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 07:28:49,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2022-11-10 07:28:49,912 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 07:28:49,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 64 [2022-11-10 07:28:49,914 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 40 treesize of output 36 [2022-11-10 07:28:49,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-11-10 07:28:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1554 trivial. 18 not checked. [2022-11-10 07:28:50,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380207911] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 07:28:50,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 07:28:50,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30, 23] total 76 [2022-11-10 07:28:50,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67449019] [2022-11-10 07:28:50,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 07:28:50,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-10 07:28:50,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:28:50,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-10 07:28:50,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=4427, Unknown=165, NotChecked=858, Total=5852 [2022-11-10 07:28:50,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:50,909 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:28:50,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 10.407894736842104) internal successors, (791), 77 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:28:50,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:50,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:50,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:50,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:28:50,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:50,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:28:50,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:50,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:50,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-10 07:28:50,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:53,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:28:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:28:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-10 07:28:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-10 07:28:53,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-10 07:28:54,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:28:54,090 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:28:54,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:28:54,090 INFO L85 PathProgramCache]: Analyzing trace with hash -378190532, now seen corresponding path program 1 times [2022-11-10 07:28:54,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:28:54,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346766941] [2022-11-10 07:28:54,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:28:54,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:28:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:28:57,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2022-11-10 07:28:57,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:28:57,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346766941] [2022-11-10 07:28:57,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346766941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:28:57,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 07:28:57,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-10 07:28:57,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505183843] [2022-11-10 07:28:57,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:28:57,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-10 07:28:57,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:28:57,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-10 07:28:57,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-11-10 07:28:57,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:57,284 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:28:57,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 11.157894736842104) internal successors, (212), 20 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:28:57,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:57,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:57,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:57,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:28:57,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:57,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:28:57,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:57,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:57,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-10 07:28:57,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-10 07:28:57,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:58,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:58,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:58,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:58,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:28:58,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:58,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:28:58,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:58,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:58,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-10 07:28:58,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-10 07:28:58,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 07:28:58,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-10 07:28:58,563 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:28:58,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:28:58,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1338166489, now seen corresponding path program 1 times [2022-11-10 07:28:58,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:28:58,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540858441] [2022-11-10 07:28:58,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:28:58,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:28:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:28:59,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1572 trivial. 0 not checked. [2022-11-10 07:28:59,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:28:59,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540858441] [2022-11-10 07:28:59,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540858441] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:28:59,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 07:28:59,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-10 07:28:59,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76421379] [2022-11-10 07:28:59,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:28:59,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 07:28:59,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:28:59,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 07:28:59,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 07:28:59,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:59,772 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:28:59,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:28:59,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:59,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:59,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:59,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:28:59,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:59,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:28:59,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:59,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:59,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-10 07:28:59,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-10 07:28:59,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 07:28:59,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:59,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:28:59,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:59,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:59,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:28:59,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:28:59,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:28:59,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:59,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:59,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-10 07:28:59,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-10 07:28:59,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 07:28:59,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:28:59,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-10 07:28:59,997 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:28:59,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:28:59,997 INFO L85 PathProgramCache]: Analyzing trace with hash -408918114, now seen corresponding path program 1 times [2022-11-10 07:28:59,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:28:59,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817256971] [2022-11-10 07:28:59,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:28:59,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:29:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:29:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1572 trivial. 0 not checked. [2022-11-10 07:29:04,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:29:04,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817256971] [2022-11-10 07:29:04,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817256971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 07:29:04,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 07:29:04,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-11-10 07:29:04,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328393307] [2022-11-10 07:29:04,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 07:29:04,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-10 07:29:04,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:29:04,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-10 07:29:04,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2022-11-10 07:29:04,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:04,502 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:29:04,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 10.166666666666666) internal successors, (244), 25 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:29:04,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:04,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:04,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:04,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:29:04,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:04,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:29:04,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:04,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:04,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-10 07:29:04,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-10 07:29:04,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 07:29:04,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:04,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:18,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:29:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:29:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-10 07:29:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-10 07:29:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 07:29:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:18,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-10 07:29:18,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-10 07:29:18,266 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:29:18,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:29:18,267 INFO L85 PathProgramCache]: Analyzing trace with hash 182679402, now seen corresponding path program 1 times [2022-11-10 07:29:18,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:29:18,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602556865] [2022-11-10 07:29:18,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:29:18,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:29:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:29:20,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1918 backedges. 85 proven. 211 refuted. 0 times theorem prover too weak. 1622 trivial. 0 not checked. [2022-11-10 07:29:20,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:29:20,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602556865] [2022-11-10 07:29:20,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602556865] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 07:29:20,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893383420] [2022-11-10 07:29:20,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:29:20,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:29:20,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:29:20,747 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 07:29:20,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-10 07:29:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:29:21,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 2379 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-10 07:29:21,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 07:29:25,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-10 07:29:25,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1918 backedges. 85 proven. 583 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2022-11-10 07:29:25,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 07:29:25,483 INFO L356 Elim1Store]: treesize reduction 26, result has 82.8 percent of original size [2022-11-10 07:29:25,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 152 treesize of output 234 [2022-11-10 07:29:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1918 backedges. 85 proven. 211 refuted. 0 times theorem prover too weak. 1622 trivial. 0 not checked. [2022-11-10 07:29:28,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893383420] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 07:29:28,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 07:29:28,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 14] total 32 [2022-11-10 07:29:28,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045179341] [2022-11-10 07:29:28,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 07:29:28,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-10 07:29:28,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:29:28,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-10 07:29:28,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2022-11-10 07:29:28,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:28,213 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:29:28,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 17.875) internal successors, (572), 32 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:29:28,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:28,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:28,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:28,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:29:28,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:28,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:29:28,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:28,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:28,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-11-10 07:29:28,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-11-10 07:29:28,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 07:29:28,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:28,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-10 07:29:28,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:35,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:29:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:29:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-10 07:29:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-10 07:29:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 07:29:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-10 07:29:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 07:29:35,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-10 07:29:35,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:29:35,225 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:29:35,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:29:35,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1786728371, now seen corresponding path program 1 times [2022-11-10 07:29:35,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:29:35,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836511160] [2022-11-10 07:29:35,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:29:35,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:29:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:29:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3187 backedges. 121 proven. 422 refuted. 0 times theorem prover too weak. 2644 trivial. 0 not checked. [2022-11-10 07:29:38,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:29:38,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836511160] [2022-11-10 07:29:38,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836511160] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 07:29:38,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131045117] [2022-11-10 07:29:38,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:29:38,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:29:38,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:29:38,189 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 07:29:38,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-10 07:29:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:29:39,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 2843 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-10 07:29:39,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 07:29:44,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-10 07:29:44,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3187 backedges. 157 proven. 800 refuted. 0 times theorem prover too weak. 2230 trivial. 0 not checked. [2022-11-10 07:29:44,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 07:29:44,717 INFO L356 Elim1Store]: treesize reduction 26, result has 82.8 percent of original size [2022-11-10 07:29:44,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 148 treesize of output 234 [2022-11-10 07:29:47,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3187 backedges. 121 proven. 422 refuted. 0 times theorem prover too weak. 2644 trivial. 0 not checked. [2022-11-10 07:29:47,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131045117] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 07:29:47,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 07:29:47,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 14] total 34 [2022-11-10 07:29:47,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90677320] [2022-11-10 07:29:47,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 07:29:47,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-10 07:29:47,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 07:29:47,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-10 07:29:47,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2022-11-10 07:29:47,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:47,479 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 07:29:47,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 16.058823529411764) internal successors, (546), 34 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 07:29:47,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:47,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:47,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:47,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:29:47,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:47,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:29:47,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:47,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:47,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-11-10 07:29:47,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-11-10 07:29:47,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 07:29:47,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:47,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-10 07:29:47,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 07:29:47,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:55,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 07:29:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 07:29:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 07:29:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 07:29:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-10 07:29:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-10 07:29:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 07:29:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 07:29:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-10 07:29:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 07:29:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-10 07:29:55,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-10 07:29:56,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-10 07:29:56,048 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 07:29:56,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 07:29:56,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1103528356, now seen corresponding path program 1 times [2022-11-10 07:29:56,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 07:29:56,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659133558] [2022-11-10 07:29:56,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:29:56,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 07:29:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:31:15,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12394 backedges. 195 proven. 1896 refuted. 0 times theorem prover too weak. 10303 trivial. 0 not checked. [2022-11-10 07:31:15,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 07:31:15,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659133558] [2022-11-10 07:31:15,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659133558] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 07:31:15,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321064864] [2022-11-10 07:31:15,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 07:31:15,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 07:31:15,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 07:31:15,112 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 07:31:15,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-10 07:31:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 07:31:16,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 4259 conjuncts, 513 conjunts are in the unsatisfiable core [2022-11-10 07:31:16,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 07:31:16,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-10 07:31:16,388 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-10 07:31:16,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-10 07:31:16,395 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 07:31:16,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 07:31:22,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 07:31:22,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:31:22,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 07:31:22,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:31:22,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:31:22,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 07:31:23,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:31:23,761 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 32 treesize of output 30 [2022-11-10 07:31:23,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:31:23,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:31:23,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:31:23,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 07:31:23,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:31:23,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:23,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:31:23,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:24,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:31:24,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:24,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:31:24,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:24,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:31:24,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:24,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:31:24,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:24,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:25,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:25,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:25,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:25,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:25,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:25,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:26,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:26,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:26,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:26,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:26,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:26,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:26,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:26,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:26,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:26,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:26,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:27,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 07:31:27,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:27,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:27,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:27,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:27,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:27,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:27,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 07:31:27,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:28,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:28,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:28,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 07:31:28,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:28,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:28,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:28,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:28,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 07:31:28,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:29,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:29,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:29,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 07:31:30,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:30,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:30,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:30,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:30,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:30,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:30,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:30,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:30,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:30,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:30,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:30,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:31,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:31,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:31,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:31,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:31,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:31,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 07:31:31,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:31,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:31,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:31,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:31,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:31,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:31,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:31,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:31,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:32,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:32,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:32,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:32,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:32,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:32,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:32,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:32,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:32,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:32,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:32,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:32,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:32,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:32,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:33,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:33,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:33,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:33,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:33,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:33,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:33,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:33,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:33,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:34,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:34,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:34,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:34,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:34,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:34,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:34,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:34,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:35,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:35,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 07:31:35,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:35,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:35,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:35,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:35,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:35,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:35,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:36,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:36,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:36,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:36,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 07:31:36,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:36,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:36,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:36,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:36,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:37,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:37,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:37,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:37,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:37,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:37,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:37,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:37,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:37,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:38,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:38,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:38,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:38,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:38,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:38,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:38,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:39,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 07:31:39,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:40,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:40,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:40,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:40,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:41,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:41,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:41,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:41,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:43,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:43,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:43,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:43,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31: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 07:31:43,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:44,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:44,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 07:31:44,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:45,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:45,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:46,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:46,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:46,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:46,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:46,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:46,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:48,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:48,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:48,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:49,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:49,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:49,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:49,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:49,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:49,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:51,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:51,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:52,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:52,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 07:31:52,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:52,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:53,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:53,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:53,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:55,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:55,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:55,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:55,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:56,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:56,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:56,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:56,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:58,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:59,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:59,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:59,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 07:31:59,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:31:59,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:00,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:00,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 07:32:00,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:02,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:03,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 07:32:03,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:03,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:03,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 07:32:03,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:03,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:03,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:03,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:03,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:03,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:03,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:03,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:03,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:03,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:03,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:03,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:03,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:04,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:04,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:04,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:04,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:04,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:04,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:04,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:04,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:04,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:04,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:04,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:04,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:04,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:04,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:04,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:04,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:04,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:04,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:05,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:05,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:05,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:05,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:05,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 07:32:05,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:05,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:05,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:05,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:05,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:05,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 07:32:05,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 07:32:06,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:06,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:06,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:06,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:06,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:06,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:06,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:06,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:07,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:07,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:07,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:07,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:07,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:07,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:07,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:07,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:07,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:08,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:08,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:08,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:08,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:08,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:08,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 07:32:08,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 07:32:08,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:32:08,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:32:08,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:32:08,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-10 07:32:08,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:32:08,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:32:08,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 07:32:08,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 13 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 87 [2022-11-10 07:32:08,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12394 backedges. 124 proven. 2296 refuted. 0 times theorem prover too weak. 9974 trivial. 0 not checked. [2022-11-10 07:32:08,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 07:32:09,444 INFO L356 Elim1Store]: treesize reduction 48, result has 60.3 percent of original size [2022-11-10 07:32:09,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 102 treesize of output 324 [2022-11-10 07:32:09,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 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 105 treesize of output 185 [2022-11-10 07:32:09,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 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 105 treesize of output 185 [2022-11-10 07:32:09,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 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 105 treesize of output 185 [2022-11-10 07:32:09,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 73 treesize of output 65 [2022-11-10 07:32:09,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 73 treesize of output 65 [2022-11-10 07:32:09,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 73 treesize of output 65 [2022-11-10 07:32:09,733 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 07:32:09,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 57 treesize of output 29 [2022-11-10 07:32:09,767 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 07:32:09,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 61 treesize of output 29 [2022-11-10 07:32:10,683 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| 3)) (.cse0 (+ |c_reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| 2)) (.cse2 (+ |c_reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| 1))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse0) 0)) (not (= (select v_arrayElimArr_5 .cse1) 0)) (not (= (select v_arrayElimArr_5 .cse2) 0)) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0))) (forall ((v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 .cse2) 0)) (not (= (select v_arrayElimArr_3 .cse0) 0)) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0) (not (= (select v_arrayElimArr_3 .cse1) 0)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse2) 0)) (not (= 0 (select v_arrayElimArr_4 .cse0))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_4 .cse1) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0) (not (= (select v_arrayElimArr_6 .cse1) 0)) (not (= (select v_arrayElimArr_6 .cse0) 0)) (not (= (select v_arrayElimArr_6 .cse2) 0)))))) is different from false [2022-11-10 07:32:11,401 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 2)) (.cse2 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 3)) (.cse1 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 1))) (and (forall ((v_ArrVal_11272 (Array Int Int)) (v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 0)) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11272) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0) (not (= (select v_arrayElimArr_6 .cse1) 0)) (not (= (select v_arrayElimArr_6 .cse2) 0)))) (forall ((v_ArrVal_11272 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11272) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_4 .cse2) 0)) (not (= (select v_arrayElimArr_4 .cse1) 0)) (not (= (select v_arrayElimArr_4 .cse0) 0)))) (forall ((v_ArrVal_11272 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse1) 0)) (not (= (select v_arrayElimArr_5 .cse2) 0)) (not (= (select v_arrayElimArr_5 .cse0) 0)) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11272) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0))) (forall ((v_ArrVal_11272 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_3 .cse0))) (not (= (select v_arrayElimArr_3 .cse2) 0)) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11272) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0) (not (= (select v_arrayElimArr_3 .cse1) 0)))))) is different from false [2022-11-10 07:32:14,040 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 2)) (.cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 1)) (.cse1 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 3))) (and (forall ((v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11264 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11264) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0) (not (= (select v_arrayElimArr_5 .cse0) 0)) (not (= (select v_arrayElimArr_5 .cse1) 0)) (not (= (select v_arrayElimArr_5 .cse2) 0)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_11264 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_3 .cse2))) (not (= (select v_arrayElimArr_3 .cse1) 0)) (= 0 (select (select (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11264) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2))) (not (= (select v_arrayElimArr_3 .cse0) 0)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11264 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11264) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_4 .cse1) 0)) (not (= (select v_arrayElimArr_4 .cse0) 0)) (not (= (select v_arrayElimArr_4 .cse2) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11264 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse2) 0)) (not (= (select v_arrayElimArr_6 .cse0) 0)) (= 0 (select (select (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11264) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3))) (not (= (select v_arrayElimArr_6 .cse1) 0)))))) is different from false [2022-11-10 07:32:17,418 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 3)) (.cse1 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 1)) (.cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 2))) (and (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11247 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 0)) (not (= (select v_arrayElimArr_6 .cse1) 0)) (= (select (select (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11247) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0) (not (= (select v_arrayElimArr_6 .cse2) 0)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_11247 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_3 .cse0))) (not (= (select v_arrayElimArr_3 .cse2) 0)) (= (select (select (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11247) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0) (not (= (select v_arrayElimArr_3 .cse1) 0)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11247 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11247) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0) (not (= (select v_arrayElimArr_5 .cse1) 0)) (not (= (select v_arrayElimArr_5 .cse2) 0)) (not (= (select v_arrayElimArr_5 .cse0) 0)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11247 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse2) 0)) (not (= (select v_arrayElimArr_4 .cse1) 0)) (not (= (select v_arrayElimArr_4 .cse0) 0)) (= (select (select (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11247) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))))) is different from false [2022-11-10 07:32:17,549 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 1)) (.cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 3)) (.cse2 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 2))) (and (forall ((v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11247 (Array Int Int)) (v_ArrVal_11244 (Array Int Int))) (or (= (select (select (store (store (store (store (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11247) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_4 .cse0) 0)) (not (= (select v_arrayElimArr_4 .cse1) 0)) (not (= (select v_arrayElimArr_4 .cse2) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11247 (Array Int Int)) (v_ArrVal_11244 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse2) 0)) (not (= (select v_arrayElimArr_6 .cse1) 0)) (= (select (select (store (store (store (store (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11247) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0) (not (= (select v_arrayElimArr_6 .cse0) 0)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_11247 (Array Int Int)) (v_ArrVal_11244 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_3 .cse2))) (not (= (select v_arrayElimArr_3 .cse0) 0)) (not (= (select v_arrayElimArr_3 .cse1) 0)) (= (select (select (store (store (store (store (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11247) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11247 (Array Int Int)) (v_ArrVal_11244 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse1) 0)) (= (select (select (store (store (store (store (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11247) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0) (not (= (select v_arrayElimArr_5 .cse0) 0)) (not (= (select v_arrayElimArr_5 .cse2) 0)))))) is different from false [2022-11-10 07:32:17,605 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 1)) (.cse1 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 3)) (.cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 2))) (and (forall ((v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_11247 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_3 .cse0))) (not (= (select v_arrayElimArr_3 .cse1) 0)) (= (select (select (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11247) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0) (not (= (select v_arrayElimArr_3 .cse2) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11247 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 0)) (= (select (select (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11247) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0) (not (= (select v_arrayElimArr_6 .cse2) 0)) (not (= (select v_arrayElimArr_6 .cse1) 0)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11247 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse1) 0)) (not (= (select v_arrayElimArr_4 .cse2) 0)) (not (= (select v_arrayElimArr_4 .cse0) 0)) (= (select (select (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11247) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11247 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (= (select (select (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11247) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0) (not (= (select v_arrayElimArr_5 .cse2) 0)) (not (= (select v_arrayElimArr_5 .cse1) 0)) (not (= (select v_arrayElimArr_5 .cse0) 0)))))) is different from false [2022-11-10 07:32:17,966 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 3)) (.cse2 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 1)) (.cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 2))) (and (forall ((v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_11247 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_3 .cse0))) (not (= (select v_arrayElimArr_3 .cse1) 0)) (= (select (select (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| v_ArrVal_11247) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0) (not (= (select v_arrayElimArr_3 .cse2) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11247 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 0)) (= (select (select (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| v_ArrVal_11247) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0) (not (= (select v_arrayElimArr_6 .cse2) 0)) (not (= (select v_arrayElimArr_6 .cse1) 0)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11247 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse2) 0)) (= (select (select (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| v_ArrVal_11247) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0) (not (= (select v_arrayElimArr_5 .cse1) 0)) (not (= (select v_arrayElimArr_5 .cse0) 0)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11247 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (= (select (select (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| v_ArrVal_11247) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_4 .cse1) 0)) (not (= (select v_arrayElimArr_4 .cse2) 0)) (not (= (select v_arrayElimArr_4 .cse0) 0)))))) is different from false [2022-11-10 07:32:18,105 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 3)) (.cse1 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 1)) (.cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 2))) (and (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 0)) (not (= (select v_arrayElimArr_6 .cse1) 0)) (not (= (select v_arrayElimArr_6 .cse2) 0)) (= (select (select (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (= (select (select (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0) (not (= (select v_arrayElimArr_5 .cse1) 0)) (not (= (select v_arrayElimArr_5 .cse2) 0)) (not (= (select v_arrayElimArr_5 .cse0) 0)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_3 .cse0))) (= (select (select (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0) (not (= (select v_arrayElimArr_3 .cse2) 0)) (not (= (select v_arrayElimArr_3 .cse1) 0)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (= (select (select (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_4 .cse2) 0)) (not (= (select v_arrayElimArr_4 .cse1) 0)) (not (= (select v_arrayElimArr_4 .cse0) 0)))))) is different from false [2022-11-10 07:32:19,565 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 3)) (.cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 1)) (.cse2 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 2))) (and (forall ((v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_11238 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11236 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse0) 0)) (= (select (select (store (store (store (store (store (store (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11236) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11238) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0) (not (= (select v_arrayElimArr_5 .cse1) 0)) (not (= (select v_arrayElimArr_5 .cse2) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11238 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11236 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse2) 0)) (not (= (select v_arrayElimArr_6 .cse0) 0)) (not (= (select v_arrayElimArr_6 .cse1) 0)) (= (select (select (store (store (store (store (store (store (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11236) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11238) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11238 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_11236 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_3 .cse2))) (not (= (select v_arrayElimArr_3 .cse1) 0)) (= (select (select (store (store (store (store (store (store (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11236) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11238) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0) (not (= (select v_arrayElimArr_3 .cse0) 0)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11238 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11236 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (= (select (select (store (store (store (store (store (store (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11236) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11238) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_4 .cse1) 0)) (not (= (select v_arrayElimArr_4 .cse0) 0)) (not (= (select v_arrayElimArr_4 .cse2) 0)))))) is different from false [2022-11-10 07:32:19,628 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 2)) (.cse2 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 3)) (.cse1 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 1))) (and (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11238 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11236 (Array Int Int)) (v_ArrVal_11235 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 0)) (not (= (select v_arrayElimArr_6 .cse1) 0)) (= (select (select (store (store (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11235) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11236) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11238) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0) (not (= (select v_arrayElimArr_6 .cse2) 0)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_11238 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11236 (Array Int Int)) (v_ArrVal_11235 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (= (select (select (store (store (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11235) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11236) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11238) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0) (not (= (select v_arrayElimArr_5 .cse1) 0)) (not (= (select v_arrayElimArr_5 .cse2) 0)) (not (= (select v_arrayElimArr_5 .cse0) 0)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11238 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11236 (Array Int Int)) (v_ArrVal_11235 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse2) 0)) (not (= (select v_arrayElimArr_4 .cse1) 0)) (not (= (select v_arrayElimArr_4 .cse0) 0)) (= (select (select (store (store (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11235) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11236) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11238) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11238 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_11236 (Array Int Int)) (v_ArrVal_11235 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_3 .cse0))) (= (select (select (store (store (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11235) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11236) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11238) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0) (not (= (select v_arrayElimArr_3 .cse2) 0)) (not (= (select v_arrayElimArr_3 .cse1) 0)))))) is different from false [2022-11-10 07:32:25,433 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 2)) (.cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 3)) (.cse1 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 1))) (and (forall ((v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11229 (Array Int Int)) (v_ArrVal_11228 (Array Int Int)) (v_ArrVal_11227 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11236 (Array Int Int)) (v_ArrVal_11235 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse0) 0)) (not (= (select v_arrayElimArr_4 .cse1) 0)) (not (= (select v_arrayElimArr_4 .cse2) 0)) (= 0 (select (select (store (store (store (store (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11227) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11228) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11229) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11235) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11236) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_11229 (Array Int Int)) (v_ArrVal_11228 (Array Int Int)) (v_ArrVal_11227 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11236 (Array Int Int)) (v_ArrVal_11235 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse1) 0)) (not (= (select v_arrayElimArr_5 .cse0) 0)) (= (select (select (store (store (store (store (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11227) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11228) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11229) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11235) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11236) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0) (not (= (select v_arrayElimArr_5 .cse2) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11229 (Array Int Int)) (v_ArrVal_11228 (Array Int Int)) (v_ArrVal_11227 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11236 (Array Int Int)) (v_ArrVal_11235 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse2) 0)) (= (select (select (store (store (store (store (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11227) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11228) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11229) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11235) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11236) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0) (not (= (select v_arrayElimArr_6 .cse1) 0)) (not (= (select v_arrayElimArr_6 .cse0) 0)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11229 (Array Int Int)) (v_ArrVal_11228 (Array Int Int)) (v_ArrVal_11227 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_11236 (Array Int Int)) (v_ArrVal_11235 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_3 .cse2))) (not (= (select v_arrayElimArr_3 .cse0) 0)) (= (select (select (store (store (store (store (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11227) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11228) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11229) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11235) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11236) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0) (not (= (select v_arrayElimArr_3 .cse1) 0)))))) is different from false [2022-11-10 07:32:37,689 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 2)) (.cse1 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 1)) (.cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 3))) (and (forall ((v_ArrVal_11207 (Array Int Int)) (v_ArrVal_11228 (Array Int Int)) (v_ArrVal_11227 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11236 (Array Int Int)) (v_ArrVal_11235 (Array Int Int)) (v_ArrVal_11211 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int)) (v_ArrVal_11220 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse0) 0)) (not (= (select v_arrayElimArr_4 .cse1) 0)) (not (= (select v_arrayElimArr_4 .cse2) 0)) (= (select (select (store (store (store (store (store (store (store (store (store (store (store (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11207) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11211) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11220) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11227) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11228) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11235) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11236) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))) (forall ((v_ArrVal_11207 (Array Int Int)) (v_ArrVal_11228 (Array Int Int)) (v_ArrVal_11227 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11236 (Array Int Int)) (v_ArrVal_11235 (Array Int Int)) (v_ArrVal_11211 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int)) (v_ArrVal_11220 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_3 .cse2))) (= (select (select (store (store (store (store (store (store (store (store (store (store (store (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11207) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11211) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11220) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11227) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11228) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11235) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11236) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0) (not (= (select v_arrayElimArr_3 .cse0) 0)) (not (= (select v_arrayElimArr_3 .cse1) 0)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_11207 (Array Int Int)) (v_ArrVal_11228 (Array Int Int)) (v_ArrVal_11227 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11236 (Array Int Int)) (v_ArrVal_11235 (Array Int Int)) (v_ArrVal_11211 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int)) (v_ArrVal_11220 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse1) 0)) (not (= (select v_arrayElimArr_5 .cse0) 0)) (not (= (select v_arrayElimArr_5 .cse2) 0)) (= (select (select (store (store (store (store (store (store (store (store (store (store (store (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11207) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11211) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11220) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11227) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11228) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11235) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11236) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_11207 (Array Int Int)) (v_ArrVal_11228 (Array Int Int)) (v_ArrVal_11227 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11236 (Array Int Int)) (v_ArrVal_11235 (Array Int Int)) (v_ArrVal_11211 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int)) (v_ArrVal_11220 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse2) 0)) (not (= (select v_arrayElimArr_6 .cse1) 0)) (not (= (select v_arrayElimArr_6 .cse0) 0)) (= (select (select (store (store (store (store (store (store (store (store (store (store (store (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11207) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11211) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11220) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11227) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11228) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11235) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11236) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0))))) is different from false [2022-11-10 07:33:36,186 WARN L233 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 106 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-10 07:33:43,262 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 2)) (.cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 1)) (.cse1 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 3))) (and (forall ((v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_11238 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (= (select (select (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| v_ArrVal_11238) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0) (not (= (select v_arrayElimArr_5 .cse0) 0)) (not (= (select v_arrayElimArr_5 .cse1) 0)) (not (= (select v_arrayElimArr_5 .cse2) 0)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11238 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_3 .cse2))) (= (select (select (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| v_ArrVal_11238) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0) (not (= (select v_arrayElimArr_3 .cse1) 0)) (not (= (select v_arrayElimArr_3 .cse0) 0)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11238 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse1) 0)) (not (= (select v_arrayElimArr_4 .cse0) 0)) (not (= (select v_arrayElimArr_4 .cse2) 0)) (= (select (select (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| v_ArrVal_11238) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11238 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse2) 0)) (not (= (select v_arrayElimArr_6 .cse0) 0)) (not (= (select v_arrayElimArr_6 .cse1) 0)) (= (select (select (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| v_ArrVal_11238) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0))))) is different from false [2022-11-10 07:33:46,560 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 3)) (.cse2 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 1)) (.cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 2))) (and (forall ((v_ArrVal_11194 (Array Int Int)) (v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_3 .cse0))) (= 0 (select (select (store (store (store (store (store (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11194) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2))) (not (= (select v_arrayElimArr_3 .cse1) 0)) (not (= (select v_arrayElimArr_3 .cse2) 0)))) (forall ((v_ArrVal_11194 (Array Int Int)) (v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (= (select (select (store (store (store (store (store (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11194) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0) (not (= (select v_arrayElimArr_5 .cse2) 0)) (not (= (select v_arrayElimArr_5 .cse1) 0)) (not (= (select v_arrayElimArr_5 .cse0) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_11194 (Array Int Int)) (v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 0)) (= (select (select (store (store (store (store (store (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11194) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0) (not (= (select v_arrayElimArr_6 .cse2) 0)) (not (= (select v_arrayElimArr_6 .cse1) 0)))) (forall ((v_ArrVal_11194 (Array Int Int)) (v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse1) 0)) (= (select (select (store (store (store (store (store (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11194) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11243) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11244) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_ArrVal_11259) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11260) |c_reader_twoThread1of1ForFork0_~r~2#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_4 .cse2) 0)) (not (= (select v_arrayElimArr_4 .cse0) 0)))))) is different from false [2022-11-10 07:33:52,961 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-10 07:33:52,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-10 07:33:53,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-10 07:33:53,162 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at most one deprecated predicate at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:973) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-10 07:33:53,164 INFO L158 Benchmark]: Toolchain (without parser) took 347620.70ms. Allocated memory was 202.4MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 177.8MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-11-10 07:33:53,164 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 202.4MB. Free memory was 163.7MB in the beginning and 163.7MB in the end (delta: 67.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-11-10 07:33:53,164 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.93ms. Allocated memory was 202.4MB in the beginning and 260.0MB in the end (delta: 57.7MB). Free memory was 177.5MB in the beginning and 209.0MB in the end (delta: -31.5MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-11-10 07:33:53,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.58ms. Allocated memory is still 260.0MB. Free memory was 209.0MB in the beginning and 203.9MB in the end (delta: 5.1MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-11-10 07:33:53,164 INFO L158 Benchmark]: Boogie Preprocessor took 40.38ms. Allocated memory is still 260.0MB. Free memory was 203.9MB in the beginning and 199.4MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-11-10 07:33:53,164 INFO L158 Benchmark]: RCFGBuilder took 622.93ms. Allocated memory is still 260.0MB. Free memory was 199.4MB in the beginning and 161.2MB in the end (delta: 38.2MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-11-10 07:33:53,164 INFO L158 Benchmark]: TraceAbstraction took 346297.95ms. Allocated memory was 260.0MB in the beginning and 2.8GB in the end (delta: 2.5GB). Free memory was 160.6MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-11-10 07:33:53,165 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 202.4MB. Free memory was 163.7MB in the beginning and 163.7MB in the end (delta: 67.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 558.93ms. Allocated memory was 202.4MB in the beginning and 260.0MB in the end (delta: 57.7MB). Free memory was 177.5MB in the beginning and 209.0MB in the end (delta: -31.5MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 93.58ms. Allocated memory is still 260.0MB. Free memory was 209.0MB in the beginning and 203.9MB in the end (delta: 5.1MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.38ms. Allocated memory is still 260.0MB. Free memory was 203.9MB in the beginning and 199.4MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 622.93ms. Allocated memory is still 260.0MB. Free memory was 199.4MB in the beginning and 161.2MB in the end (delta: 38.2MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 346297.95ms. Allocated memory was 260.0MB in the beginning and 2.8GB in the end (delta: 2.5GB). Free memory was 160.6MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 1.2GB. 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: 33, Number of trivial persistent sets: 33, 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: 33, Number of trivial persistent sets: 33, 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: - ExceptionOrErrorResult: AssertionError: at most one deprecated predicate de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at most one deprecated predicate: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:973) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-10 07:33:53,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Ended with exit code 0 [2022-11-10 07:33:53,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Forceful destruction successful, exit code 0 [2022-11-10 07:33:53,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Forceful destruction successful, exit code 0 [2022-11-10 07:33:53,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Forceful destruction successful, exit code 0 [2022-11-10 07:33:54,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Forceful destruction successful, exit code 0 [2022-11-10 07:33:54,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Forceful destruction successful, exit code 0 [2022-11-10 07:33:54,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Forceful destruction successful, exit code 0 [2022-11-10 07:33:54,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Forceful destruction successful, exit code 0 [2022-11-10 07:33:54,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2022-11-10 07:33:55,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Ended with exit code 0 [2022-11-10 07:33:55,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2022-11-10 07:33:55,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2022-11-10 07:33:55,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-11-10 07:33:55,990 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-11-10 07:33:56,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...