/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 02:33:32,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-10 02:33:32,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-10 02:33:32,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-10 02:33:32,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-10 02:33:32,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-10 02:33:32,904 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-10 02:33:32,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-10 02:33:32,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-10 02:33:32,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-10 02:33:32,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-10 02:33:32,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-10 02:33:32,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-10 02:33:32,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-10 02:33:32,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-10 02:33:32,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-10 02:33:32,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-10 02:33:32,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-10 02:33:32,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-10 02:33:32,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-10 02:33:32,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-10 02:33:32,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-10 02:33:32,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-10 02:33:32,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-10 02:33:32,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-10 02:33:32,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-10 02:33:32,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-10 02:33:32,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-10 02:33:32,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-10 02:33:32,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-10 02:33:32,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-10 02:33:32,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-10 02:33:32,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-10 02:33:32,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-10 02:33:32,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-10 02:33:32,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-10 02:33:32,945 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-10 02:33:32,945 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-10 02:33:32,945 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-10 02:33:32,946 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-10 02:33:32,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-10 02:33:32,947 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf [2022-11-10 02:33:32,979 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-10 02:33:32,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-10 02:33:32,980 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-10 02:33:32,980 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-10 02:33:32,981 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-10 02:33:32,981 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-10 02:33:32,981 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-10 02:33:32,981 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-10 02:33:32,981 INFO L138 SettingsManager]: * Use SBE=true [2022-11-10 02:33:32,982 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-10 02:33:32,982 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-10 02:33:32,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-10 02:33:32,983 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-10 02:33:32,983 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-10 02:33:32,983 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-10 02:33:32,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-10 02:33:32,983 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-10 02:33:32,983 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-10 02:33:32,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-10 02:33:32,983 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-10 02:33:32,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-10 02:33:32,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-10 02:33:32,984 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-10 02:33:32,984 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-10 02:33:32,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-10 02:33:32,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-10 02:33:32,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-10 02:33:32,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-10 02:33:32,984 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-10 02:33:32,985 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-10 02:33:32,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-10 02:33:32,985 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-10 02:33:32,985 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-10 02:33:32,985 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-10 02:33:32,985 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-10 02:33:32,985 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-10 02:33:32,985 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-10 02:33:32,986 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-10 02:33:32,986 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-11-10 02:33:33,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-10 02:33:33,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-10 02:33:33,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-10 02:33:33,200 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-10 02:33:33,201 INFO L275 PluginConnector]: CDTParser initialized [2022-11-10 02:33:33,202 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 02:33:33,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcbff19b5/4eeca18336e248e280cc2be2a1b55c63/FLAG77e20c833 [2022-11-10 02:33:33,675 INFO L306 CDTParser]: Found 1 translation units. [2022-11-10 02:33:33,675 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2022-11-10 02:33:33,691 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcbff19b5/4eeca18336e248e280cc2be2a1b55c63/FLAG77e20c833 [2022-11-10 02:33:34,026 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcbff19b5/4eeca18336e248e280cc2be2a1b55c63 [2022-11-10 02:33:34,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-10 02:33:34,029 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-10 02:33:34,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-10 02:33:34,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-10 02:33:34,035 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-10 02:33:34,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:33:34" (1/1) ... [2022-11-10 02:33:34,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a6c30d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:34, skipping insertion in model container [2022-11-10 02:33:34,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:33:34" (1/1) ... [2022-11-10 02:33:34,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-10 02:33:34,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-10 02:33:34,270 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-10 02:33:34,553 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 02:33:34,554 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 02:33:34,555 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 02:33:34,607 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 02:33:34,609 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 02:33:34,610 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 02:33:34,611 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 02:33:34,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-10 02:33:34,628 INFO L203 MainTranslator]: Completed pre-run [2022-11-10 02:33:34,645 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-10 02:33:34,671 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 02:33:34,672 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 02:33:34,672 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 02:33:34,689 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 02:33:34,689 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 02:33:34,695 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 02:33:34,695 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 02:33:34,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-10 02:33:34,760 INFO L208 MainTranslator]: Completed translation [2022-11-10 02:33:34,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:34 WrapperNode [2022-11-10 02:33:34,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-10 02:33:34,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-10 02:33:34,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-10 02:33:34,762 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-10 02:33:34,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:34" (1/1) ... [2022-11-10 02:33:34,802 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:34" (1/1) ... [2022-11-10 02:33:34,857 INFO L138 Inliner]: procedures = 309, calls = 63, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 332 [2022-11-10 02:33:34,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-10 02:33:34,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-10 02:33:34,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-10 02:33:34,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-10 02:33:34,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:34" (1/1) ... [2022-11-10 02:33:34,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:34" (1/1) ... [2022-11-10 02:33:34,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:34" (1/1) ... [2022-11-10 02:33:34,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:34" (1/1) ... [2022-11-10 02:33:34,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:34" (1/1) ... [2022-11-10 02:33:34,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:34" (1/1) ... [2022-11-10 02:33:34,924 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:34" (1/1) ... [2022-11-10 02:33:34,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:34" (1/1) ... [2022-11-10 02:33:34,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-10 02:33:34,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-10 02:33:34,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-10 02:33:34,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-10 02:33:34,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:34" (1/1) ... [2022-11-10 02:33:34,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-10 02:33:34,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:34,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-10 02:33:34,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-10 02:33:35,002 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-11-10 02:33:35,003 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-11-10 02:33:35,003 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-11-10 02:33:35,003 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-11-10 02:33:35,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-10 02:33:35,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-10 02:33:35,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-10 02:33:35,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-10 02:33:35,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-10 02:33:35,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-10 02:33:35,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-10 02:33:35,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-10 02:33:35,005 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-10 02:33:35,136 INFO L235 CfgBuilder]: Building ICFG [2022-11-10 02:33:35,138 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-10 02:33:35,662 INFO L276 CfgBuilder]: Performing block encoding [2022-11-10 02:33:35,675 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-10 02:33:35,676 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-10 02:33:35,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:33:35 BoogieIcfgContainer [2022-11-10 02:33:35,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-10 02:33:35,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-10 02:33:35,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-10 02:33:35,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-10 02:33:35,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:33:34" (1/3) ... [2022-11-10 02:33:35,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b118b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:33:35, skipping insertion in model container [2022-11-10 02:33:35,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:34" (2/3) ... [2022-11-10 02:33:35,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b118b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:33:35, skipping insertion in model container [2022-11-10 02:33:35,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:33:35" (3/3) ... [2022-11-10 02:33:35,687 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2022-11-10 02:33:35,694 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-10 02:33:35,701 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-10 02:33:35,701 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2022-11-10 02:33:35,702 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-10 02:33:35,854 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-10 02:33:35,910 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:35,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:35,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:35,916 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 02:33:35,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-10 02:33:35,949 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:35,959 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr0ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:35,966 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;@7f6bc442, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:35,967 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:35,970 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 02:33:35,973 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:35,980 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 02:33:35,984 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr0ASSERT_VIOLATIONDATA_RACE was SAFE (1/44) [2022-11-10 02:33:35,995 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:35,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:35,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:35,999 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 02:33:36,034 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:36,035 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr1ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:36,036 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;@7f6bc442, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:36,036 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:36,036 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 02:33:36,036 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr1ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:36,037 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 02:33:36,038 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr1ASSERT_VIOLATIONDATA_RACE was SAFE (2/44) [2022-11-10 02:33:36,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-11-10 02:33:36,047 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:36,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:36,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:36,049 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 02:33:36,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-11-10 02:33:36,055 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:36,056 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr2ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:36,057 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;@7f6bc442, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:36,057 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:36,057 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 02:33:36,057 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr2ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:36,058 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 02:33:36,059 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr2ASSERT_VIOLATIONDATA_RACE was SAFE (3/44) [2022-11-10 02:33:36,068 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:36,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:36,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:36,070 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 02:33:36,077 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:36,078 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr3ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:36,078 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;@7f6bc442, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:36,078 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:36,079 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 02:33:36,079 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr3ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:36,080 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 02:33:36,080 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr3ASSERT_VIOLATIONDATA_RACE was SAFE (4/44) [2022-11-10 02:33:36,089 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:36,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:36,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:36,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-11-10 02:33:36,091 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 02:33:36,098 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:36,098 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr4ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:36,099 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;@7f6bc442, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:36,099 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:36,099 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 02:33:36,099 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr4ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:36,100 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 02:33:36,100 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr4ASSERT_VIOLATIONDATA_RACE was SAFE (5/44) [2022-11-10 02:33:36,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2022-11-10 02:33:36,108 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:36,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:36,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:36,118 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 02:33:36,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2022-11-10 02:33:36,128 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:36,129 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr5ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:36,129 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;@7f6bc442, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:36,129 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:36,129 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 02:33:36,129 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr5ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:36,130 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 02:33:36,130 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr5ASSERT_VIOLATIONDATA_RACE was SAFE (6/44) [2022-11-10 02:33:36,135 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:36,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:36,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:36,137 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 02:33:36,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2022-11-10 02:33:36,141 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:36,142 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr6ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:36,142 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;@7f6bc442, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:36,142 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:36,142 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 02:33:36,143 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr6ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:36,143 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 02:33:36,144 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr6ASSERT_VIOLATIONDATA_RACE was SAFE (7/44) [2022-11-10 02:33:36,148 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:36,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:36,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:36,156 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 02:33:36,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2022-11-10 02:33:36,163 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:36,163 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr7ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:36,164 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;@7f6bc442, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:36,164 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:36,164 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 02:33:36,164 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr7ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:36,165 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 02:33:36,165 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr7ASSERT_VIOLATIONDATA_RACE was SAFE (8/44) [2022-11-10 02:33:36,169 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:36,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:36,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:36,179 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 02:33:36,186 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:36,186 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr8ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:36,186 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;@7f6bc442, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:36,187 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:36,187 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 02:33:36,187 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr8ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:36,188 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 02:33:36,188 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr8ASSERT_VIOLATIONDATA_RACE was SAFE (9/44) [2022-11-10 02:33:36,193 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:36,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:36,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:36,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2022-11-10 02:33:36,195 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 02:33:36,205 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:36,206 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr9ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:36,206 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;@7f6bc442, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:36,206 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:36,206 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-10 02:33:36,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr9ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:36,207 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-10 02:33:36,208 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr9ASSERT_VIOLATIONDATA_RACE was SAFE (10/44) [2022-11-10 02:33:36,213 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:36,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:36,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:36,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2022-11-10 02:33:36,217 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 02:33:36,223 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:36,224 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:36,224 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;@7f6bc442, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:36,224 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:36,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Waiting until timeout for monitored process [2022-11-10 02:33:36,248 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:36,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:36,252 INFO L85 PathProgramCache]: Analyzing trace with hash -191310369, now seen corresponding path program 1 times [2022-11-10 02:33:36,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:36,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878625036] [2022-11-10 02:33:36,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:36,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:36,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 02:33:36,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:36,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878625036] [2022-11-10 02:33:36,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878625036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:33:36,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 02:33:36,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 02:33:36,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848285648] [2022-11-10 02:33:36,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:33:36,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 02:33:36,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:33:36,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 02:33:36,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 02:33:36,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:36,988 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:33:36,988 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 02:33:36,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:37,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:37,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:37,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-10 02:33:37,027 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-10 02:33:37,029 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE was SAFE (11/44) [2022-11-10 02:33:37,034 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:37,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:37,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:37,039 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 02:33:37,049 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:37,050 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:37,050 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;@7f6bc442, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:37,050 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:37,063 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:37,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:37,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1044539061, now seen corresponding path program 1 times [2022-11-10 02:33:37,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:37,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644627053] [2022-11-10 02:33:37,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:37,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:37,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2022-11-10 02:33:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:37,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 02:33:37,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:37,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644627053] [2022-11-10 02:33:37,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644627053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:33:37,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 02:33:37,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 02:33:37,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429705841] [2022-11-10 02:33:37,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:33:37,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 02:33:37,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:33:37,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 02:33:37,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 02:33:37,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:37,465 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:33:37,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 02:33:37,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:37,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:37,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-10 02:33:37,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-10 02:33:37,503 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-10 02:33:37,504 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE was SAFE (12/44) [2022-11-10 02:33:37,508 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 02:33:37,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 02:33:37,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:37,511 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 02:33:37,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Waiting until timeout for monitored process [2022-11-10 02:33:37,520 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 02:33:37,521 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 02:33:37,521 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;@7f6bc442, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 02:33:37,521 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 02:33:37,887 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:37,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:37,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1529789003, now seen corresponding path program 1 times [2022-11-10 02:33:37,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:37,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399616836] [2022-11-10 02:33:37,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:37,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 02:33:37,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:37,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399616836] [2022-11-10 02:33:37,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399616836] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:33:37,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 02:33:37,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-10 02:33:37,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251619682] [2022-11-10 02:33:37,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:33:37,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-10 02:33:37,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:33:37,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-10 02:33:37,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-10 02:33:37,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:37,944 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:33:37,945 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 02:33:37,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:37,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:37,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-10 02:33:37,990 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:37,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:37,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1658871722, now seen corresponding path program 1 times [2022-11-10 02:33:37,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:37,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983043084] [2022-11-10 02:33:37,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:37,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:38,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 02:33:38,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:38,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983043084] [2022-11-10 02:33:38,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983043084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:33:38,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 02:33:38,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-10 02:33:38,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936472135] [2022-11-10 02:33:38,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:33:38,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 02:33:38,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:33:38,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 02:33:38,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-10 02:33:38,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:38,082 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:33:38,083 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 02:33:38,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:38,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:38,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:38,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:38,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-10 02:33:38,203 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:38,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:38,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1776734729, now seen corresponding path program 1 times [2022-11-10 02:33:38,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:38,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54527985] [2022-11-10 02:33:38,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:38,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 02:33:38,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:38,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54527985] [2022-11-10 02:33:38,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54527985] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 02:33:38,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190823446] [2022-11-10 02:33:38,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:38,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 02:33:38,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:38,402 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 02:33:38,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-10 02:33:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:38,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-10 02:33:38,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 02:33:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 02:33:38,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 02:33:38,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 02:33:38,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190823446] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 02:33:38,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 02:33:38,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-10 02:33:38,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743077292] [2022-11-10 02:33:38,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 02:33:38,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-10 02:33:38,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:33:38,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-10 02:33:38,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-10 02:33:38,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:38,744 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:33:38,745 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 02:33:38,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:38,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:38,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:38,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:38,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:38,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:38,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-10 02:33:39,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 02:33:39,044 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:39,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:39,044 INFO L85 PathProgramCache]: Analyzing trace with hash -296005014, now seen corresponding path program 2 times [2022-11-10 02:33:39,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:39,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780177565] [2022-11-10 02:33:39,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:39,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:39,596 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 02:33:39,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:39,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780177565] [2022-11-10 02:33:39,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780177565] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 02:33:39,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273452635] [2022-11-10 02:33:39,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-10 02:33:39,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 02:33:39,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:39,604 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 02:33:39,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-10 02:33:39,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-10 02:33:39,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 02:33:39,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-10 02:33:39,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 02:33:40,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 02:33:40,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:40,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 02:33:40,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:40,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:40,251 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 02:33:40,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 02:33:40,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:40,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:40,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:40,285 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 02:33:40,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 02:33:40,312 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 02:33:40,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-10 02:33:40,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273452635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:33:40,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-10 02:33:40,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2022-11-10 02:33:40,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137283149] [2022-11-10 02:33:40,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:33:40,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-10 02:33:40,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:33:40,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-10 02:33:40,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-10 02:33:40,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:40,315 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:33:40,316 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 02:33:40,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:40,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:40,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:40,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:40,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:40,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:40,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:33:40,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-10 02:33:40,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 02:33:40,819 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:40,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:40,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1027964215, now seen corresponding path program 1 times [2022-11-10 02:33:40,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:40,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74050472] [2022-11-10 02:33:40,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:40,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:41,099 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 02:33:41,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:41,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74050472] [2022-11-10 02:33:41,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74050472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:33:41,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 02:33:41,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-10 02:33:41,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17737056] [2022-11-10 02:33:41,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:33:41,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 02:33:41,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:33:41,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 02:33:41,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-10 02:33:41,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:41,103 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:33:41,104 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 02:33:41,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:41,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:41,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:41,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:33:41,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:33:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:41,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-10 02:33:41,176 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:41,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:41,176 INFO L85 PathProgramCache]: Analyzing trace with hash -748196360, now seen corresponding path program 1 times [2022-11-10 02:33:41,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:41,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259972557] [2022-11-10 02:33:41,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:41,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:41,642 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 02:33:41,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:41,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259972557] [2022-11-10 02:33:41,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259972557] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 02:33:41,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259828985] [2022-11-10 02:33:41,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:41,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 02:33:41,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:41,644 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 02:33:41,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-10 02:33:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:42,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 1180 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-10 02:33:42,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 02:33:42,297 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 02:33:42,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 02:33:42,591 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 02:33:42,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259828985] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 02:33:42,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 02:33:42,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-10 02:33:42,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264096886] [2022-11-10 02:33:42,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 02:33:42,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-10 02:33:42,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:33:42,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-10 02:33:42,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-11-10 02:33:42,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:42,594 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:33:42,595 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 02:33:42,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:42,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:42,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:42,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:33:42,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:42,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:42,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:42,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:42,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:42,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:33:42,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:42,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:33:42,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-10 02:33:42,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 02:33:42,915 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:42,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:42,916 INFO L85 PathProgramCache]: Analyzing trace with hash 801071928, now seen corresponding path program 2 times [2022-11-10 02:33:42,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:42,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633037796] [2022-11-10 02:33:42,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:42,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:44,867 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 02:33:44,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:44,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633037796] [2022-11-10 02:33:44,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633037796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:33:44,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 02:33:44,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-10 02:33:44,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927805023] [2022-11-10 02:33:44,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:33:44,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 02:33:44,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:33:44,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 02:33:44,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 02:33:44,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:44,871 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:33:44,872 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 02:33:44,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:44,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:44,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:44,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:33:44,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:44,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:33:44,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:33:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:33:45,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:45,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-10 02:33:45,118 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:45,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:45,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1228503580, now seen corresponding path program 1 times [2022-11-10 02:33:45,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:45,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015870057] [2022-11-10 02:33:45,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:45,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:46,884 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 02:33:46,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:46,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015870057] [2022-11-10 02:33:46,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015870057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:33:46,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 02:33:46,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-10 02:33:46,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269997115] [2022-11-10 02:33:46,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:33:46,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 02:33:46,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:33:46,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 02:33:46,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 02:33:46,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:46,889 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:33:46,889 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 02:33:46,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:46,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:46,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:46,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:33:46,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:46,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:33:46,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:46,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:47,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:33:47,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:47,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:47,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:33:47,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:33:47,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:33:47,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:47,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:33:47,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-10 02:33:47,096 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:33:47,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:33:47,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1591211897, now seen corresponding path program 1 times [2022-11-10 02:33:47,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:33:47,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054013231] [2022-11-10 02:33:47,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:47,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:33:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:51,561 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 02:33:51,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:33:51,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054013231] [2022-11-10 02:33:51,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054013231] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 02:33:51,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161563710] [2022-11-10 02:33:51,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:33:51,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 02:33:51,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:33:51,564 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 02:33:51,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-10 02:33:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:33:52,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 1989 conjuncts, 140 conjunts are in the unsatisfiable core [2022-11-10 02:33:52,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 02:33:52,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-10 02:33:52,330 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-10 02:33:52,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-10 02:33:52,382 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 02:33:52,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 02:33:58,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 02:33:58,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:58,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 02:33:58,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:58,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:58,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 02:33:58,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:58,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:58,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:33:58,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 02:33:58,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 02:33:58,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:33:58,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:33:58,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:33:59,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:33:59,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:33:59,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:33:59,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:33:59,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 02:33:59,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:33:59,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:33:59,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 02:33:59,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:33:59,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:33:59,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:33:59,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:33:59,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 02:33:59,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:33:59,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 02:33:59,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:33:59,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:00,046 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 02:34:00,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 02:34:00,073 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 02:34:00,424 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 02:34:00,449 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 02:34:00,688 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 02:34:04,482 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 02:34:04,842 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 02:34:04,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2022-11-10 02:34:04,849 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 02:34:04,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 122 [2022-11-10 02:34:04,865 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 02:34:04,869 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 02:34:06,750 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 02:34:06,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161563710] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 02:34:06,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 02:34:06,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27, 19] total 65 [2022-11-10 02:34:06,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846475180] [2022-11-10 02:34:06,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 02:34:06,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-10 02:34:06,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:34:06,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-10 02:34:06,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=3220, Unknown=139, NotChecked=610, Total=4290 [2022-11-10 02:34:06,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:06,755 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:34:06,756 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 02:34:06,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:06,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:06,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:06,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:34:06,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:06,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:34:06,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:06,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:06,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:34:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:34:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-10 02:34:09,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-10 02:34:09,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 02:34:09,866 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:34:09,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:34:09,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1660305059, now seen corresponding path program 1 times [2022-11-10 02:34:09,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:34:09,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436042646] [2022-11-10 02:34:09,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:34:09,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:34:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:34:15,702 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 02:34:15,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:34:15,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436042646] [2022-11-10 02:34:15,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436042646] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 02:34:15,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666068326] [2022-11-10 02:34:15,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:34:15,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 02:34:15,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:34:15,708 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 02:34:15,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-10 02:34:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:34:16,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 2168 conjuncts, 138 conjunts are in the unsatisfiable core [2022-11-10 02:34:16,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 02:34:16,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-10 02:34:16,461 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-10 02:34:16,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-10 02:34:16,474 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 02:34:16,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 02:34:19,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 02:34:20,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:20,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 02:34:20,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:20,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:20,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 02:34:20,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:20,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:20,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:20,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 02:34:20,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:20,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:20,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:20,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:20,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:20,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:20,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:20,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:21,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:21,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:21,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:21,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:21,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:34:21,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:21,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 02:34:21,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:21,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 02:34:21,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:21,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:21,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 02:34:21,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 02:34:21,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:21,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:22,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:22,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:22,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:22,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 02:34:22,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:22,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:22,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 02:34:22,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:22,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:22,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:22,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:22,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:22,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 02:34:22,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 02:34:22,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 02:34:22,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 02:34:23,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 02:34:23,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:23,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:23,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:23,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:23,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:23,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 02:34:23,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:23,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:34:23,543 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 02:34:23,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 02:34:23,560 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4801 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork1_ring_enqueue_~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_~r#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_ring_enqueue_~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_~r#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 02:34:23,593 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 02:34:23,617 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 02:34:24,592 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 02:34:26,681 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 02:34:26,696 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 02:34:26,800 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 02:34:26,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2022-11-10 02:34:26,807 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 02:34:26,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 64 [2022-11-10 02:34:26,810 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 02:34:26,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-11-10 02:34:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1554 trivial. 5 not checked. [2022-11-10 02:34:28,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666068326] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 02:34:28,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 02:34:28,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30, 23] total 76 [2022-11-10 02:34:28,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717513868] [2022-11-10 02:34:28,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 02:34:28,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-10 02:34:28,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:34:28,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-10 02:34:28,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=4426, Unknown=154, NotChecked=858, Total=5852 [2022-11-10 02:34:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:28,418 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:34:28,419 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 02:34:28,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:28,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:28,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:28,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:34:28,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:28,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:34:28,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:28,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:28,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-10 02:34:28,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:32,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:32,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:32,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:32,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:34:32,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:32,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:34:32,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:32,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:32,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-10 02:34:32,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-10 02:34:32,395 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 02:34:32,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 02:34:32,576 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:34:32,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:34:32,576 INFO L85 PathProgramCache]: Analyzing trace with hash -378190532, now seen corresponding path program 1 times [2022-11-10 02:34:32,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:34:32,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828285994] [2022-11-10 02:34:32,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:34:32,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:34:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:34:36,275 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 02:34:36,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:34:36,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828285994] [2022-11-10 02:34:36,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828285994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:34:36,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 02:34:36,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-10 02:34:36,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998459583] [2022-11-10 02:34:36,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:34:36,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-10 02:34:36,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:34:36,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-10 02:34:36,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-11-10 02:34:36,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:36,278 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:34:36,279 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 02:34:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:34:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:34:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-10 02:34:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-10 02:34:36,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:37,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:37,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:37,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:37,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:34:37,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:37,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:34:37,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:37,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:37,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-10 02:34:37,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-10 02:34:37,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 02:34:37,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-10 02:34:37,716 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:34:37,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:34:37,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1338166489, now seen corresponding path program 1 times [2022-11-10 02:34:37,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:34:37,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820941070] [2022-11-10 02:34:37,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:34:37,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:34:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:34:39,078 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 02:34:39,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:34:39,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820941070] [2022-11-10 02:34:39,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820941070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:34:39,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 02:34:39,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-10 02:34:39,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483638196] [2022-11-10 02:34:39,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:34:39,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 02:34:39,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:34:39,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 02:34:39,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 02:34:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:39,081 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:34:39,081 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 02:34:39,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:39,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:39,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:39,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:34:39,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:39,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:34:39,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:39,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:39,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-10 02:34:39,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-10 02:34:39,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 02:34:39,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:39,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:39,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:39,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:39,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:34:39,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:39,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:34:39,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:39,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:39,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-10 02:34:39,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-10 02:34:39,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 02:34:39,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:39,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-10 02:34:39,391 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:34:39,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:34:39,391 INFO L85 PathProgramCache]: Analyzing trace with hash -408918114, now seen corresponding path program 1 times [2022-11-10 02:34:39,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:34:39,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196905814] [2022-11-10 02:34:39,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:34:39,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:34:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:34:44,612 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 02:34:44,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:34:44,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196905814] [2022-11-10 02:34:44,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196905814] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 02:34:44,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 02:34:44,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-11-10 02:34:44,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732671474] [2022-11-10 02:34:44,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 02:34:44,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-10 02:34:44,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:34:44,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-10 02:34:44,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2022-11-10 02:34:44,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:44,615 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:34:44,616 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 02:34:44,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:44,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:44,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:44,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:34:44,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:44,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:34:44,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:44,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:44,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-10 02:34:44,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-10 02:34:44,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 02:34:44,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:44,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:34:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:34:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:34:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:34:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-10 02:34:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-10 02:34:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 02:34:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:34:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-10 02:34:54,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-10 02:34:54,465 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:34:54,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:34:54,465 INFO L85 PathProgramCache]: Analyzing trace with hash 182679402, now seen corresponding path program 1 times [2022-11-10 02:34:54,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:34:54,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912602870] [2022-11-10 02:34:54,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:34:54,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:34:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:34:57,031 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 02:34:57,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:34:57,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912602870] [2022-11-10 02:34:57,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912602870] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 02:34:57,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805495529] [2022-11-10 02:34:57,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:34:57,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 02:34:57,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:34:57,036 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 02:34:57,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-10 02:34:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:34:57,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 2379 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-10 02:34:57,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 02:35:01,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-10 02:35:01,800 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 02:35:01,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 02:35:02,102 INFO L356 Elim1Store]: treesize reduction 26, result has 82.8 percent of original size [2022-11-10 02:35:02,102 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 02:35:04,583 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 02:35:04,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805495529] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 02:35:04,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 02:35:04,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 14] total 32 [2022-11-10 02:35:04,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853334121] [2022-11-10 02:35:04,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 02:35:04,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-10 02:35:04,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:35:04,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-10 02:35:04,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2022-11-10 02:35:04,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:35:04,588 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:35:04,588 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 02:35:04,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:35:04,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:35:04,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:04,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:35:04,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:35:04,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:35:04,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:04,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:04,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-10 02:35:04,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-10 02:35:04,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 02:35:04,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:04,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-10 02:35:04,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:35:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:35:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:35:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:35:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:35:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:35:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-10 02:35:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-10 02:35:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 02:35:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-10 02:35:09,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 02:35:09,990 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 02:35:10,170 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 02:35:10,171 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:35:10,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:35:10,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1786728371, now seen corresponding path program 1 times [2022-11-10 02:35:10,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:35:10,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582879139] [2022-11-10 02:35:10,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:35:10,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:35:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:35:13,557 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 02:35:13,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:35:13,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582879139] [2022-11-10 02:35:13,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582879139] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 02:35:13,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113422709] [2022-11-10 02:35:13,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:35:13,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 02:35:13,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:35:13,560 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 02:35:13,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-10 02:35:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:35:14,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 2843 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-10 02:35:14,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 02:35:20,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-10 02:35:20,108 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 02:35:20,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 02:35:20,325 INFO L356 Elim1Store]: treesize reduction 26, result has 82.8 percent of original size [2022-11-10 02:35:20,325 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 02:35:24,258 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 02:35:24,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113422709] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 02:35:24,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 02:35:24,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 14] total 34 [2022-11-10 02:35:24,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529684256] [2022-11-10 02:35:24,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 02:35:24,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-10 02:35:24,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 02:35:24,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-10 02:35:24,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2022-11-10 02:35:24,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:35:24,263 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 02:35:24,263 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 02:35:24,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:35:24,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:35:24,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:24,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:35:24,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:35:24,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:35:24,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:24,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:24,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-10 02:35:24,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-10 02:35:24,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 02:35:24,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:24,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-10 02:35:24,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 02:35:24,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:35:30,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 02:35:30,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:35:30,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:30,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 02:35:30,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 02:35:30,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-10 02:35:30,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:30,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:30,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-10 02:35:30,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-10 02:35:30,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 02:35:30,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 02:35:30,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-10 02:35:30,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 02:35:30,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-10 02:35:30,994 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 02:35:31,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-10 02:35:31,176 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 02:35:31,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 02:35:31,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1103528356, now seen corresponding path program 1 times [2022-11-10 02:35:31,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 02:35:31,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870510850] [2022-11-10 02:35:31,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:35:31,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 02:35:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:36:50,573 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 02:36:50,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 02:36:50,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870510850] [2022-11-10 02:36:50,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870510850] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 02:36:50,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155106071] [2022-11-10 02:36:50,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 02:36:50,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 02:36:50,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 02:36:50,576 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 02:36:50,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-10 02:36:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 02:36:51,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 4259 conjuncts, 513 conjunts are in the unsatisfiable core [2022-11-10 02:36:51,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 02:36:51,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-10 02:36:51,869 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-10 02:36:51,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-10 02:36:51,885 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 02:36:51,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 02:36:57,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 02:36:57,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:36:57,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 02:36:57,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:36:57,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:36:57,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 02:36:57,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:36:57,809 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 02:36:57,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:36:57,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:36:57,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:36:57,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 02:36:57,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:36:57,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:36:57,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:36:57,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:36:57,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:36:57,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:36:58,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:36:58,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:36:58,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:36:58,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:36:58,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:36:58,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:36:58,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 02:36:58,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:36:58,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:36:59,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 02:36:59,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:36:59,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:36:59,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:36:59,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:36:59,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 02:36:59,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:36:59,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:36:59,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:36:59,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:36:59,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 02:36:59,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:00,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:00,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:00,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:00,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:00,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:00,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 02:37:00,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 02:37:00,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:00,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:01,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:01,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:01,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:01,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:01,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:01,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:02,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:02,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 02:37:02,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 02:37:02,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:02,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:02,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:03,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:03,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 02:37:03,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:03,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:03,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:03,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:03,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:03,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:03,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:04,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:04,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:04,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 02:37:04,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:05,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:05,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:05,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:05,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:06,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:06,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:06,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:06,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:06,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:06,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:06,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 02:37:07,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:07,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:08,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:08,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 02:37:08,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:08,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:08,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:09,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 02:37:09,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:09,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:09,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 02:37:09,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 02:37:09,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:09,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 02:37:09,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 02:37:09,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:09,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 02:37:09,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:09,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 02:37:09,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:09,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:09,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:09,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 02:37:09,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:09,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:09,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:10,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:10,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:10,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:10,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:10,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:10,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:10,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:10,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:10,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:10,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:10,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:11,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 02:37:11,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:11,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:11,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 02:37:11,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:11,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:11,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:11,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 02:37:11,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:12,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:12,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:12,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:12,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:12,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:12,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 02:37:12,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:12,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:12,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:13,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:13,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 02:37:13,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:13,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 02:37:13,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 02:37:13,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 02:37:13,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 02:37:13,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:13,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 02:37:14,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 02:37:14,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:14,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:14,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:14,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:14,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:14,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:15,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 02:37:15,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:16,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:16,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:16,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 02:37:16,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 02:37:16,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:16,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 02:37:16,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:16,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:18,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:18,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:18,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 02:37:18,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 02:37:18,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 02:37:18,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 02:37:18,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:18,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 02:37:19,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:20,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:20,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:20,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:20,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:21,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:21,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:21,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:21,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:22,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:23,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:23,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:23,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:23,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:23,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:23,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:23,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:23,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:25,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:25,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:25,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:25,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 02:37:26,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:26,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:26,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:26,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:26,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:28,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:28,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 02:37:28,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:28,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:28,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:28,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 02:37:28,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:28,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:28,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 02:37:28,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:28,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:28,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 02:37:28,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:28,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:28,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:28,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:28,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:28,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:28,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:29,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 02:37:29,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 02:37:29,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:29,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 02:37:29,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:29,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:29,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:29,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:29,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:29,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:29,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:29,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:29,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 02:37:30,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:30,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:30,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 02:37:30,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:30,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:30,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 02:37:30,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:30,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 02:37:30,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:30,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:31,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:31,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:31,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:31,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:31,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 02:37:31,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:32,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:32,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 02:37:32,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 02:37:32,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:32,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:33,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:33,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:33,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:33,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 02:37:33,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:33,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:33,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:33,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:34,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 02:37:34,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:34,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 02:37:34,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:35,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 02:37:35,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:35,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:35,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:35,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:36,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:36,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:36,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 02:37:36,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:36,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:36,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 02:37:36,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:36,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:37,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:37,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:37,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:37,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:38,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:38,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:38,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:38,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 02:37:38,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 02:37:38,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:38,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 02:37:38,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:37:38,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:37:38,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:37:38,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-10 02:37:39,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:37:39,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:37:39,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 02:37:39,146 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 02:37:39,299 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 02:37:39,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 02:37:39,965 INFO L356 Elim1Store]: treesize reduction 48, result has 60.3 percent of original size [2022-11-10 02:37:39,965 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 02:37:40,003 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 02:37:40,062 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 02:37:40,113 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 02:37:40,161 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 02:37:40,180 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 02:37:40,231 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 02:37:40,371 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 02:37:40,371 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 02:37:40,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 02:37:40,418 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 02:37:40,434 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| 1)) (.cse0 (+ |c_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| 3)) (.cse2 (+ |c_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| 2))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_5 .cse0))) (not (= (select v_arrayElimArr_5 .cse1) 0)) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_dequeue_~r#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))) (or (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_dequeue_~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)))) (forall ((v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 .cse0) 0)) (not (= (select v_arrayElimArr_3 .cse2) 0)) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_dequeue_~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 .cse1) 0)) (not (= (select v_arrayElimArr_4 .cse0) 0)) (not (= (select v_arrayElimArr_4 .cse2) 0)) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_dequeue_~r#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 02:37:41,329 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 02:37:41,418 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_arrayElimArr_3 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_3 .cse0))) (= (select (select (store |c_#race| |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 .cse2) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 0)) (not (= (select v_arrayElimArr_6 .cse2) 0)) (= (select (select (store |c_#race| |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)))) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse2) 0)) (= (select (select (store |c_#race| |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_arrayElimArr_4 (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 |c_#race| |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 02:37:44,020 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_11260 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_11264 (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 |c_#race| |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))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_11264 (Array Int Int))) (or (= (select (select (store (store (store |c_#race| |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)) 0) (not (= 0 (select v_arrayElimArr_3 .cse2))) (not (= (select v_arrayElimArr_3 .cse0) 0)) (not (= (select v_arrayElimArr_3 .cse1) 0)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_11264 (Array Int Int))) (or (= (select (select (store (store (store |c_#race| |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 .cse1) 0)) (not (= (select v_arrayElimArr_5 .cse0) 0)) (not (= (select v_arrayElimArr_5 .cse2) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11264 (Array Int Int))) (or (= (select (select (store (store (store |c_#race| |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)) 0) (not (= (select v_arrayElimArr_6 .cse2) 0)) (not (= (select v_arrayElimArr_6 .cse1) 0)) (not (= (select v_arrayElimArr_6 .cse0) 0)))))) is different from false [2022-11-10 02:37:45,990 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| 3)) (.cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 1))) (and (forall ((v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_11259 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse0) 0)) (= (select (select (store (store (store |c_#race| |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_11259 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse2) 0)) (= (select (select (store (store (store |c_#race| |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)) (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))) (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 |c_#race| |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_11259 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_3 .cse2))) (not (= (select v_arrayElimArr_3 .cse1) 0)) (= (select (select (store (store (store |c_#race| |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)))))) is different from false [2022-11-10 02:37:46,547 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| 3)) (.cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 1))) (and (forall ((v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11255 (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 (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11255) |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_11260 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11255 (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 |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11255) |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_4 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11255 (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 |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11255) |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_11259 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_11255 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_3 .cse2))) (not (= (select v_arrayElimArr_3 .cse1) 0)) (= (select (select (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11255) |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)))))) is different from false [2022-11-10 02:37:47,024 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| 1)) (.cse1 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 3))) (and (forall ((v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_11255 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_3 .cse0))) (not (= (select v_arrayElimArr_3 .cse1) 0)) (= (select (select (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| v_ArrVal_11255) |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_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11255 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse1) 0)) (not (= (select v_arrayElimArr_4 .cse2) 0)) (= (select (select (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| v_ArrVal_11255) |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)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11255 (Array Int Int))) (or (= 0 (select (select (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| v_ArrVal_11255) |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))) (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_11260 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11255 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse0) 0)) (not (= (select v_arrayElimArr_6 .cse2) 0)) (= (select (select (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| v_ArrVal_11255) |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)))))) is different from false [2022-11-10 02:37:48,762 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 02:37:49,145 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 02:37:49,303 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 02:37:53,420 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_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))) (not (= (select v_arrayElimArr_3 .cse1) 0)) (= (select (select (store (store (store (store (store (store (store |c_#race| |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 .cse2) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_11260 (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 .cse2) 0)) (= (select (select (store (store (store (store (store (store (store |c_#race| |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)))) (forall ((v_ArrVal_11260 (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 .cse1) 0)) (not (= (select v_arrayElimArr_4 .cse2) 0)) (not (= (select v_arrayElimArr_4 .cse0) 0)) (= (select (select (store (store (store (store (store (store (store |c_#race| |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_11260 (Array Int Int)) (v_arrayElimArr_5 (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 |c_#race| |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)) (not (= (select v_arrayElimArr_5 .cse1) 0)) (not (= (select v_arrayElimArr_5 .cse0) 0)))))) is different from false [2022-11-10 02:37:54,740 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_11229 (Array Int Int)) (v_ArrVal_11228 (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 (store |c_#race| |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)) (not (= (select v_arrayElimArr_3 .cse2) 0)))) (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_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 (store |c_#race| |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)) (not (= (select v_arrayElimArr_5 .cse1) 0)) (not (= (select v_arrayElimArr_5 .cse0) 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_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 .cse2) 0)) (= 0 (select (select (store (store (store (store (store (store (store (store (store |c_#race| |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))) (not (= (select v_arrayElimArr_6 .cse1) 0)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11229 (Array Int Int)) (v_ArrVal_11228 (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 (= (select (select (store (store (store (store (store (store (store (store (store |c_#race| |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|) 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 02:37:56,387 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_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 (= (select (select (store (store (store (store (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| v_ArrVal_11227) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11228) |c_reader_twoThread1of1ForFork0_ring_empty_#in~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 .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_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 .cse1) 0)) (= 0 (select (select (store (store (store (store (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| v_ArrVal_11227) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11228) |c_reader_twoThread1of1ForFork0_ring_empty_#in~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))) (not (= (select v_arrayElimArr_3 .cse0) 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_#in~r#1.base| v_ArrVal_11227) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11228) |c_reader_twoThread1of1ForFork0_ring_empty_#in~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 .cse0) 0)) (not (= (select v_arrayElimArr_6 .cse1) 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_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 .cse1) 0)) (= (select (select (store (store (store (store (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| v_ArrVal_11227) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_11228) |c_reader_twoThread1of1ForFork0_ring_empty_#in~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|) 0) (not (= (select v_arrayElimArr_4 .cse0) 0)) (not (= (select v_arrayElimArr_4 .cse2) 0)))))) is different from false [2022-11-10 02:37:57,644 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 02:38:01,228 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_11260 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11202 (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)) (= (select (select (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11202) |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_arrayElimArr_5 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11202 (Array Int Int)) (v_ArrVal_11244 (Array Int Int)) (v_ArrVal_11243 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse1) 0)) (= (select (select (store (store (store (store (store (store |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11202) |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 .cse2) 0)))) (forall ((v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_11202 (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 |c_#race| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| v_ArrVal_11202) |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)))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_11260 (Array Int Int)) (v_ArrVal_11259 (Array Int Int)) (v_ArrVal_11202 (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 .cse1) 0)) (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_11202) |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 02:38:07,036 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-10 02:38:07,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-10 02:38:07,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-10 02:38:07,237 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 02:38:07,240 INFO L158 Benchmark]: Toolchain (without parser) took 273210.93ms. Allocated memory was 191.9MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 128.9MB in the beginning and 1.1GB in the end (delta: -985.7MB). Peak memory consumption was 835.5MB. Max. memory is 8.0GB. [2022-11-10 02:38:07,240 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 191.9MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-10 02:38:07,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 728.84ms. Allocated memory is still 191.9MB. Free memory was 128.5MB in the beginning and 136.8MB in the end (delta: -8.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-11-10 02:38:07,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.00ms. Allocated memory is still 191.9MB. Free memory was 136.8MB in the beginning and 131.8MB in the end (delta: 5.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-11-10 02:38:07,240 INFO L158 Benchmark]: Boogie Preprocessor took 77.52ms. Allocated memory is still 191.9MB. Free memory was 131.8MB in the beginning and 127.3MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-11-10 02:38:07,240 INFO L158 Benchmark]: RCFGBuilder took 742.25ms. Allocated memory is still 191.9MB. Free memory was 127.1MB in the beginning and 145.1MB in the end (delta: -18.0MB). Peak memory consumption was 29.9MB. Max. memory is 8.0GB. [2022-11-10 02:38:07,241 INFO L158 Benchmark]: TraceAbstraction took 271559.35ms. Allocated memory was 191.9MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 144.1MB in the beginning and 1.1GB in the end (delta: -970.5MB). Peak memory consumption was 849.1MB. Max. memory is 8.0GB. [2022-11-10 02:38:07,241 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 191.9MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 728.84ms. Allocated memory is still 191.9MB. Free memory was 128.5MB in the beginning and 136.8MB in the end (delta: -8.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 96.00ms. Allocated memory is still 191.9MB. Free memory was 136.8MB in the beginning and 131.8MB in the end (delta: 5.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 77.52ms. Allocated memory is still 191.9MB. Free memory was 131.8MB in the beginning and 127.3MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 742.25ms. Allocated memory is still 191.9MB. Free memory was 127.1MB in the beginning and 145.1MB in the end (delta: -18.0MB). Peak memory consumption was 29.9MB. Max. memory is 8.0GB. * TraceAbstraction took 271559.35ms. Allocated memory was 191.9MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 144.1MB in the beginning and 1.1GB in the end (delta: -970.5MB). Peak memory consumption was 849.1MB. 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 02:38:07,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Forceful destruction successful, exit code 0 [2022-11-10 02:38:07,488 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 02:38:07,689 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 02:38:07,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Ended with exit code 0 [2022-11-10 02:38:08,087 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 02:38:08,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Ended with exit code 0 [2022-11-10 02:38:08,496 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 02:38:08,688 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 02:38:08,888 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 02:38:09,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2022-11-10 02:38:09,289 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 02:38:09,489 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 02:38:09,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2022-11-10 02:38:10,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...