/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_THREAD_INSTANCE -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_1w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-44940e9-m [2022-11-10 12:22:13,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-10 12:22:13,075 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-10 12:22:13,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-10 12:22:13,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-10 12:22:13,100 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-10 12:22:13,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-10 12:22:13,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-10 12:22:13,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-10 12:22:13,111 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-10 12:22:13,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-10 12:22:13,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-10 12:22:13,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-10 12:22:13,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-10 12:22:13,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-10 12:22:13,116 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-10 12:22:13,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-10 12:22:13,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-10 12:22:13,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-10 12:22:13,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-10 12:22:13,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-10 12:22:13,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-10 12:22:13,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-10 12:22:13,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-10 12:22:13,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-10 12:22:13,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-10 12:22:13,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-10 12:22:13,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-10 12:22:13,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-10 12:22:13,131 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-10 12:22:13,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-10 12:22:13,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-10 12:22:13,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-10 12:22:13,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-10 12:22:13,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-10 12:22:13,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-10 12:22:13,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-10 12:22:13,134 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-10 12:22:13,134 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-10 12:22:13,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-10 12:22:13,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-10 12:22:13,139 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf [2022-11-10 12:22:13,164 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-10 12:22:13,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-10 12:22:13,165 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-10 12:22:13,165 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-10 12:22:13,166 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-10 12:22:13,166 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-10 12:22:13,166 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-10 12:22:13,166 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-10 12:22:13,166 INFO L138 SettingsManager]: * Use SBE=true [2022-11-10 12:22:13,167 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-10 12:22:13,167 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-10 12:22:13,167 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-10 12:22:13,167 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-10 12:22:13,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-10 12:22:13,168 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-10 12:22:13,168 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-10 12:22:13,168 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-10 12:22:13,168 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-10 12:22:13,168 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-10 12:22:13,168 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-10 12:22:13,168 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-10 12:22:13,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-10 12:22:13,168 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-10 12:22:13,169 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-10 12:22:13,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-10 12:22:13,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-10 12:22:13,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-10 12:22:13,170 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-10 12:22:13,170 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-10 12:22:13,170 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-10 12:22:13,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-10 12:22:13,170 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-10 12:22:13,170 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-10 12:22:13,171 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-10 12:22:13,171 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-10 12:22:13,171 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-10 12:22:13,171 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-10 12:22:13,171 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-10 12:22:13,171 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_THREAD_INSTANCE 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 12:22:13,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-10 12:22:13,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-10 12:22:13,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-10 12:22:13,406 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-10 12:22:13,407 INFO L275 PluginConnector]: CDTParser initialized [2022-11-10 12:22:13,408 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2022-11-10 12:22:13,459 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a6c3d874/88a8f960990946b984bcd5cd0167c6d1/FLAG092ebeb36 [2022-11-10 12:22:13,895 INFO L306 CDTParser]: Found 1 translation units. [2022-11-10 12:22:13,895 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2022-11-10 12:22:13,903 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a6c3d874/88a8f960990946b984bcd5cd0167c6d1/FLAG092ebeb36 [2022-11-10 12:22:13,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a6c3d874/88a8f960990946b984bcd5cd0167c6d1 [2022-11-10 12:22:13,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-10 12:22:13,915 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-10 12:22:13,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-10 12:22:13,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-10 12:22:13,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-10 12:22:13,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:22:13" (1/1) ... [2022-11-10 12:22:13,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44cfefba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:22:13, skipping insertion in model container [2022-11-10 12:22:13,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:22:13" (1/1) ... [2022-11-10 12:22:13,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-10 12:22:13,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-10 12:22:14,057 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-10 12:22:14,176 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_1w1r-2.i[39095,39108] [2022-11-10 12:22:14,177 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_1w1r-2.i[39180,39193] [2022-11-10 12:22:14,178 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_1w1r-2.i[39232,39245] [2022-11-10 12:22:14,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-10 12:22:14,187 INFO L203 MainTranslator]: Completed pre-run [2022-11-10 12:22:14,195 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-10 12:22:14,222 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_1w1r-2.i[39095,39108] [2022-11-10 12:22:14,223 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_1w1r-2.i[39180,39193] [2022-11-10 12:22:14,223 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_1w1r-2.i[39232,39245] [2022-11-10 12:22:14,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-10 12:22:14,258 INFO L208 MainTranslator]: Completed translation [2022-11-10 12:22:14,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:22:14 WrapperNode [2022-11-10 12:22:14,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-10 12:22:14,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-10 12:22:14,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-10 12:22:14,260 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-10 12:22:14,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:22:14" (1/1) ... [2022-11-10 12:22:14,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:22:14" (1/1) ... [2022-11-10 12:22:14,306 INFO L138 Inliner]: procedures = 224, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 217 [2022-11-10 12:22:14,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-10 12:22:14,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-10 12:22:14,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-10 12:22:14,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-10 12:22:14,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:22:14" (1/1) ... [2022-11-10 12:22:14,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:22:14" (1/1) ... [2022-11-10 12:22:14,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:22:14" (1/1) ... [2022-11-10 12:22:14,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:22:14" (1/1) ... [2022-11-10 12:22:14,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:22:14" (1/1) ... [2022-11-10 12:22:14,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:22:14" (1/1) ... [2022-11-10 12:22:14,344 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:22:14" (1/1) ... [2022-11-10 12:22:14,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:22:14" (1/1) ... [2022-11-10 12:22:14,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-10 12:22:14,348 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-10 12:22:14,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-10 12:22:14,348 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-10 12:22:14,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:22:14" (1/1) ... [2022-11-10 12:22:14,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-10 12:22:14,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 12:22:14,375 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 12:22:14,378 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 12:22:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2022-11-10 12:22:14,400 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2022-11-10 12:22:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-10 12:22:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-10 12:22:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-10 12:22:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-10 12:22:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-10 12:22:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-10 12:22:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-10 12:22:14,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-10 12:22:14,401 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 12:22:14,485 INFO L235 CfgBuilder]: Building ICFG [2022-11-10 12:22:14,486 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-10 12:22:14,826 INFO L276 CfgBuilder]: Performing block encoding [2022-11-10 12:22:14,833 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-10 12:22:14,833 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-10 12:22:14,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:22:14 BoogieIcfgContainer [2022-11-10 12:22:14,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-10 12:22:14,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-10 12:22:14,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-10 12:22:14,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-10 12:22:14,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:22:13" (1/3) ... [2022-11-10 12:22:14,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dbb4358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:22:14, skipping insertion in model container [2022-11-10 12:22:14,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:22:14" (2/3) ... [2022-11-10 12:22:14,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dbb4358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:22:14, skipping insertion in model container [2022-11-10 12:22:14,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:22:14" (3/3) ... [2022-11-10 12:22:14,841 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2022-11-10 12:22:14,846 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-10 12:22:14,853 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-10 12:22:14,853 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-11-10 12:22:14,853 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-10 12:22:14,981 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-10 12:22:15,031 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 12:22:15,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 12:22:15,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 12:22:15,034 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 12:22:15,045 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 12:22:15,057 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 12:22:15,066 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_fnThread1of1ForFork0 ======== [2022-11-10 12:22:15,070 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;@4d332432, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 12:22:15,070 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-10 12:22:15,273 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting reader_fnErr6ASSERT_VIOLATIONDATA_RACE === [reader_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-10 12:22:15,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 12:22:15,276 INFO L85 PathProgramCache]: Analyzing trace with hash 680632655, now seen corresponding path program 1 times [2022-11-10 12:22:15,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 12:22:15,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783899580] [2022-11-10 12:22:15,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:22:15,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 12:22:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 12:22:15,472 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 12:22:15,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 12:22:15,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783899580] [2022-11-10 12:22:15,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783899580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 12:22:15,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 12:22:15,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-10 12:22:15,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693417612] [2022-11-10 12:22:15,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 12:22:15,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-10 12:22:15,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 12:22:15,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-10 12:22:15,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-10 12:22:15,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:15,502 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 12:22:15,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 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 12:22:15,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:15,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:15,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-10 12:22:15,549 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting reader_fnErr0ASSERT_VIOLATIONDATA_RACE === [reader_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-10 12:22:15,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 12:22:15,549 INFO L85 PathProgramCache]: Analyzing trace with hash -20151938, now seen corresponding path program 1 times [2022-11-10 12:22:15,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 12:22:15,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832587044] [2022-11-10 12:22:15,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:22:15,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 12:22:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 12:22:16,001 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 12:22:16,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 12:22:16,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832587044] [2022-11-10 12:22:16,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832587044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 12:22:16,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 12:22:16,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 12:22:16,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539677742] [2022-11-10 12:22:16,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 12:22:16,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 12:22:16,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 12:22:16,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 12:22:16,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 12:22:16,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:16,007 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 12:22:16,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 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 12:22:16,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:16,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:16,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:16,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:16,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-10 12:22:16,152 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reader_fnErr1ASSERT_VIOLATIONDATA_RACE === [reader_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-10 12:22:16,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 12:22:16,153 INFO L85 PathProgramCache]: Analyzing trace with hash 169554917, now seen corresponding path program 1 times [2022-11-10 12:22:16,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 12:22:16,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092065885] [2022-11-10 12:22:16,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:22:16,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 12:22:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 12:22:16,449 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 12:22:16,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 12:22:16,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092065885] [2022-11-10 12:22:16,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092065885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 12:22:16,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 12:22:16,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 12:22:16,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873054349] [2022-11-10 12:22:16,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 12:22:16,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 12:22:16,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 12:22:16,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 12:22:16,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 12:22:16,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:16,459 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 12:22:16,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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 12:22:16,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:16,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:16,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:16,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:16,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:16,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:16,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-10 12:22:16,576 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting reader_fnErr2ASSERT_VIOLATIONDATA_RACE === [reader_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-10 12:22:16,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 12:22:16,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1653055125, now seen corresponding path program 1 times [2022-11-10 12:22:16,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 12:22:16,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785658365] [2022-11-10 12:22:16,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:22:16,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 12:22:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 12:22:16,887 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 12:22:16,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 12:22:16,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785658365] [2022-11-10 12:22:16,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785658365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 12:22:16,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 12:22:16,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 12:22:16,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162975032] [2022-11-10 12:22:16,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 12:22:16,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 12:22:16,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 12:22:16,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 12:22:16,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 12:22:16,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:16,891 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 12:22:16,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 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 12:22:16,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:16,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:16,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:16,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:16,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:16,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:16,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:16,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:16,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-10 12:22:16,998 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting reader_fnErr3ASSERT_VIOLATIONDATA_RACE === [reader_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-10 12:22:16,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 12:22:16,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1736259527, now seen corresponding path program 1 times [2022-11-10 12:22:16,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 12:22:16,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176191593] [2022-11-10 12:22:16,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:22:16,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 12:22:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 12:22:17,312 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 12:22:17,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 12:22:17,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176191593] [2022-11-10 12:22:17,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176191593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 12:22:17,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 12:22:17,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 12:22:17,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601606903] [2022-11-10 12:22:17,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 12:22:17,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 12:22:17,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 12:22:17,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 12:22:17,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 12:22:17,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:17,315 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 12:22:17,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 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 12:22:17,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:17,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:17,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:17,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:17,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:17,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:17,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:17,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:17,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:17,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:17,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-10 12:22:17,483 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reader_fnErr5ASSERT_VIOLATIONDATA_RACE === [reader_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-10 12:22:17,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 12:22:17,483 INFO L85 PathProgramCache]: Analyzing trace with hash 730797762, now seen corresponding path program 1 times [2022-11-10 12:22:17,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 12:22:17,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576995572] [2022-11-10 12:22:17,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:22:17,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 12:22:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 12:22:17,847 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 12:22:17,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 12:22:17,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576995572] [2022-11-10 12:22:17,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576995572] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 12:22:17,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 12:22:17,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 12:22:17,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607032195] [2022-11-10 12:22:17,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 12:22:17,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 12:22:17,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 12:22:17,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 12:22:17,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 12:22:17,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:17,851 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 12:22:17,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.0) internal successors, (110), 6 states have internal predecessors, (110), 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 12:22:17,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:17,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:17,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:17,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:17,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:17,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:17,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:17,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:17,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:17,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:17,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:17,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:17,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-10 12:22:17,954 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reader_fnErr5ASSERT_VIOLATIONDATA_RACE === [reader_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-10 12:22:17,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 12:22:17,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1809143706, now seen corresponding path program 1 times [2022-11-10 12:22:17,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 12:22:17,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842201530] [2022-11-10 12:22:17,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:22:17,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 12:22:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 12:22:18,025 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 12:22:18,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 12:22:18,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842201530] [2022-11-10 12:22:18,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842201530] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 12:22:18,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 12:22:18,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-10 12:22:18,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789971963] [2022-11-10 12:22:18,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 12:22:18,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 12:22:18,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 12:22:18,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 12:22:18,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-10 12:22:18,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:18,031 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 12:22:18,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 12:22:18,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:18,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:18,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:18,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:18,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:18,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:18,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:18,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:18,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:18,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:18,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:18,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:18,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:18,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 12:22:18,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-10 12:22:18,079 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reader_fnErr5ASSERT_VIOLATIONDATA_RACE === [reader_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-10 12:22:18,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 12:22:18,079 INFO L85 PathProgramCache]: Analyzing trace with hash 772080377, now seen corresponding path program 1 times [2022-11-10 12:22:18,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 12:22:18,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919421510] [2022-11-10 12:22:18,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:22:18,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 12:22:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 12:22:18,996 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 12:22:18,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 12:22:18,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919421510] [2022-11-10 12:22:18,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919421510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 12:22:18,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 12:22:18,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-10 12:22:18,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103301130] [2022-11-10 12:22:18,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 12:22:18,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-10 12:22:18,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 12:22:18,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-10 12:22:18,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-11-10 12:22:18,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:18,999 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 12:22:19,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 7.470588235294118) internal successors, (127), 18 states have internal predecessors, (127), 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 12:22:19,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:19,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:19,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:19,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:19,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:19,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:19,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 12:22:19,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:19,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:19,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:19,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 12:22:19,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 12:22:19,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-10 12:22:19,757 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting reader_fnErr5ASSERT_VIOLATIONDATA_RACE === [reader_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-10 12:22:19,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 12:22:19,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1188364931, now seen corresponding path program 1 times [2022-11-10 12:22:19,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 12:22:19,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312846305] [2022-11-10 12:22:19,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:22:19,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 12:22:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 12:22:20,868 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 12:22:20,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 12:22:20,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312846305] [2022-11-10 12:22:20,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312846305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 12:22:20,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 12:22:20,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-11-10 12:22:20,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410714985] [2022-11-10 12:22:20,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 12:22:20,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-10 12:22:20,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 12:22:20,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-10 12:22:20,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-11-10 12:22:20,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:20,872 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 12:22:20,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.65) internal successors, (133), 20 states have internal predecessors, (133), 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 12:22:20,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:20,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:20,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:20,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:20,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:20,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:20,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 12:22:20,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 12:22:20,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:22,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:22,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:22,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:22,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:22,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:22,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:22,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 12:22:22,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 12:22:22,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 12:22:22,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-10 12:22:22,344 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting reader_fnErr0ASSERT_VIOLATIONDATA_RACE === [reader_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-10 12:22:22,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 12:22:22,344 INFO L85 PathProgramCache]: Analyzing trace with hash 163018787, now seen corresponding path program 1 times [2022-11-10 12:22:22,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 12:22:22,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713093679] [2022-11-10 12:22:22,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:22:22,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 12:22:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 12:22:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 43 proven. 299 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-11-10 12:22:25,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 12:22:25,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713093679] [2022-11-10 12:22:25,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713093679] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 12:22:25,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604858168] [2022-11-10 12:22:25,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:22:25,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 12:22:25,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 12:22:25,903 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 12:22:25,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-10 12:22:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 12:22:26,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 127 conjunts are in the unsatisfiable core [2022-11-10 12:22:26,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 12:22:26,246 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 12:22:26,257 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 12:22:26,257 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 12:22:26,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-10 12:22:26,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:26,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 12:22:26,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-10 12:22:28,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 12:22:28,811 INFO L356 Elim1Store]: treesize reduction 48, result has 26.2 percent of original size [2022-11-10 12:22:28,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 38 [2022-11-10 12:22:28,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 12:22:28,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-11-10 12:22:29,080 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 12:22:29,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:29,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 12:22:29,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:29,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:29,191 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 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 12:22:29,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:29,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:29,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:29,257 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 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 12:22:29,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:29,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:29,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:29,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:29,337 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 12:22:29,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2022-11-10 12:22:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 61 proven. 213 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-11-10 12:22:29,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 12:22:34,825 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 12:22:34,826 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 2 case distinctions, treesize of input 30 treesize of output 36 [2022-11-10 12:22:34,837 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 12:22:34,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 63 [2022-11-10 12:22:34,843 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 30 treesize of output 26 [2022-11-10 12:22:35,101 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2022-11-10 12:22:35,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604858168] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 12:22:35,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 12:22:35,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 29, 24] total 83 [2022-11-10 12:22:35,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965999702] [2022-11-10 12:22:35,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 12:22:35,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-11-10 12:22:35,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 12:22:35,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-11-10 12:22:35,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=6578, Unknown=37, NotChecked=0, Total=6972 [2022-11-10 12:22:35,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:35,105 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 12:22:35,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 83 states have (on average 5.734939759036145) internal successors, (476), 84 states have internal predecessors, (476), 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 12:22:35,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:35,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:35,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:35,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:35,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:35,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:35,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 12:22:35,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 12:22:35,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 12:22:35,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:42,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 12:22:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 12:22:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 12:22:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-10 12:22:42,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-10 12:22:42,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-10 12:22:42,852 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting reader_fnErr5ASSERT_VIOLATIONDATA_RACE === [reader_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-10 12:22:42,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 12:22:42,852 INFO L85 PathProgramCache]: Analyzing trace with hash 163916089, now seen corresponding path program 1 times [2022-11-10 12:22:42,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 12:22:42,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002330228] [2022-11-10 12:22:42,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:22:42,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 12:22:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 12:22:45,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3808 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 3519 trivial. 0 not checked. [2022-11-10 12:22:45,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 12:22:45,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002330228] [2022-11-10 12:22:45,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002330228] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 12:22:45,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902105665] [2022-11-10 12:22:45,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:22:45,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 12:22:45,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 12:22:45,748 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 12:22:45,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-10 12:22:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 12:22:46,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 1781 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-10 12:22:46,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 12:22:48,604 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 12:22:48,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:48,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 12:22:48,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:48,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:48,674 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 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 12:22:48,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:48,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:48,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:48,717 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 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 12:22:48,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:48,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:48,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:48,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:48,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:48,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:48,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:22:48,764 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 12:22:48,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2022-11-10 12:22:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3808 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 3519 trivial. 0 not checked. [2022-11-10 12:22:48,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 12:22:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3808 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 3519 trivial. 0 not checked. [2022-11-10 12:22:56,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902105665] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 12:22:56,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 12:22:56,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 43 [2022-11-10 12:22:56,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586644624] [2022-11-10 12:22:56,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 12:22:56,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-10 12:22:56,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 12:22:56,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-10 12:22:56,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1702, Unknown=0, NotChecked=0, Total=1892 [2022-11-10 12:22:56,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:56,648 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 12:22:56,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 10.674418604651162) internal successors, (459), 44 states have internal predecessors, (459), 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 12:22:56,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:56,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:56,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:56,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:56,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:56,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:56,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 12:22:56,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 12:22:56,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 12:22:56,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-10 12:22:56,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:57,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:57,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:57,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:57,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:57,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:57,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:57,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 12:22:57,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 12:22:57,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 12:22:57,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-10 12:22:57,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 12:22:57,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-10 12:22:57,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 12:22:57,959 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting reader_fnErr5ASSERT_VIOLATIONDATA_RACE === [reader_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-10 12:22:57,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 12:22:57,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2048547261, now seen corresponding path program 1 times [2022-11-10 12:22:57,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 12:22:57,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084378627] [2022-11-10 12:22:57,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:22:57,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 12:22:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 12:22:58,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3809 backedges. 289 proven. 1 refuted. 0 times theorem prover too weak. 3519 trivial. 0 not checked. [2022-11-10 12:22:58,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 12:22:58,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084378627] [2022-11-10 12:22:58,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084378627] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 12:22:58,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288378931] [2022-11-10 12:22:58,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:22:58,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 12:22:58,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 12:22:58,306 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 12:22:58,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-10 12:22:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 12:22:58,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 1822 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-10 12:22:58,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 12:22:59,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3809 backedges. 289 proven. 1 refuted. 0 times theorem prover too weak. 3519 trivial. 0 not checked. [2022-11-10 12:22:59,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 12:22:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3809 backedges. 289 proven. 1 refuted. 0 times theorem prover too weak. 3519 trivial. 0 not checked. [2022-11-10 12:22:59,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288378931] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 12:22:59,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 12:22:59,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-10 12:22:59,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842261786] [2022-11-10 12:22:59,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 12:22:59,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-10 12:22:59,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 12:22:59,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-10 12:22:59,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-10 12:22:59,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:59,512 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 12:22:59,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 61.42857142857143) internal successors, (430), 7 states have internal predecessors, (430), 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 12:22:59,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:22:59,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:59,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:59,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:59,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:59,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:22:59,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 12:22:59,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 12:22:59,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 12:22:59,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-10 12:22:59,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 12:22:59,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:23:00,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:23:00,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 12:23:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 12:23:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 12:23:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-10 12:23:00,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-10 12:23:00,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-10 12:23:00,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-10 12:23:00,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 12:23:00,234 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reader_fnErr5ASSERT_VIOLATIONDATA_RACE === [reader_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-10 12:23:00,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 12:23:00,234 INFO L85 PathProgramCache]: Analyzing trace with hash 367553606, now seen corresponding path program 1 times [2022-11-10 12:23:00,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 12:23:00,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954853947] [2022-11-10 12:23:00,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:23:00,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 12:23:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 12:23:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 59 proven. 973 refuted. 0 times theorem prover too weak. 2790 trivial. 0 not checked. [2022-11-10 12:23:05,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 12:23:05,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954853947] [2022-11-10 12:23:05,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954853947] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 12:23:05,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646083743] [2022-11-10 12:23:05,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:23:05,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 12:23:05,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 12:23:05,417 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 12:23:05,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-10 12:23:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 12:23:05,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 1852 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-10 12:23:05,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 12:23:06,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-10 12:23:07,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 19 treesize of output 18 [2022-11-10 12:23:08,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:23:08,072 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 12:23:08,074 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 12:23:08,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 16 [2022-11-10 12:23:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 140 proven. 970 refuted. 0 times theorem prover too weak. 2712 trivial. 0 not checked. [2022-11-10 12:23:08,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 12:23:09,947 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 12:23:09,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 100 [2022-11-10 12:23:09,953 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 12:23:09,953 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 151 treesize of output 125 [2022-11-10 12:23:10,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 14 proven. 2414 refuted. 0 times theorem prover too weak. 1394 trivial. 0 not checked. [2022-11-10 12:23:10,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646083743] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 12:23:10,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 12:23:10,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 25] total 64 [2022-11-10 12:23:10,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640516831] [2022-11-10 12:23:10,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 12:23:10,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-10 12:23:10,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 12:23:10,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-10 12:23:10,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=3753, Unknown=0, NotChecked=0, Total=4032 [2022-11-10 12:23:10,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:23:10,683 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 12:23:10,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 8.125) internal successors, (520), 64 states have internal predecessors, (520), 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 12:23:10,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:23:10,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:10,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:10,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:10,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:10,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:10,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 12:23:10,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 12:23:10,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 12:23:10,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-10 12:23:10,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-10 12:23:10,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-10 12:23:10,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:23:13,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:23:13,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:13,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:13,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:13,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 12:23:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 12:23:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 12:23:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-10 12:23:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-10 12:23:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-10 12:23:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-10 12:23:13,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-10 12:23:13,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-10 12:23:13,661 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reader_fnErr1ASSERT_VIOLATIONDATA_RACE === [reader_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-10 12:23:13,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 12:23:13,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1839125196, now seen corresponding path program 1 times [2022-11-10 12:23:13,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 12:23:13,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943259322] [2022-11-10 12:23:13,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:23:13,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 12:23:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 12:23:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1062 backedges. 69 proven. 677 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-11-10 12:23:16,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 12:23:16,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943259322] [2022-11-10 12:23:16,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943259322] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 12:23:16,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130537258] [2022-11-10 12:23:16,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:23:16,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 12:23:16,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 12:23:16,666 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 12:23:16,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-10 12:23:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 12:23:16,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-10 12:23:17,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 12:23:17,008 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 12:23:17,013 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 12:23:17,014 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 12:23:17,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-10 12:23:17,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:23:17,118 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 12:23:17,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-10 12:23:19,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 12:23:19,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-11-10 12:23:19,603 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 12:23:19,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 23 treesize of output 22 [2022-11-10 12:23:19,710 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 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-10 12:23:19,765 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 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-10 12:23:19,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:23:19,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:23:19,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:23:19,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:23:19,858 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 12:23:19,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 60 [2022-11-10 12:23:19,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1062 backedges. 33 proven. 560 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2022-11-10 12:23:19,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 12:23:22,855 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3733 (Array Int Int))) (not (<= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_3733) |c_ULTIMATE.start_main_~#r~2#1.base|) (+ |c_ULTIMATE.start_main_~#r~2#1.offset| 20))))) is different from false [2022-11-10 12:23:22,977 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 12:23:22,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-11-10 12:23:22,987 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 12:23:22,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 55 [2022-11-10 12:23:22,991 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 18 [2022-11-10 12:23:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1062 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2022-11-10 12:23:23,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130537258] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 12:23:23,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 12:23:23,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 28, 24] total 80 [2022-11-10 12:23:23,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716200468] [2022-11-10 12:23:23,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 12:23:23,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-10 12:23:23,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 12:23:23,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-10 12:23:23,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=5967, Unknown=21, NotChecked=156, Total=6480 [2022-11-10 12:23:23,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:23:23,215 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 12:23:23,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 80 states have (on average 6.0875) internal successors, (487), 81 states have internal predecessors, (487), 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 12:23:23,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:23:23,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:23,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:23,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:23,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:23,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:23,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 12:23:23,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 12:23:23,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 12:23:23,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-10 12:23:23,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-10 12:23:23,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-10 12:23:23,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-10 12:23:23,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:23:31,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:23:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:23:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 12:23:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 12:23:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 12:23:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-10 12:23:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-10 12:23:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-10 12:23:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-10 12:23:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-10 12:23:31,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-10 12:23:31,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 12:23:31,212 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reader_fnErr1ASSERT_VIOLATIONDATA_RACE === [reader_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-10 12:23:31,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 12:23:31,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1954183760, now seen corresponding path program 1 times [2022-11-10 12:23:31,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 12:23:31,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75496677] [2022-11-10 12:23:31,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:23:31,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 12:23:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 12:23:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7332 backedges. 634 proven. 4995 refuted. 0 times theorem prover too weak. 1703 trivial. 0 not checked. [2022-11-10 12:23:42,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 12:23:42,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75496677] [2022-11-10 12:23:42,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75496677] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 12:23:42,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366786495] [2022-11-10 12:23:42,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:23:42,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 12:23:42,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 12:23:42,249 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 12:23:42,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-10 12:23:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 12:23:43,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 2160 conjuncts, 241 conjunts are in the unsatisfiable core [2022-11-10 12:23:43,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 12:23:43,261 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 12:23:43,268 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 12:23:43,268 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 12:23:43,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-10 12:23:43,369 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 19 treesize of output 18 [2022-11-10 12:23:43,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 21 treesize of output 21 [2022-11-10 12:23:49,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:23:49,633 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 12:23:49,646 INFO L356 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-11-10 12:23:49,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2022-11-10 12:23:54,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:23:54,518 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 12:23:54,523 INFO L356 Elim1Store]: treesize reduction 4, result has 42.9 percent of original size [2022-11-10 12:23:54,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 92 [2022-11-10 12:23:55,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 12:23:55,036 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 12:23:55,039 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 12:23:55,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 19 [2022-11-10 12:23:55,209 INFO L134 CoverageAnalysis]: Checked inductivity of 7332 backedges. 1893 proven. 4541 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2022-11-10 12:23:55,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 12:24:23,837 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4697 (Array Int Int)) (v_ArrVal_4699 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_4697) |c_ULTIMATE.start_main_~#r~2#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~#r~2#1.offset| 20))) (let ((.cse0 (select .cse1 .cse3))) (or (not (= .cse0 (select .cse1 |c_ULTIMATE.start_main_~#r~2#1.offset|))) (not (let ((.cse2 (store .cse1 (+ |c_ULTIMATE.start_main_~#r~2#1.offset| (* .cse0 4) 4) v_ArrVal_4699))) (= (mod (+ (select .cse2 .cse3) 1) 4) (select .cse2 |c_ULTIMATE.start_main_~#r~2#1.offset|)))))))) is different from false [2022-11-10 12:24:23,908 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4697 (Array Int Int)) (v_ArrVal_4699 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_init_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_init_~r#1.base|) |c_ULTIMATE.start_ring_init_~r#1.offset| 0)) |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_4697) |c_ULTIMATE.start_main_~#r~2#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~#r~2#1.offset| 20))) (let ((.cse0 (select .cse1 .cse3))) (or (not (= .cse0 (select .cse1 |c_ULTIMATE.start_main_~#r~2#1.offset|))) (not (let ((.cse2 (store .cse1 (+ |c_ULTIMATE.start_main_~#r~2#1.offset| (* .cse0 4) 4) v_ArrVal_4699))) (= (mod (+ (select .cse2 .cse3) 1) 4) (select .cse2 |c_ULTIMATE.start_main_~#r~2#1.offset|)))))))) is different from false [2022-11-10 12:24:23,958 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 12:24:23,958 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 2 case distinctions, treesize of input 157 treesize of output 97 [2022-11-10 12:24:23,966 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 12:24:23,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 139 [2022-11-10 12:24:23,974 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 12:24:23,974 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 197 treesize of output 155 [2022-11-10 12:24:24,019 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 12:24:24,019 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 15 treesize of output 9 [2022-11-10 12:24:24,039 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 12:24:24,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 157 treesize of output 145 [2022-11-10 12:24:24,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7332 backedges. 514 proven. 5609 refuted. 0 times theorem prover too weak. 1209 trivial. 0 not checked. [2022-11-10 12:24:24,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366786495] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 12:24:24,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 12:24:24,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 54, 37] total 132 [2022-11-10 12:24:24,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763495238] [2022-11-10 12:24:24,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 12:24:24,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2022-11-10 12:24:24,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 12:24:24,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2022-11-10 12:24:24,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=891, Invalid=15885, Unknown=2, NotChecked=514, Total=17292 [2022-11-10 12:24:24,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:24:24,603 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 12:24:24,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 6.5227272727272725) internal successors, (861), 132 states have internal predecessors, (861), 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 12:24:24,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:24:24,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:24:24,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:24:24,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:24:24,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:24:24,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:24:24,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 12:24:24,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 12:24:24,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 12:24:24,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-10 12:24:24,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-10 12:24:24,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-10 12:24:24,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-10 12:24:24,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-10 12:24:24,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:24:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 12:24:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:24:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:24:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:24:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:24:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 12:24:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 12:24:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 12:24:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 12:24:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-10 12:24:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-10 12:24:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-10 12:24:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-10 12:24:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-10 12:24:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-11-10 12:24:49,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-10 12:24:49,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 12:24:49,696 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting reader_fnErr5ASSERT_VIOLATIONDATA_RACE === [reader_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-10 12:24:49,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 12:24:49,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1461914024, now seen corresponding path program 2 times [2022-11-10 12:24:49,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 12:24:49,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223003006] [2022-11-10 12:24:49,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 12:24:49,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 12:24:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-10 12:24:50,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-10 12:24:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-10 12:24:51,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-10 12:24:51,898 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-10 12:24:51,899 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location reader_fnErr5ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2022-11-10 12:24:51,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location reader_fnErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2022-11-10 12:24:51,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location reader_fnErr6ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2022-11-10 12:24:51,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location reader_fnErr1ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2022-11-10 12:24:51,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location reader_fnErr7ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2022-11-10 12:24:51,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location reader_fnErr2ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2022-11-10 12:24:51,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location reader_fnErr3ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2022-11-10 12:24:51,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location reader_fnErr4ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2022-11-10 12:24:51,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-10 12:24:51,906 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-10 12:24:51,908 INFO L307 ceAbstractionStarter]: Result for error location reader_fnThread1of1ForFork0 was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2022-11-10 12:24:51,925 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-10 12:24:51,925 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-10 12:24:52,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:24:52 BasicIcfg [2022-11-10 12:24:52,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-10 12:24:52,218 INFO L158 Benchmark]: Toolchain (without parser) took 158301.66ms. Allocated memory was 213.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 184.0MB in the beginning and 1.0GB in the end (delta: -845.3MB). Peak memory consumption was 812.0MB. Max. memory is 8.0GB. [2022-11-10 12:24:52,219 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 213.9MB. Free memory was 173.6MB in the beginning and 173.5MB in the end (delta: 65.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-11-10 12:24:52,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.82ms. Allocated memory is still 213.9MB. Free memory was 183.6MB in the beginning and 169.3MB in the end (delta: 14.3MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. [2022-11-10 12:24:52,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.88ms. Allocated memory is still 213.9MB. Free memory was 169.3MB in the beginning and 165.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-11-10 12:24:52,219 INFO L158 Benchmark]: Boogie Preprocessor took 40.77ms. Allocated memory is still 213.9MB. Free memory was 165.6MB in the beginning and 162.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-11-10 12:24:52,219 INFO L158 Benchmark]: RCFGBuilder took 487.01ms. Allocated memory is still 213.9MB. Free memory was 162.2MB in the beginning and 134.4MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-11-10 12:24:52,219 INFO L158 Benchmark]: TraceAbstraction took 157380.12ms. Allocated memory was 213.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 133.9MB in the beginning and 1.0GB in the end (delta: -895.4MB). Peak memory consumption was 763.5MB. Max. memory is 8.0GB. [2022-11-10 12:24:52,221 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 213.9MB. Free memory was 173.6MB in the beginning and 173.5MB in the end (delta: 65.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 342.82ms. Allocated memory is still 213.9MB. Free memory was 183.6MB in the beginning and 169.3MB in the end (delta: 14.3MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.88ms. Allocated memory is still 213.9MB. Free memory was 169.3MB in the beginning and 165.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.77ms. Allocated memory is still 213.9MB. Free memory was 165.6MB in the beginning and 162.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 487.01ms. Allocated memory is still 213.9MB. Free memory was 162.2MB in the beginning and 134.4MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 157380.12ms. Allocated memory was 213.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 133.9MB in the beginning and 1.0GB in the end (delta: -895.4MB). Peak memory consumption was 763.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1765, positive: 1757, positive conditional: 22, positive unconditional: 1735, negative: 8, negative conditional: 3, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 1638, Positive cache size: 1633, Positive conditional cache size: 0, Positive unconditional cache size: 1633, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Independence queries for same thread: 3, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1792, positive: 1784, positive conditional: 22, positive unconditional: 1762, negative: 8, negative conditional: 3, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 2289, Positive cache size: 2279, Positive conditional cache size: 0, Positive unconditional cache size: 2279, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Independence queries for same thread: 6, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1991, positive: 1977, positive conditional: 29, positive unconditional: 1948, negative: 14, negative conditional: 4, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 3465, Positive cache size: 3445, Positive conditional cache size: 0, Positive unconditional cache size: 3445, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Independence queries for same thread: 10, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3461, positive: 3439, positive conditional: 57, positive unconditional: 3382, negative: 22, negative conditional: 7, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 4883, Positive cache size: 4858, Positive conditional cache size: 0, Positive unconditional cache size: 4858, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Independence queries for same thread: 17, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3676, positive: 3648, positive conditional: 64, positive unconditional: 3584, negative: 28, negative conditional: 8, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 5487, Positive cache size: 5452, Positive conditional cache size: 0, Positive unconditional cache size: 5452, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Independence queries for same thread: 25, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4420, positive: 4379, positive conditional: 82, positive unconditional: 4297, negative: 41, negative conditional: 10, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 6577, Positive cache size: 6526, Positive conditional cache size: 0, Positive unconditional cache size: 6526, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Independence queries for same thread: 35, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 7002, positive: 6948, positive conditional: 123, positive unconditional: 6825, negative: 54, negative conditional: 18, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 8290, Positive cache size: 8229, Positive conditional cache size: 0, Positive unconditional cache size: 8229, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, Independence queries for same thread: 49, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 7285, positive: 7232, positive conditional: 127, positive unconditional: 7105, negative: 53, negative conditional: 19, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 9152, Positive cache size: 9088, Positive conditional cache size: 0, Positive unconditional cache size: 9088, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, Independence queries for same thread: 64, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 8295, positive: 8208, positive conditional: 178, positive unconditional: 8030, negative: 87, negative conditional: 41, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 12410, Positive cache size: 12300, Positive conditional cache size: 0, Positive unconditional cache size: 12300, Negative cache size: 110, Negative conditional cache size: 0, Negative unconditional cache size: 110, Independence queries for same thread: 93, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 7514, positive: 7254, positive conditional: 255, positive unconditional: 6999, negative: 260, negative conditional: 127, negative unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 14703, Positive cache size: 14500, Positive conditional cache size: 0, Positive unconditional cache size: 14500, Negative cache size: 203, Negative conditional cache size: 0, Negative unconditional cache size: 203, Independence queries for same thread: 161, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 10892, positive: 10059, positive conditional: 578, positive unconditional: 9481, negative: 833, negative conditional: 428, negative unconditional: 405, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 16712, Positive cache size: 16306, Positive conditional cache size: 0, Positive unconditional cache size: 16306, Negative cache size: 406, Negative conditional cache size: 0, Negative unconditional cache size: 406, Independence queries for same thread: 350, Statistics for Abstraction: - StatisticsResult: Independence relation #12 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 12999, positive: 12133, positive conditional: 646, positive unconditional: 11487, negative: 866, negative conditional: 450, negative unconditional: 416, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 17268, Positive cache size: 16852, Positive conditional cache size: 0, Positive unconditional cache size: 16852, Negative cache size: 416, Negative conditional cache size: 0, Negative unconditional cache size: 416, Independence queries for same thread: 555, Statistics for Abstraction: - StatisticsResult: Independence relation #13 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 13120, positive: 12225, positive conditional: 701, positive unconditional: 11524, negative: 895, negative conditional: 473, negative unconditional: 422, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 17301, Positive cache size: 16885, Positive conditional cache size: 0, Positive unconditional cache size: 16885, Negative cache size: 416, Negative conditional cache size: 0, Negative unconditional cache size: 416, Independence queries for same thread: 775, Statistics for Abstraction: - StatisticsResult: Independence relation #14 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 7481, positive: 7155, positive conditional: 340, positive unconditional: 6815, negative: 326, negative conditional: 170, negative unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 17302, Positive cache size: 16885, Positive conditional cache size: 0, Positive unconditional cache size: 16885, Negative cache size: 417, Negative conditional cache size: 0, Negative unconditional cache size: 417, Independence queries for same thread: 859, Statistics for Abstraction: - StatisticsResult: Independence relation #15 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 9905, positive: 8926, positive conditional: 847, positive unconditional: 8079, negative: 979, negative conditional: 556, negative unconditional: 423, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 17405, Positive cache size: 16941, Positive conditional cache size: 0, Positive unconditional cache size: 16941, Negative cache size: 464, Negative conditional cache size: 0, Negative unconditional cache size: 464, Independence queries for same thread: 1141, Statistics for Abstraction: - StatisticsResult: Independence relation #16 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 13781, positive: 12685, positive conditional: 975, positive unconditional: 11710, negative: 1096, negative conditional: 613, negative unconditional: 483, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 18578, Positive cache size: 18105, Positive conditional cache size: 0, Positive unconditional cache size: 18105, Negative cache size: 473, Negative conditional cache size: 0, Negative unconditional cache size: 473, Independence queries for same thread: 1454, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 65, Number of trivial persistent sets: 51, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1765, positive: 1757, positive conditional: 22, positive unconditional: 1735, negative: 8, negative conditional: 3, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 1638, Positive cache size: 1633, Positive conditional cache size: 0, Positive unconditional cache size: 1633, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Independence queries for same thread: 3, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 65, Number of trivial persistent sets: 51, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1792, positive: 1784, positive conditional: 22, positive unconditional: 1762, negative: 8, negative conditional: 3, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 2289, Positive cache size: 2279, Positive conditional cache size: 0, Positive unconditional cache size: 2279, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Independence queries for same thread: 6, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 71, Number of trivial persistent sets: 56, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1991, positive: 1977, positive conditional: 29, positive unconditional: 1948, negative: 14, negative conditional: 4, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 3465, Positive cache size: 3445, Positive conditional cache size: 0, Positive unconditional cache size: 3445, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Independence queries for same thread: 10, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 90, Number of trivial persistent sets: 61, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 3461, positive: 3439, positive conditional: 57, positive unconditional: 3382, negative: 22, negative conditional: 7, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 4883, Positive cache size: 4858, Positive conditional cache size: 0, Positive unconditional cache size: 4858, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Independence queries for same thread: 17, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 96, Number of trivial persistent sets: 66, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 3676, positive: 3648, positive conditional: 64, positive unconditional: 3584, negative: 28, negative conditional: 8, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 5487, Positive cache size: 5452, Positive conditional cache size: 0, Positive unconditional cache size: 5452, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Independence queries for same thread: 25, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 112, Number of trivial persistent sets: 77, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 4420, positive: 4379, positive conditional: 82, positive unconditional: 4297, negative: 41, negative conditional: 10, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 6577, Positive cache size: 6526, Positive conditional cache size: 0, Positive unconditional cache size: 6526, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Independence queries for same thread: 35, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 137, Number of trivial persistent sets: 93, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 7002, positive: 6948, positive conditional: 123, positive unconditional: 6825, negative: 54, negative conditional: 18, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 8290, Positive cache size: 8229, Positive conditional cache size: 0, Positive unconditional cache size: 8229, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, Independence queries for same thread: 49, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 138, Number of trivial persistent sets: 94, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 7285, positive: 7232, positive conditional: 127, positive unconditional: 7105, negative: 53, negative conditional: 19, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 9152, Positive cache size: 9088, Positive conditional cache size: 0, Positive unconditional cache size: 9088, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, Independence queries for same thread: 64, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 181, Number of trivial persistent sets: 101, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 8295, positive: 8208, positive conditional: 178, positive unconditional: 8030, negative: 87, negative conditional: 41, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 12410, Positive cache size: 12300, Positive conditional cache size: 0, Positive unconditional cache size: 12300, Negative cache size: 110, Negative conditional cache size: 0, Negative unconditional cache size: 110, Independence queries for same thread: 93, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 295, Number of trivial persistent sets: 191, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 7514, positive: 7254, positive conditional: 255, positive unconditional: 6999, negative: 260, negative conditional: 127, negative unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 14703, Positive cache size: 14500, Positive conditional cache size: 0, Positive unconditional cache size: 14500, Negative cache size: 203, Negative conditional cache size: 0, Negative unconditional cache size: 203, Independence queries for same thread: 161, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 698, Number of trivial persistent sets: 419, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 10892, positive: 10059, positive conditional: 578, positive unconditional: 9481, negative: 833, negative conditional: 428, negative unconditional: 405, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 16712, Positive cache size: 16306, Positive conditional cache size: 0, Positive unconditional cache size: 16306, Negative cache size: 406, Negative conditional cache size: 0, Negative unconditional cache size: 406, Independence queries for same thread: 350, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 742, Number of trivial persistent sets: 436, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 12999, positive: 12133, positive conditional: 646, positive unconditional: 11487, negative: 866, negative conditional: 450, negative unconditional: 416, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 17268, Positive cache size: 16852, Positive conditional cache size: 0, Positive unconditional cache size: 16852, Negative cache size: 416, Negative conditional cache size: 0, Negative unconditional cache size: 416, Independence queries for same thread: 555, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 786, Number of trivial persistent sets: 444, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 13120, positive: 12225, positive conditional: 701, positive unconditional: 11524, negative: 895, negative conditional: 473, negative unconditional: 422, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 17301, Positive cache size: 16885, Positive conditional cache size: 0, Positive unconditional cache size: 16885, Negative cache size: 416, Negative conditional cache size: 0, Negative unconditional cache size: 416, Independence queries for same thread: 775, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 319, Number of trivial persistent sets: 201, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 7481, positive: 7155, positive conditional: 340, positive unconditional: 6815, negative: 326, negative conditional: 170, negative unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 17302, Positive cache size: 16885, Positive conditional cache size: 0, Positive unconditional cache size: 16885, Negative cache size: 417, Negative conditional cache size: 0, Negative unconditional cache size: 417, Independence queries for same thread: 859, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 711, Number of trivial persistent sets: 397, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 9905, positive: 8926, positive conditional: 847, positive unconditional: 8079, negative: 979, negative conditional: 556, negative unconditional: 423, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 17405, Positive cache size: 16941, Positive conditional cache size: 0, Positive unconditional cache size: 16941, Negative cache size: 464, Negative conditional cache size: 0, Negative unconditional cache size: 464, Independence queries for same thread: 1141, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 842, Number of trivial persistent sets: 444, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 13781, positive: 12685, positive conditional: 975, positive unconditional: 11710, negative: 1096, negative conditional: 613, negative unconditional: 483, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115379, positive: 109809, positive conditional: 5046, positive unconditional: 104763, negative: 5570, negative conditional: 2930, negative unconditional: 2640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113925, positive: 109809, positive conditional: 0, positive unconditional: 109809, negative: 4116, negative conditional: 0, negative unconditional: 4116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18578, positive: 18105, positive conditional: 0, positive unconditional: 18105, negative: 473, negative conditional: 0, negative unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 113925, positive: 91704, positive conditional: 0, positive unconditional: 91704, negative: 3643, negative conditional: 0, negative unconditional: 3643, unknown: 18578, unknown conditional: 0, unknown unconditional: 18578] , Statistics on independence cache: Total cache size (in pairs): 18578, Positive cache size: 18105, Positive conditional cache size: 0, Positive unconditional cache size: 18105, Negative cache size: 473, Negative conditional cache size: 0, Negative unconditional cache size: 473, Independence queries for same thread: 1454, Statistics for Abstraction: - DataRaceFoundResult [Line: 816]: Data race detected Data race detected The following path leads to a data race: [L851] 0 pthread_t reader; VAL [reader={9:0}] [L852] 0 Ring r; VAL [r={8:0}, reader={9:0}] [L853] CALL 0 ring_init( &r ) [L823] EXPR 0 r->writer = 0 VAL [r={8:0}, r={8:0}, r->writer = 0=115] [L823] 0 r->reader = r->writer = 0 VAL [r={8:0}, r={8:0}, r->reader = r->writer = 0=116, r->writer = 0=115] [L853] RET 0 ring_init( &r ) [L854] FCALL, FORK 0 pthread_create( &reader, ((void *)0), &reader_fn, &r ) VAL [pthread_create( &reader, ((void *)0), &reader_fn, &r )=-1, r={8:0}, reader={9:0}] [L826] 1 Ring *r = arg; VAL [arg={8:0}, arg={8:0}, r={8:0}] [L827] 1 long val = 0, last = 0, i = 0; VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L855] CALL 0 writer_fn( &r ) [L842] 0 Ring *r = arg; VAL [arg={8:0}, arg={8:0}, r={8:0}] [L843] 0 long i = 0; VAL [arg={8:0}, arg={8:0}, i=0, r={8:0}] [L843] COND TRUE 0 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, r={8:0}] [L845] CALL 0 ring_enqueue( r, i + 1 ) [L810] EXPR 0 r->writer VAL [\old(x)=1, r={8:0}, r={8:0}, r->writer=0, x=1] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=1, r={8:0}, r={8:0}, r->writer=0, x=1] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=1, r={8:0}, r={8:0}, r->writer=0, x=1] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=1, r={8:0}, r={8:0}, r->writer=0, x=1] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=1, r={8:0}, r={8:0}, r->writer=0, x=1] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=1, r={8:0}, r={8:0}, r->writer=0, x=1] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L810] EXPR 0 r->reader VAL [\old(x)=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0, x=1] [L810] 0 (r->writer + 1) % 4 == r->reader VAL [\old(x)=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0, x=1] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L810] 0 (r->writer + 1) % 4 == r->reader VAL [\old(x)=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0, x=1] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L810] 0 (r->writer + 1) % 4 == r->reader VAL [\old(x)=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0, x=1] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L810] 0 (r->writer + 1) % 4 == r->reader VAL [\old(x)=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0, x=1] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L810] 0 (r->writer + 1) % 4 == r->reader VAL [\old(x)=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0, x=1] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L810] COND FALSE 0 !((r->writer + 1) % 4 == r->reader) VAL [\old(x)=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0, x=1] [L811] EXPR 0 r->writer VAL [\old(x)=1, r={8:0}, r={8:0}, r->writer=0, x=1] [L811] EXPR 0 r->q[ r->writer ] VAL [\old(x)=1, r={8:0}, r={8:0}, r->writer=0, x=1] [L811] 0 r->q[ r->writer ] = x VAL [\old(x)=1, r={8:0}, r={8:0}, r->writer=0, x=1] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L811] 0 r->q[ r->writer ] = x VAL [\old(x)=1, r={8:0}, r={8:0}, r->q[ r->writer ] = x=0, r->writer=0, x=1] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L811] 0 r->q[ r->writer ] = x VAL [\old(x)=1, r={8:0}, r={8:0}, r->q[ r->writer ] = x=0, r->writer=0, x=1] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L811] 0 r->q[ r->writer ] = x VAL [\old(x)=1, r={8:0}, r={8:0}, r->q[ r->writer ] = x=0, r->writer=0, x=1] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L811] 0 r->q[ r->writer ] = x VAL [\old(x)=1, r={8:0}, r={8:0}, r->q[ r->writer ] = x=0, r->writer=0, x=1] [L812] EXPR 0 r->writer VAL [\old(x)=1, r={8:0}, r={8:0}, r->writer=0, x=1] [L812] EXPR 0 r->writer + 1 VAL [\old(x)=1, r={8:0}, r={8:0}, r->writer=0, x=1] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L812] EXPR 0 r->writer + 1 VAL [\old(x)=1, r={8:0}, r={8:0}, r->writer=0, x=1] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L812] EXPR 0 r->writer + 1 VAL [\old(x)=1, r={8:0}, r={8:0}, r->writer=0, x=1] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L812] EXPR 0 r->writer + 1 VAL [\old(x)=1, r={8:0}, r={8:0}, r->writer=0, x=1] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L812] EXPR 0 r->writer + 1 VAL [\old(x)=1, r={8:0}, r={8:0}, r->writer=0, x=1] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L812] 0 r->writer = (r->writer + 1) % 4 VAL [\old(x)=1, r={8:0}, r={8:0}, r->writer=0, r->writer = (r->writer + 1) % 4=0, x=1] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L820] 1 return r->reader == r->writer; VAL [\result=1, r={8:0}, r={8:0}, r->reader=0, r->writer=0] [L829] RET 1 ring_empty( r ) [L829] COND TRUE 1 ring_empty( r ) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=1, val=0] [L828] COND TRUE 1 i < 8 VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, val=0] [L829] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=1] [L820] EXPR 1 r->reader == r->writer VAL [r={8:0}, r={8:0}, r->reader=0, r->writer=1] [L820] 1 return r->reader == r->writer; VAL [\result=0, r={8:0}, r={8:0}, r->reader=0, r->writer=1] [L829] RET 1 ring_empty( r ) [L829] COND FALSE 1 !(ring_empty( r )) VAL [arg={8:0}, arg={8:0}, i=0, last=0, r={8:0}, ring_empty( r )=0, val=0] [L831] CALL 1 ring_dequeue( r ) [L815] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0] [L815] EXPR 1 r->q[ r->reader ] VAL [r={8:0}, r={8:0}, r->q[ r->reader ]=1, r->reader=0] [L815] 1 long x = r->q[ r->reader ]; VAL [r={8:0}, r={8:0}, r->q[ r->reader ]=1, r->reader=0, x=1] [L816] EXPR 1 r->reader VAL [r={8:0}, r={8:0}, r->reader=0, x=1] [L816] EXPR 1 r->reader + 1 VAL [r={8:0}, r={8:0}, r->reader=0, x=1] [L816] 1 r->reader = (r->reader + 1) % 4 VAL [r={8:0}, r={8:0}, r->reader=0, r->reader = (r->reader + 1) % 4=117, x=1] [L812] 0 r->writer = (r->writer + 1) % 4 VAL [\old(x)=1, r={8:0}, r={8:0}, r->writer=0, r->writer = (r->writer + 1) % 4=0, x=1] [L845] RET 0 ring_enqueue( r, i + 1 ) [L843] 0 ++i VAL [arg={8:0}, arg={8:0}, i=1, r={8:0}] [L843] COND TRUE 0 i < 8 VAL [arg={8:0}, arg={8:0}, i=1, r={8:0}] [L845] CALL 0 ring_enqueue( r, i + 1 ) [L810] EXPR 0 r->writer VAL [\old(x)=2, r={8:0}, r={8:0}, r->writer=1, x=2] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=2, r={8:0}, r={8:0}, r->writer=1, x=2] [L810] EXPR 0 r->reader VAL [\old(x)=2, r={8:0}, r={8:0}, r->reader=1, r->writer=1, x=2] [L810] 0 (r->writer + 1) % 4 == r->reader VAL [\old(x)=2, r={8:0}, r={8:0}, r->reader=1, r->writer=1, x=2] [L816] 1 r->reader = (r->reader + 1) % 4 VAL [r={8:0}, r={8:0}, r->reader=0, r->reader = (r->reader + 1) % 4=117, x=1] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: r->q[ r->reader ] [815] * C: r->reader == r->writer [820] * C: r->writer + 1 [812] * C: long x = r->q[ r->reader ]; [815] * C: r->writer + 1 [810] * C: r->writer = 0 [823] * C: r->writer = (r->writer + 1) % 4 [812] * C: r->writer = (r->writer + 1) % 4 [812] * C: r->q[ r->writer ] [811] * C: r->q[ r->reader ] [815] * C: r->writer + 1 [810] * C: r->reader = r->writer = 0 [823] * C: r->writer + 1 [812] * C: r->writer = 0 [823] * C: r->reader = r->writer = 0 [823] * C: r->reader + 1 [816] * C: r->writer + 1 [812] * C: r->q[ r->writer ] [811] * C: r->reader + 1 [816] * C: r->reader == r->writer [820] * C: long x = r->q[ r->reader ]; [815] * C: r->q[ r->writer ] [811] * C: r->writer = (r->writer + 1) % 4 [812] * C: r->q[ r->writer ] = x [811] * C: r->reader == r->writer [820] * C: r->q[ r->writer ] = x [811] * C: r->writer + 1 [810] * C: (r->writer + 1) % 4 == r->reader [810] * C: r->reader = r->writer = 0 [823] * C: (r->writer + 1) % 4 == r->reader [810] * C: r->reader == r->writer [820] * C: long x = r->q[ r->reader ]; [815] * C: r->writer = 0 [823] * C: r->q[ r->writer ] = x [811] * C: r->q[ r->writer ] = x [811] * C: r->q[ r->reader ] [815] * C: r->reader == r->writer [820] * C: r->writer + 1 [810] * C: r->reader + 1 [816] * C: r->reader = r->writer = 0 [823] * C: r->reader == r->writer [820] * C: (r->writer + 1) % 4 == r->reader [810] * C: r->writer = (r->writer + 1) % 4 [812] * C: r->q[ r->reader ] [815] * C: r->writer + 1 [812] * C: r->reader == r->writer [820] * C: r->reader == r->writer [820] * C: long x = r->q[ r->reader ]; [815] * C: r->q[ r->writer ] [811] * C: (r->writer + 1) % 4 == r->reader [810] * C: r->reader + 1 [816] * C: r->writer = 0 [823] and C: r->reader = (r->reader + 1) % 4 [816] - UnprovableResult [Line: 820]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: reader_fnThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 370 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 156.9s, OverallIterations: 16, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 47.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 287, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 100.4s InterpolantComputationTime, 7882 NumberOfCodeBlocks, 7882 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 10213 ConstructedInterpolants, 662 QuantifiedInterpolants, 387066 SizeOfPredicates, 267 NumberOfNonLiveVariables, 9378 ConjunctsInSsa, 642 ConjunctsInUnsatCore, 27 InterpolantComputations, 9 PerfectInterpolantSequences, 37951/60840 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-10 12:24:52,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-11-10 12:24:52,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...