./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version efd9311c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-1.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a956b76a4ba98ce13df4d83ef2fb7ffa0973225ecb152c14bcfbb55b6546601 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 17:05:16,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 17:05:16,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 17:05:16,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 17:05:16,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 17:05:16,212 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 17:05:16,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 17:05:16,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 17:05:16,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 17:05:16,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 17:05:16,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 17:05:16,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 17:05:16,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 17:05:16,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 17:05:16,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 17:05:16,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 17:05:16,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 17:05:16,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 17:05:16,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 17:05:16,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 17:05:16,226 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 17:05:16,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 17:05:16,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 17:05:16,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 17:05:16,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 17:05:16,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 17:05:16,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 17:05:16,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 17:05:16,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 17:05:16,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 17:05:16,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 17:05:16,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 17:05:16,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 17:05:16,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 17:05:16,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 17:05:16,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 17:05:16,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 17:05:16,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 17:05:16,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 17:05:16,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 17:05:16,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 17:05:16,236 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 17:05:16,237 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2022-04-18 17:05:16,265 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 17:05:16,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 17:05:16,268 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 17:05:16,268 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 17:05:16,269 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 17:05:16,269 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 17:05:16,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-18 17:05:16,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-18 17:05:16,270 INFO L138 SettingsManager]: * Use SBE=true [2022-04-18 17:05:16,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 17:05:16,271 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 17:05:16,271 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 17:05:16,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 17:05:16,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 17:05:16,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 17:05:16,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 17:05:16,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 17:05:16,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 17:05:16,272 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 17:05:16,272 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 17:05:16,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 17:05:16,272 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 17:05:16,273 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 17:05:16,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 17:05:16,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-18 17:05:16,273 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-18 17:05:16,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 17:05:16,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 17:05:16,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 17:05:16,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 17:05:16,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 17:05:16,274 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-18 17:05:16,275 INFO L138 SettingsManager]: * DFS Order used in POR=PSEUDO_LOCKSTEP [2022-04-18 17:05:16,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 17:05:16,276 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-18 17:05:16,276 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-04-18 17:05:16,276 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 17:05:16,276 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-04-18 17:05:16,276 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-04-18 17:05:16,277 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/UGemCutter-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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a956b76a4ba98ce13df4d83ef2fb7ffa0973225ecb152c14bcfbb55b6546601 [2022-04-18 17:05:16,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 17:05:16,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 17:05:16,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 17:05:16,529 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 17:05:16,534 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 17:05:16,535 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-1.i [2022-04-18 17:05:16,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5305a18f2/0b049583f0304ce5bc5ac322e382ead3/FLAGd9473d267 [2022-04-18 17:05:17,047 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 17:05:17,048 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-1.i [2022-04-18 17:05:17,080 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5305a18f2/0b049583f0304ce5bc5ac322e382ead3/FLAGd9473d267 [2022-04-18 17:05:17,407 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5305a18f2/0b049583f0304ce5bc5ac322e382ead3 [2022-04-18 17:05:17,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 17:05:17,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 17:05:17,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 17:05:17,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 17:05:17,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 17:05:17,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 05:05:17" (1/1) ... [2022-04-18 17:05:17,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@396f28d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:05:17, skipping insertion in model container [2022-04-18 17:05:17,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 05:05:17" (1/1) ... [2022-04-18 17:05:17,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 17:05:17,447 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 17:05:17,572 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-04-18 17:05:17,703 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-1.i[39095,39108] [2022-04-18 17:05:17,705 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-1.i[39180,39193] [2022-04-18 17:05:17,706 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-1.i[39232,39245] [2022-04-18 17:05:17,709 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-1.i[39641,39654] [2022-04-18 17:05:17,709 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-1.i[39726,39739] [2022-04-18 17:05:17,710 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-1.i[39778,39791] [2022-04-18 17:05:17,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 17:05:17,717 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 17:05:17,725 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-04-18 17:05:17,755 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-1.i[39095,39108] [2022-04-18 17:05:17,756 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-1.i[39180,39193] [2022-04-18 17:05:17,757 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-1.i[39232,39245] [2022-04-18 17:05:17,758 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-1.i[39641,39654] [2022-04-18 17:05:17,759 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-1.i[39726,39739] [2022-04-18 17:05:17,759 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-1.i[39778,39791] [2022-04-18 17:05:17,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 17:05:17,786 INFO L208 MainTranslator]: Completed translation [2022-04-18 17:05:17,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:05:17 WrapperNode [2022-04-18 17:05:17,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 17:05:17,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 17:05:17,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 17:05:17,788 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 17:05:17,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:05:17" (1/1) ... [2022-04-18 17:05:17,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:05:17" (1/1) ... [2022-04-18 17:05:17,842 INFO L137 Inliner]: procedures = 225, calls = 43, calls flagged for inlining = 10, calls inlined = 7, statements flattened = 198 [2022-04-18 17:05:17,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 17:05:17,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 17:05:17,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 17:05:17,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 17:05:17,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:05:17" (1/1) ... [2022-04-18 17:05:17,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:05:17" (1/1) ... [2022-04-18 17:05:17,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:05:17" (1/1) ... [2022-04-18 17:05:17,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:05:17" (1/1) ... [2022-04-18 17:05:17,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:05:17" (1/1) ... [2022-04-18 17:05:17,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:05:17" (1/1) ... [2022-04-18 17:05:17,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:05:17" (1/1) ... [2022-04-18 17:05:17,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 17:05:17,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 17:05:17,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 17:05:17,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 17:05:17,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:05:17" (1/1) ... [2022-04-18 17:05:17,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 17:05:17,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:05:17,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-18 17:05:18,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-18 17:05:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 17:05:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 17:05:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-18 17:05:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 17:05:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 17:05:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 17:05:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure reader_nowait_fn [2022-04-18 17:05:18,030 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_nowait_fn [2022-04-18 17:05:18,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 17:05:18,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 17:05:18,032 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-04-18 17:05:18,169 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 17:05:18,170 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 17:05:18,435 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 17:05:18,442 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 17:05:18,442 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-18 17:05:18,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 05:05:18 BoogieIcfgContainer [2022-04-18 17:05:18,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 17:05:18,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 17:05:18,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 17:05:18,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 17:05:18,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 05:05:17" (1/3) ... [2022-04-18 17:05:18,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255ced32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 05:05:18, skipping insertion in model container [2022-04-18 17:05:18,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:05:17" (2/3) ... [2022-04-18 17:05:18,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255ced32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 05:05:18, skipping insertion in model container [2022-04-18 17:05:18,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 05:05:18" (3/3) ... [2022-04-18 17:05:18,449 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_1w1r-1.i [2022-04-18 17:05:18,453 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 17:05:18,453 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 17:05:18,453 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2022-04-18 17:05:18,453 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 17:05:18,503 INFO L135 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-04-18 17:05:18,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-04-18 17:05:18,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:05:18,554 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-04-18 17:05:18,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-04-18 17:05:18,600 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_nowait_fnThread1of1ForFork0 ======== [2022-04-18 17:05:18,607 INFO L340 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 [2022-04-18 17:05:18,607 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-04-18 17:05:18,782 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-04-18 17:05:18,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:05:18,786 INFO L85 PathProgramCache]: Analyzing trace with hash 539498211, now seen corresponding path program 1 times [2022-04-18 17:05:18,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:05:18,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631344971] [2022-04-18 17:05:18,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:05:18,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:05:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:05:19,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:05:19,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:05:19,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631344971] [2022-04-18 17:05:19,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631344971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:05:19,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:05:19,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 17:05:19,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361099436] [2022-04-18 17:05:19,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:05:19,016 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-18 17:05:19,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:05:19,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-18 17:05:19,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 17:05:19,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:19,036 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:05:19,038 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 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-04-18 17:05:19,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:19,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:19,061 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 17:05:19,061 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-04-18 17:05:19,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:05:19,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1460993023, now seen corresponding path program 1 times [2022-04-18 17:05:19,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:05:19,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520390698] [2022-04-18 17:05:19,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:05:19,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:05:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:05:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:05:19,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:05:19,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520390698] [2022-04-18 17:05:19,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520390698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:05:19,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:05:19,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 17:05:19,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682785158] [2022-04-18 17:05:19,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:05:19,209 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 17:05:19,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:05:19,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 17:05:19,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 17:05:19,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:19,211 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:05:19,211 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-04-18 17:05:19,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:19,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:19,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:19,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:19,309 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-18 17:05:19,309 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-04-18 17:05:19,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:05:19,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1804256388, now seen corresponding path program 1 times [2022-04-18 17:05:19,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:05:19,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536529289] [2022-04-18 17:05:19,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:05:19,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:05:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:05:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:05:19,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:05:19,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536529289] [2022-04-18 17:05:19,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536529289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:05:19,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:05:19,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 17:05:19,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845547483] [2022-04-18 17:05:19,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:05:19,401 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 17:05:19,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:05:19,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 17:05:19,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 17:05:19,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:19,402 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:05:19,403 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-04-18 17:05:19,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:19,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:19,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:19,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:19,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:19,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:19,464 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-18 17:05:19,464 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-04-18 17:05:19,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:05:19,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1579335146, now seen corresponding path program 1 times [2022-04-18 17:05:19,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:05:19,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946187865] [2022-04-18 17:05:19,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:05:19,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:05:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:05:19,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:05:19,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:05:19,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946187865] [2022-04-18 17:05:19,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946187865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:05:19,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:05:19,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 17:05:19,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693425616] [2022-04-18 17:05:19,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:05:19,563 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 17:05:19,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:05:19,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 17:05:19,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 17:05:19,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:19,564 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:05:19,564 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 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-04-18 17:05:19,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:19,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:19,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:19,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:19,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:19,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:19,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:19,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:19,676 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-18 17:05:19,676 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-04-18 17:05:19,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:05:19,677 INFO L85 PathProgramCache]: Analyzing trace with hash -652206248, now seen corresponding path program 1 times [2022-04-18 17:05:19,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:05:19,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195498202] [2022-04-18 17:05:19,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:05:19,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:05:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:05:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:05:20,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:05:20,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195498202] [2022-04-18 17:05:20,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195498202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:05:20,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:05:20,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-18 17:05:20,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952078761] [2022-04-18 17:05:20,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:05:20,149 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-18 17:05:20,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:05:20,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-18 17:05:20,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-04-18 17:05:20,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:20,150 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:05:20,151 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.294117647058823) internal successors, (90), 18 states have internal predecessors, (90), 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-04-18 17:05:20,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:20,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:20,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:20,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:20,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:20,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:20,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:20,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:20,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:20,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-18 17:05:20,803 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-18 17:05:20,803 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting reader_nowait_fnErr3ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-04-18 17:05:20,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:05:20,804 INFO L85 PathProgramCache]: Analyzing trace with hash 593482407, now seen corresponding path program 1 times [2022-04-18 17:05:20,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:05:20,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893750364] [2022-04-18 17:05:20,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:05:20,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:05:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:05:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:05:20,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:05:20,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893750364] [2022-04-18 17:05:20,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893750364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:05:20,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:05:20,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 17:05:20,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577062301] [2022-04-18 17:05:20,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:05:20,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 17:05:20,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:05:20,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 17:05:20,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 17:05:20,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:20,921 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:05:20,921 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 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-04-18 17:05:20,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:20,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:20,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:20,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:20,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-04-18 17:05:20,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:21,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:21,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:21,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:21,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:21,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-18 17:05:21,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:21,006 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-18 17:05:21,007 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-04-18 17:05:21,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:05:21,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1597237657, now seen corresponding path program 1 times [2022-04-18 17:05:21,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:05:21,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765576356] [2022-04-18 17:05:21,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:05:21,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:05:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:05:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:05:21,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:05:21,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765576356] [2022-04-18 17:05:21,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765576356] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:05:21,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686627480] [2022-04-18 17:05:21,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:05:21,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:05:21,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:05:21,139 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:05:21,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-18 17:05:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:05:21,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-18 17:05:21,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:05:21,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:05:21,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:05:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:05:21,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686627480] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:05:21,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:05:21,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2022-04-18 17:05:21,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923488381] [2022-04-18 17:05:21,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:05:21,735 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 17:05:21,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:05:21,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 17:05:21,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-18 17:05:21,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:21,736 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:05:21,736 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 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-04-18 17:05:21,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:21,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:21,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:21,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:21,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-04-18 17:05:21,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:21,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:21,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:21,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:21,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:21,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:21,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:21,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:21,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-18 17:05:21,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-18 17:05:22,091 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-04-18 17:05:22,092 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-04-18 17:05:22,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:05:22,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1946810025, now seen corresponding path program 1 times [2022-04-18 17:05:22,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:05:22,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323935918] [2022-04-18 17:05:22,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:05:22,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:05:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:05:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-18 17:05:22,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:05:22,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323935918] [2022-04-18 17:05:22,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323935918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:05:22,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:05:22,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 17:05:22,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959757560] [2022-04-18 17:05:22,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:05:22,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 17:05:22,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:05:22,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 17:05:22,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 17:05:22,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:22,193 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:05:22,193 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 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-04-18 17:05:22,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:22,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:22,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:22,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:22,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:22,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:22,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-04-18 17:05:22,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:22,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:22,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:22,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:22,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:22,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:22,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:22,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-18 17:05:22,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:22,342 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-18 17:05:22,342 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-04-18 17:05:22,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:05:22,343 INFO L85 PathProgramCache]: Analyzing trace with hash 379622983, now seen corresponding path program 2 times [2022-04-18 17:05:22,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:05:22,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909263611] [2022-04-18 17:05:22,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:05:22,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:05:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:05:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:05:22,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:05:22,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909263611] [2022-04-18 17:05:22,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909263611] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:05:22,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502838161] [2022-04-18 17:05:22,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-18 17:05:22,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:05:22,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:05:22,603 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:05:22,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-18 17:05:22,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-18 17:05:22,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 17:05:22,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-18 17:05:22,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:05:22,993 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-04-18 17:05:23,018 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-18 17:05:23,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-04-18 17:05:23,046 INFO L356 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-04-18 17:05:23,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2022-04-18 17:05:23,085 INFO L356 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-04-18 17:05:23,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2022-04-18 17:05:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-18 17:05:23,106 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 17:05:23,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502838161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:05:23,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-18 17:05:23,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2022-04-18 17:05:23,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908891570] [2022-04-18 17:05:23,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:05:23,109 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 17:05:23,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:05:23,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 17:05:23,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-04-18 17:05:23,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:23,110 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:05:23,110 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.4) internal successors, (132), 6 states have internal predecessors, (132), 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-04-18 17:05:23,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:23,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:23,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:23,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:23,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:23,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:23,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-04-18 17:05:23,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:23,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:23,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:23,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:23,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-18 17:05:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:23,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-18 17:05:23,441 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:05:23,441 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting reader_nowait_fnErr5ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-04-18 17:05:23,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:05:23,445 INFO L85 PathProgramCache]: Analyzing trace with hash 983402703, now seen corresponding path program 1 times [2022-04-18 17:05:23,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:05:23,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406705849] [2022-04-18 17:05:23,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:05:23,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:05:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:05:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:05:23,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:05:23,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406705849] [2022-04-18 17:05:23,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406705849] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:05:23,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873973958] [2022-04-18 17:05:23,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:05:23,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:05:23,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:05:23,676 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:05:23,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-18 17:05:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:05:23,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-18 17:05:23,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:05:24,238 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:05:24,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:05:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:05:24,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873973958] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:05:24,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:05:24,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 25 [2022-04-18 17:05:24,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651165348] [2022-04-18 17:05:24,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:05:24,533 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-18 17:05:24,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:05:24,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-18 17:05:24,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2022-04-18 17:05:24,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:24,535 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:05:24,535 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 19.04) internal successors, (476), 25 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-04-18 17:05:24,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:24,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:24,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:24,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:24,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:24,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:24,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-04-18 17:05:24,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:24,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:24,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:24,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:24,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:24,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:24,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:24,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:24,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:24,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-18 17:05:24,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:24,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:24,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-18 17:05:24,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-18 17:05:25,083 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:05:25,084 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting reader_nowait_fnErr5ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-04-18 17:05:25,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:05:25,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1626316943, now seen corresponding path program 2 times [2022-04-18 17:05:25,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:05:25,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398460249] [2022-04-18 17:05:25,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:05:25,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:05:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:05:25,532 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 0 proven. 994 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:05:25,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:05:25,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398460249] [2022-04-18 17:05:25,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398460249] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:05:25,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927810873] [2022-04-18 17:05:25,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-18 17:05:25,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:05:25,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:05:25,540 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:05:25,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-18 17:05:25,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-18 17:05:25,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 17:05:25,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-18 17:05:25,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:05:26,308 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-04-18 17:05:26,329 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-18 17:05:26,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-18 17:05:26,364 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-04-18 17:05:26,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-04-18 17:05:26,420 INFO L356 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-04-18 17:05:26,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2022-04-18 17:05:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2022-04-18 17:05:26,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 17:05:26,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927810873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:05:26,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-18 17:05:26,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [29] total 33 [2022-04-18 17:05:26,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117142890] [2022-04-18 17:05:26,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:05:26,442 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 17:05:26,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:05:26,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 17:05:26,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=827, Unknown=0, NotChecked=0, Total=1056 [2022-04-18 17:05:26,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:26,443 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:05:26,443 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.6) internal successors, (138), 6 states have internal predecessors, (138), 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-04-18 17:05:26,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:26,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:26,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:26,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:26,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:26,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:26,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-04-18 17:05:26,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:26,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:26,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-04-18 17:05:26,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:26,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:26,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:26,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:26,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:26,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:26,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:26,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-18 17:05:26,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:26,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:26,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-18 17:05:26,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:26,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-18 17:05:26,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-18 17:05:26,995 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting reader_nowait_fnErr3ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-04-18 17:05:26,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:05:26,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1893637194, now seen corresponding path program 1 times [2022-04-18 17:05:26,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:05:26,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703949762] [2022-04-18 17:05:26,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:05:26,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:05:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:05:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:05:27,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:05:27,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703949762] [2022-04-18 17:05:27,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703949762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:05:27,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:05:27,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-18 17:05:27,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675453679] [2022-04-18 17:05:27,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:05:27,302 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-18 17:05:27,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:05:27,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-18 17:05:27,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-04-18 17:05:27,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:27,303 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:05:27,303 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.722222222222222) internal successors, (121), 18 states have internal predecessors, (121), 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-04-18 17:05:27,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:27,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:27,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:27,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:27,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:27,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:27,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-04-18 17:05:27,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:27,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:27,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-04-18 17:05:27,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:27,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:27,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-18 17:05:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:27,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-18 17:05:27,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:27,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-18 17:05:27,814 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-18 17:05:27,814 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting reader_nowait_fnErr3ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-04-18 17:05:27,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:05:27,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1303592158, now seen corresponding path program 1 times [2022-04-18 17:05:27,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:05:27,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991242791] [2022-04-18 17:05:27,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:05:27,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:05:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:05:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:05:28,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:05:28,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991242791] [2022-04-18 17:05:28,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991242791] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:05:28,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:05:28,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-18 17:05:28,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144040025] [2022-04-18 17:05:28,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:05:28,113 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-18 17:05:28,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:05:28,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-18 17:05:28,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-04-18 17:05:28,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:28,113 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:05:28,113 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 7.235294117647059) internal successors, (123), 18 states have internal predecessors, (123), 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-04-18 17:05:28,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-04-18 17:05:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-04-18 17:05:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-04-18 17:05:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:29,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:29,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:29,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:29,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:29,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:29,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:29,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-18 17:05:29,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:29,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:29,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-18 17:05:29,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:29,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-18 17:05:29,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:29,623 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-18 17:05:29,623 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting reader_nowait_fnErr3ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-04-18 17:05:29,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:05:29,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1420219332, now seen corresponding path program 1 times [2022-04-18 17:05:29,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:05:29,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409551076] [2022-04-18 17:05:29,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:05:29,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:05:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:05:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 17:05:29,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:05:29,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409551076] [2022-04-18 17:05:29,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409551076] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:05:29,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980752912] [2022-04-18 17:05:29,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:05:29,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:05:29,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:05:29,757 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:05:29,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-18 17:05:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:05:29,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-18 17:05:29,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:05:30,180 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 17:05:30,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:05:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-18 17:05:30,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980752912] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:05:30,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:05:30,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-04-18 17:05:30,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527493539] [2022-04-18 17:05:30,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:05:30,414 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-18 17:05:30,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:05:30,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-18 17:05:30,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-04-18 17:05:30,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:30,415 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:05:30,415 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 58.42857142857143) internal successors, (409), 7 states have internal predecessors, (409), 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-04-18 17:05:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:30,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:30,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-04-18 17:05:30,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:30,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:30,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-04-18 17:05:30,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:30,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-04-18 17:05:30,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:30,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:30,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-18 17:05:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-18 17:05:30,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:30,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-18 17:05:30,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:30,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-18 17:05:30,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-18 17:05:31,062 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-18 17:05:31,063 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-04-18 17:05:31,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:05:31,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1379690891, now seen corresponding path program 1 times [2022-04-18 17:05:31,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:05:31,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550559159] [2022-04-18 17:05:31,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:05:31,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:05:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:05:31,652 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 14 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:05:31,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:05:31,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550559159] [2022-04-18 17:05:31,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550559159] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:05:31,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098371077] [2022-04-18 17:05:31,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:05:31,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:05:31,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:05:31,654 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:05:31,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-18 17:05:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:05:31,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-18 17:05:31,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:05:33,040 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-04-18 17:05:33,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-04-18 17:05:33,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-04-18 17:05:33,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,130 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-04-18 17:05:33,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,144 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-04-18 17:05:33,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,178 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-04-18 17:05:33,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,198 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-04-18 17:05:33,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:05:33,246 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 17:05:33,246 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 46 treesize of output 54 [2022-04-18 17:05:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 3 proven. 105 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-18 17:05:33,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:05:34,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 17:05:34,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 17:05:34,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 17:05:34,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 17:05:34,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 17:05:34,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 17:05:34,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 17:05:34,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 17:05:34,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 17:05:38,676 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-18 17:05:38,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098371077] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:05:38,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:05:38,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 16] total 36 [2022-04-18 17:05:38,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015820183] [2022-04-18 17:05:38,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:05:38,678 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-18 17:05:38,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:05:38,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-18 17:05:38,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1201, Unknown=0, NotChecked=0, Total=1332 [2022-04-18 17:05:38,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:38,678 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:05:38,679 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 15.333333333333334) internal successors, (552), 37 states have internal predecessors, (552), 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-04-18 17:05:38,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:38,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:38,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:38,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:38,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:38,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:38,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-04-18 17:05:38,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:38,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:38,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-04-18 17:05:38,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:38,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-04-18 17:05:38,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:38,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-04-18 17:05:38,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:40,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:05:40,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:40,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:05:40,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:40,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:40,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:40,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-18 17:05:40,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:40,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:40,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-18 17:05:40,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:05:40,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-18 17:05:40,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-18 17:05:40,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-18 17:05:40,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-18 17:05:40,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-18 17:05:40,685 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-18 17:05:40,685 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting reader_nowait_fnErr3ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-04-18 17:05:40,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:05:40,685 INFO L85 PathProgramCache]: Analyzing trace with hash 21278592, now seen corresponding path program 1 times [2022-04-18 17:05:40,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:05:40,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097602710] [2022-04-18 17:05:40,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:05:40,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:05:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 17:05:40,971 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-18 17:05:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 17:05:41,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-18 17:05:41,160 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-18 17:05:41,160 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location reader_nowait_fnErr3ASSERT_VIOLATIONDATA_RACE (5 of 6 remaining) [2022-04-18 17:05:41,161 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location reader_nowait_fnErr0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2022-04-18 17:05:41,162 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2022-04-18 17:05:41,162 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2022-04-18 17:05:41,162 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location reader_nowait_fnErr5ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2022-04-18 17:05:41,162 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location reader_nowait_fnErr2ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2022-04-18 17:05:41,162 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-18 17:05:41,166 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 17:05:41,167 INFO L306 ceAbstractionStarter]: Result for error location reader_nowait_fnThread1of1ForFork0 was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2022-04-18 17:05:41,170 INFO L227 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-04-18 17:05:41,170 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-18 17:05:41,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 05:05:41 BasicIcfg [2022-04-18 17:05:41,283 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-18 17:05:41,313 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-04-18 17:05:41,313 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-04-18 17:05:41,314 INFO L275 PluginConnector]: Witness Printer initialized [2022-04-18 17:05:41,314 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 05:05:18" (3/4) ... [2022-04-18 17:05:41,316 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-04-18 17:05:41,316 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-04-18 17:05:41,316 INFO L158 Benchmark]: Toolchain (without parser) took 23907.01ms. Allocated memory was 109.1MB in the beginning and 434.1MB in the end (delta: 325.1MB). Free memory was 69.8MB in the beginning and 366.6MB in the end (delta: -296.7MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2022-04-18 17:05:41,317 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory was 87.7MB in the beginning and 87.6MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 17:05:41,317 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.60ms. Allocated memory is still 109.1MB. Free memory was 69.7MB in the beginning and 67.1MB in the end (delta: 2.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-04-18 17:05:41,317 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.90ms. Allocated memory is still 109.1MB. Free memory was 67.1MB in the beginning and 63.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-04-18 17:05:41,317 INFO L158 Benchmark]: Boogie Preprocessor took 68.91ms. Allocated memory is still 109.1MB. Free memory was 63.7MB in the beginning and 60.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-04-18 17:05:41,317 INFO L158 Benchmark]: RCFGBuilder took 531.58ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 60.8MB in the beginning and 110.1MB in the end (delta: -49.3MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2022-04-18 17:05:41,318 INFO L158 Benchmark]: TraceAbstraction took 22838.48ms. Allocated memory was 142.6MB in the beginning and 434.1MB in the end (delta: 291.5MB). Free memory was 110.1MB in the beginning and 124.5MB in the end (delta: -14.3MB). Peak memory consumption was 277.0MB. Max. memory is 16.1GB. [2022-04-18 17:05:41,318 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 434.1MB. Free memory was 366.6MB in the beginning and 366.6MB in the end (delta: 2.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 17:05:41,319 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.16ms. Allocated memory is still 109.1MB. Free memory was 87.7MB in the beginning and 87.6MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.60ms. Allocated memory is still 109.1MB. Free memory was 69.7MB in the beginning and 67.1MB in the end (delta: 2.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.90ms. Allocated memory is still 109.1MB. Free memory was 67.1MB in the beginning and 63.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.91ms. Allocated memory is still 109.1MB. Free memory was 63.7MB in the beginning and 60.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 531.58ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 60.8MB in the beginning and 110.1MB in the end (delta: -49.3MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * TraceAbstraction took 22838.48ms. Allocated memory was 142.6MB in the beginning and 434.1MB in the end (delta: 291.5MB). Free memory was 110.1MB in the beginning and 124.5MB in the end (delta: -14.3MB). Peak memory consumption was 277.0MB. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 434.1MB. Free memory was 366.6MB in the beginning and 366.6MB in the end (delta: 2.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 15055, positive: 13337, positive conditional: 2301, positive unconditional: 11036, negative: 1718, negative conditional: 1501, negative unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13707, positive: 13337, positive conditional: 2301, positive unconditional: 11036, negative: 370, negative conditional: 153, negative unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13707, positive: 13337, positive conditional: 2301, positive unconditional: 11036, negative: 370, negative conditional: 153, negative unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14821, positive: 13337, positive conditional: 2179, positive unconditional: 11158, negative: 1484, negative conditional: 1114, negative unconditional: 370, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14821, positive: 13337, positive conditional: 1104, positive unconditional: 12233, negative: 1484, negative conditional: 712, negative unconditional: 772, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14821, positive: 13337, positive conditional: 1104, positive unconditional: 12233, negative: 1484, negative conditional: 712, negative unconditional: 772, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8370, positive: 7937, positive conditional: 72, positive unconditional: 7865, negative: 433, negative conditional: 204, negative unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8370, positive: 7578, positive conditional: 0, positive unconditional: 7578, negative: 792, negative conditional: 0, negative unconditional: 792, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 792, positive: 359, positive conditional: 72, positive unconditional: 287, negative: 433, negative conditional: 204, negative unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1110, positive: 500, positive conditional: 149, positive unconditional: 351, negative: 609, negative conditional: 337, negative unconditional: 272, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14821, positive: 5400, positive conditional: 1032, positive unconditional: 4368, negative: 1051, negative conditional: 508, negative unconditional: 543, unknown: 8370, unknown conditional: 276, unknown unconditional: 8094] , Statistics on independence cache: Total cache size (in pairs): 8370, Positive cache size: 7937, Positive conditional cache size: 72, Positive unconditional cache size: 7865, Negative cache size: 433, Negative conditional cache size: 204, Negative unconditional cache size: 229, Eliminated conditions: 1477, Maximal queried relation: 9, Independence queries for same thread: 1348 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.7s, Number of persistent set computation: 928, Number of trivial persistent sets: 848, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11253, positive: 11036, positive conditional: 0, positive unconditional: 11036, negative: 217, negative conditional: 0, negative unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 15055, positive: 13337, positive conditional: 2301, positive unconditional: 11036, negative: 1718, negative conditional: 1501, negative unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13707, positive: 13337, positive conditional: 2301, positive unconditional: 11036, negative: 370, negative conditional: 153, negative unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13707, positive: 13337, positive conditional: 2301, positive unconditional: 11036, negative: 370, negative conditional: 153, negative unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14821, positive: 13337, positive conditional: 2179, positive unconditional: 11158, negative: 1484, negative conditional: 1114, negative unconditional: 370, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14821, positive: 13337, positive conditional: 1104, positive unconditional: 12233, negative: 1484, negative conditional: 712, negative unconditional: 772, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14821, positive: 13337, positive conditional: 1104, positive unconditional: 12233, negative: 1484, negative conditional: 712, negative unconditional: 772, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8370, positive: 7937, positive conditional: 72, positive unconditional: 7865, negative: 433, negative conditional: 204, negative unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8370, positive: 7578, positive conditional: 0, positive unconditional: 7578, negative: 792, negative conditional: 0, negative unconditional: 792, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 792, positive: 359, positive conditional: 72, positive unconditional: 287, negative: 433, negative conditional: 204, negative unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1110, positive: 500, positive conditional: 149, positive unconditional: 351, negative: 609, negative conditional: 337, negative unconditional: 272, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14821, positive: 5400, positive conditional: 1032, positive unconditional: 4368, negative: 1051, negative conditional: 508, negative unconditional: 543, unknown: 8370, unknown conditional: 276, unknown unconditional: 8094] , Statistics on independence cache: Total cache size (in pairs): 8370, Positive cache size: 7937, Positive conditional cache size: 72, Positive unconditional cache size: 7865, Negative cache size: 433, Negative conditional cache size: 204, Negative unconditional cache size: 229, Eliminated conditions: 1477, Maximal queried relation: 9, Independence queries for same thread: 1348 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 816]: Data race detected Data race detected The following path leads to a data race: [L864] 0 pthread_t reader; VAL [reader={17:0}] [L865] 0 Ring r; VAL [r={16:0}, reader={17:0}] [L866] CALL 0 ring_init( &r ) [L823] EXPR 0 r->writer = 0 VAL [r={16:0}, r={16:0}, r->writer = 0=116] [L823] 0 r->reader = r->writer = 0 VAL [r={16:0}, r={16:0}, r->reader = r->writer = 0=117, r->writer = 0=116] [L866] RET 0 ring_init( &r ) [L867] FCALL, FORK 0 pthread_create( &reader, ((void *)0), &reader_nowait_fn, &r ) VAL [pthread_create( &reader, ((void *)0), &reader_nowait_fn, &r )=-2, r={16:0}, reader={17:0}] [L851] 1 Ring *r = arg; VAL [arg={16:0}, arg={16:0}, r={16:0}] [L852] 1 long val = 0, last = 0, i = 0; VAL [arg={16:0}, arg={16:0}, r={16:0}, val=0] [L868] CALL 0 writer_fn( &r ) [L852] 1 long val = 0, last = 0, i = 0; VAL [arg={16:0}, arg={16:0}, i=0, last=0, r={16:0}, val=0] [L853] COND TRUE 1 i < 8 VAL [arg={16:0}, arg={16:0}, i=0, last=0, r={16:0}, val=0] [L854] CALL, EXPR 1 ring_dequeue( r ) [L842] 0 Ring *r = arg; VAL [arg={16:0}, arg={16:0}, r={16:0}] [L843] 0 long i = 0; VAL [arg={16:0}, arg={16:0}, i=0, r={16:0}] [L843] COND TRUE 0 i < 8 VAL [arg={16:0}, arg={16:0}, i=0, r={16:0}] [L845] CALL 0 ring_enqueue( r, i + 1 ) [L815] EXPR 1 r->reader VAL [r={16:0}, r={16:0}, r->reader=0] [L815] EXPR 1 r->q[ r->reader ] VAL [r={16:0}, r={16:0}, r->reader=0] [L815] EXPR 1 r->q[ r->reader ] VAL [r={16:0}, r={16:0}, r->reader=0] [L815] EXPR 1 r->q[ r->reader ] VAL [r={16:0}, r={16:0}, r->reader=0] [L810] EXPR 0 r->writer VAL [\old(x)=1, r={16:0}, r={16:0}, r->writer=0, x=1] [L815] EXPR 1 r->q[ r->reader ] VAL [r={16:0}, r={16:0}, r->reader=0] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=1, r={16:0}, r={16:0}, r->writer=0, x=1] [L815] EXPR 1 r->q[ r->reader ] VAL [r={16:0}, r={16:0}, r->q[ r->reader ]=1, r->reader=0] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=1, r={16:0}, r={16:0}, r->writer=0, x=1] [L815] 1 long x = r->q[ r->reader ]; VAL [r={16:0}, r={16:0}, r->q[ r->reader ]=1, r->reader=0] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=1, r={16:0}, r={16:0}, r->writer=0, x=1] [L815] 1 long x = r->q[ r->reader ]; VAL [r={16:0}, r={16:0}, r->q[ r->reader ]=1, r->reader=0] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=1, r={16:0}, r={16:0}, r->writer=0, x=1] [L815] 1 long x = r->q[ r->reader ]; VAL [r={16:0}, r={16:0}, r->q[ r->reader ]=1, r->reader=0] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=1, r={16:0}, r={16:0}, r->writer=0, x=1] [L815] 1 long x = r->q[ r->reader ]; VAL [r={16:0}, r={16:0}, r->q[ r->reader ]=1, r->reader=0] [L810] EXPR 0 r->reader VAL [\old(x)=1, r={16:0}, r={16:0}, r->reader=0, r->writer=0, x=1] [L815] 1 long x = r->q[ r->reader ]; VAL [r={16:0}, r={16:0}, r->q[ r->reader ]=1, r->reader=0] [L810] 0 (r->writer + 1) % 4 == r->reader VAL [\old(x)=1, r={16:0}, r={16:0}, r->reader=0, r->writer=0, x=1] [L815] 1 long x = r->q[ r->reader ]; VAL [r={16:0}, r={16:0}, r->q[ r->reader ]=1, r->reader=0, x=1] [L810] 0 (r->writer + 1) % 4 == r->reader VAL [\old(x)=1, r={16:0}, r={16:0}, r->reader=0, r->writer=0, x=1] [L810] 0 (r->writer + 1) % 4 == r->reader VAL [\old(x)=1, r={16:0}, r={16:0}, r->reader=0, r->writer=0, x=1] [L810] 0 (r->writer + 1) % 4 == r->reader VAL [\old(x)=1, r={16:0}, r={16:0}, r->reader=0, r->writer=0, x=1] [L816] EXPR 1 r->reader VAL [r={16:0}, r={16:0}, r->reader=0, x=1] [L810] 0 (r->writer + 1) % 4 == r->reader VAL [\old(x)=1, r={16:0}, r={16:0}, r->reader=0, r->writer=0, x=1] [L816] EXPR 1 r->reader + 1 VAL [r={16:0}, r={16:0}, r->reader=0, x=1] [L810] COND FALSE 0 !((r->writer + 1) % 4 == r->reader) VAL [\old(x)=1, r={16:0}, r={16:0}, r->reader=0, r->writer=0, x=1] [L816] EXPR 1 r->reader + 1 VAL [r={16:0}, r={16:0}, r->reader=0, x=1] [L816] EXPR 1 r->reader + 1 VAL [r={16:0}, r={16:0}, r->reader=0, x=1] [L816] EXPR 1 r->reader + 1 VAL [r={16:0}, r={16:0}, r->reader=0, x=1] [L811] EXPR 0 r->writer VAL [\old(x)=1, r={16:0}, r={16:0}, r->writer=0, x=1] [L816] EXPR 1 r->reader + 1 VAL [r={16:0}, r={16:0}, r->reader=0, x=1] [L811] EXPR 0 r->q[ r->writer ] VAL [\old(x)=1, r={16:0}, r={16:0}, r->writer=0, x=1] [L816] 1 r->reader = (r->reader + 1) % 4 VAL [r={16:0}, r={16:0}, r->reader=0, x=1] [L811] EXPR 0 r->q[ r->writer ] VAL [\old(x)=1, r={16:0}, r={16:0}, r->writer=0, x=1] [L811] EXPR 0 r->q[ r->writer ] VAL [\old(x)=1, r={16:0}, r={16:0}, r->writer=0, x=1] [L816] 1 r->reader = (r->reader + 1) % 4 VAL [r={16:0}, r={16:0}, r->reader=0, r->reader = (r->reader + 1) % 4=121, x=1] [L811] EXPR 0 r->q[ r->writer ] VAL [\old(x)=1, r={16:0}, r={16:0}, r->writer=0, x=1] [L816] 1 r->reader = (r->reader + 1) % 4 VAL [r={16:0}, r={16:0}, r->reader=0, r->reader = (r->reader + 1) % 4=121, x=1] [L811] EXPR 0 r->q[ r->writer ] VAL [\old(x)=1, r={16:0}, r={16:0}, r->writer=0, x=1] [L816] 1 r->reader = (r->reader + 1) % 4 VAL [r={16:0}, r={16:0}, r->reader=0, r->reader = (r->reader + 1) % 4=121, x=1] [L811] 0 r->q[ r->writer ] = x VAL [\old(x)=1, r={16:0}, r={16:0}, r->writer=0, x=1] [L816] 1 r->reader = (r->reader + 1) % 4 VAL [r={16:0}, r={16:0}, r->reader=0, r->reader = (r->reader + 1) % 4=121, x=1] [L816] 1 r->reader = (r->reader + 1) % 4 VAL [r={16:0}, r={16:0}, r->reader=0, r->reader = (r->reader + 1) % 4=121, x=1] [L811] 0 r->q[ r->writer ] = x VAL [\old(x)=1, r={16:0}, r={16:0}, r->q[ r->writer ] = x=124, r->writer=0, x=1] [L811] 0 r->q[ r->writer ] = x VAL [\old(x)=1, r={16:0}, r={16:0}, r->q[ r->writer ] = x=124, r->writer=0, x=1] [L811] 0 r->q[ r->writer ] = x VAL [\old(x)=1, r={16:0}, r={16:0}, r->q[ r->writer ] = x=124, r->writer=0, x=1] [L817] 1 return x; VAL [\result=1, r={16:0}, r={16:0}, x=1] [L811] 0 r->q[ r->writer ] = x VAL [\old(x)=1, r={16:0}, r={16:0}, r->q[ r->writer ] = x=124, r->writer=0, x=1] [L854] RET, EXPR 1 ring_dequeue( r ) [L854] 1 val = ring_dequeue( r ) VAL [arg={16:0}, arg={16:0}, i=0, last=0, r={16:0}, ring_dequeue( r )=1, val=1] [L812] EXPR 0 r->writer VAL [\old(x)=1, r={16:0}, r={16:0}, r->writer=0, x=1] [L812] EXPR 0 r->writer + 1 VAL [\old(x)=1, r={16:0}, r={16:0}, r->writer=0, x=1] [L855] 1 !(val == last + 1) ? reach_error() : (void)0 VAL [arg={16:0}, arg={16:0}, i=0, last=0, r={16:0}, val=1] [L812] EXPR 0 r->writer + 1 VAL [\old(x)=1, r={16:0}, r={16:0}, r->writer=0, x=1] [L856] 1 last = val VAL [arg={16:0}, arg={16:0}, i=0, last=1, r={16:0}, val=1] [L812] EXPR 0 r->writer + 1 VAL [\old(x)=1, r={16:0}, r={16:0}, r->writer=0, x=1] [L857] 1 ++i VAL [++i=1, arg={16:0}, arg={16:0}, i=0, last=1, r={16:0}, val=1] [L812] EXPR 0 r->writer + 1 VAL [\old(x)=1, r={16:0}, r={16:0}, r->writer=0, x=1] [L857] 1 ++i VAL [++i=1, arg={16:0}, arg={16:0}, i=1, last=1, r={16:0}, val=1] [L812] 0 r->writer = (r->writer + 1) % 4 VAL [\old(x)=1, r={16:0}, r={16:0}, r->writer=0, x=1] [L853] COND TRUE 1 i < 8 VAL [arg={16:0}, arg={16:0}, i=1, last=1, r={16:0}, val=1] [L812] 0 r->writer = (r->writer + 1) % 4 VAL [\old(x)=1, r={16:0}, r={16:0}, r->writer=0, r->writer = (r->writer + 1) % 4=118, x=1] [L854] CALL, EXPR 1 ring_dequeue( r ) [L812] 0 r->writer = (r->writer + 1) % 4 VAL [\old(x)=1, r={16:0}, r={16:0}, r->writer=0, r->writer = (r->writer + 1) % 4=118, x=1] [L815] EXPR 1 r->reader VAL [r={16:0}, r={16:0}, r->reader=1] [L815] EXPR 1 r->q[ r->reader ] VAL [r={16:0}, r={16:0}, r->reader=1] [L845] RET 0 ring_enqueue( r, i + 1 ) [L815] EXPR 1 r->q[ r->reader ] VAL [r={16:0}, r={16:0}, r->reader=1] [L843] 0 ++i VAL [++i=1, arg={16:0}, arg={16:0}, i=0, r={16:0}] [L815] EXPR 1 r->q[ r->reader ] VAL [r={16:0}, r={16:0}, r->reader=1] [L843] 0 ++i VAL [++i=1, arg={16:0}, arg={16:0}, i=1, r={16:0}] [L815] EXPR 1 r->q[ r->reader ] VAL [r={16:0}, r={16:0}, r->reader=1] [L815] EXPR 1 r->q[ r->reader ] VAL [r={16:0}, r={16:0}, r->reader=1] [L843] COND TRUE 0 i < 8 VAL [arg={16:0}, arg={16:0}, i=1, r={16:0}] [L815] EXPR 1 r->q[ r->reader ] VAL [r={16:0}, r={16:0}, r->q[ r->reader ]=2, r->reader=1] [L845] CALL 0 ring_enqueue( r, i + 1 ) [L815] 1 long x = r->q[ r->reader ]; VAL [r={16:0}, r={16:0}, r->q[ r->reader ]=2, r->reader=1] [L815] 1 long x = r->q[ r->reader ]; VAL [r={16:0}, r={16:0}, r->q[ r->reader ]=2, r->reader=1] [L815] 1 long x = r->q[ r->reader ]; VAL [r={16:0}, r={16:0}, r->q[ r->reader ]=2, r->reader=1] [L810] EXPR 0 r->writer VAL [\old(x)=2, r={16:0}, r={16:0}, r->writer=1, x=2] [L815] 1 long x = r->q[ r->reader ]; VAL [r={16:0}, r={16:0}, r->q[ r->reader ]=2, r->reader=1, x=2] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=2, r={16:0}, r={16:0}, r->writer=1, x=2] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=2, r={16:0}, r={16:0}, r->writer=1, x=2] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=2, r={16:0}, r={16:0}, r->writer=1, x=2] [L816] EXPR 1 r->reader VAL [r={16:0}, r={16:0}, r->reader=1, x=2] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=2, r={16:0}, r={16:0}, r->writer=1, x=2] [L816] EXPR 1 r->reader + 1 VAL [r={16:0}, r={16:0}, r->reader=1, x=2] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=2, r={16:0}, r={16:0}, r->writer=1, x=2] [L816] EXPR 1 r->reader + 1 VAL [r={16:0}, r={16:0}, r->reader=1, x=2] [L810] EXPR 0 r->reader VAL [\old(x)=2, r={16:0}, r={16:0}, r->reader=1, r->writer=1, x=2] [L816] EXPR 1 r->reader + 1 VAL [r={16:0}, r={16:0}, r->reader=1, x=2] [L810] 0 (r->writer + 1) % 4 == r->reader VAL [\old(x)=2, r={16:0}, r={16:0}, r->reader=1, r->writer=1, x=2] [L816] EXPR 1 r->reader + 1 VAL [r={16:0}, r={16:0}, r->reader=1, x=2] [L810] 0 (r->writer + 1) % 4 == r->reader VAL [\old(x)=2, r={16:0}, r={16:0}, r->reader=1, r->writer=1, x=2] [L816] EXPR 1 r->reader + 1 VAL [r={16:0}, r={16:0}, r->reader=1, x=2] [L810] 0 (r->writer + 1) % 4 == r->reader VAL [\old(x)=2, r={16:0}, r={16:0}, r->reader=1, r->writer=1, x=2] [L816] 1 r->reader = (r->reader + 1) % 4 VAL [r={16:0}, r={16:0}, r->reader=1, x=2] [L810] 0 (r->writer + 1) % 4 == r->reader VAL [\old(x)=2, r={16:0}, r={16:0}, r->reader=1, r->writer=1, x=2] [L810] 0 (r->writer + 1) % 4 == r->reader VAL [\old(x)=2, r={16:0}, r={16:0}, r->reader=1, r->writer=1, x=2] [L816] 1 r->reader = (r->reader + 1) % 4 VAL [r={16:0}, r={16:0}, r->reader=1, r->reader = (r->reader + 1) % 4=120, x=2] [L810] COND FALSE 0 !((r->writer + 1) % 4 == r->reader) VAL [\old(x)=2, r={16:0}, r={16:0}, r->reader=1, r->writer=1, x=2] [L816] 1 r->reader = (r->reader + 1) % 4 VAL [r={16:0}, r={16:0}, r->reader=1, r->reader = (r->reader + 1) % 4=120, x=2] [L816] 1 r->reader = (r->reader + 1) % 4 VAL [r={16:0}, r={16:0}, r->reader=1, r->reader = (r->reader + 1) % 4=120, x=2] [L816] 1 r->reader = (r->reader + 1) % 4 VAL [r={16:0}, r={16:0}, r->reader=1, r->reader = (r->reader + 1) % 4=120, x=2] [L811] EXPR 0 r->writer VAL [\old(x)=2, r={16:0}, r={16:0}, r->writer=1, x=2] [L816] 1 r->reader = (r->reader + 1) % 4 VAL [r={16:0}, r={16:0}, r->reader=1, r->reader = (r->reader + 1) % 4=120, x=2] [L811] EXPR 0 r->q[ r->writer ] VAL [\old(x)=2, r={16:0}, r={16:0}, r->writer=1, x=2] [L811] EXPR 0 r->q[ r->writer ] VAL [\old(x)=2, r={16:0}, r={16:0}, r->writer=1, x=2] [L811] EXPR 0 r->q[ r->writer ] VAL [\old(x)=2, r={16:0}, r={16:0}, r->writer=1, x=2] [L817] 1 return x; VAL [\result=2, r={16:0}, r={16:0}, x=2] [L811] EXPR 0 r->q[ r->writer ] VAL [\old(x)=2, r={16:0}, r={16:0}, r->writer=1, x=2] [L854] RET, EXPR 1 ring_dequeue( r ) [L811] 0 r->q[ r->writer ] = x VAL [\old(x)=2, r={16:0}, r={16:0}, r->writer=1, x=2] [L854] 1 val = ring_dequeue( r ) VAL [arg={16:0}, arg={16:0}, i=1, last=1, r={16:0}, ring_dequeue( r )=2, val=2] [L811] 0 r->q[ r->writer ] = x VAL [\old(x)=2, r={16:0}, r={16:0}, r->q[ r->writer ] = x=119, r->writer=1, x=2] [L811] 0 r->q[ r->writer ] = x VAL [\old(x)=2, r={16:0}, r={16:0}, r->q[ r->writer ] = x=119, r->writer=1, x=2] [L855] 1 !(val == last + 1) ? reach_error() : (void)0 VAL [arg={16:0}, arg={16:0}, i=1, last=1, r={16:0}, val=2] [L811] 0 r->q[ r->writer ] = x VAL [\old(x)=2, r={16:0}, r={16:0}, r->q[ r->writer ] = x=119, r->writer=1, x=2] [L856] 1 last = val VAL [arg={16:0}, arg={16:0}, i=1, last=2, r={16:0}, val=2] [L811] 0 r->q[ r->writer ] = x VAL [\old(x)=2, r={16:0}, r={16:0}, r->q[ r->writer ] = x=119, r->writer=1, x=2] [L857] 1 ++i VAL [++i=2, arg={16:0}, arg={16:0}, i=1, last=2, r={16:0}, val=2] [L857] 1 ++i VAL [++i=2, arg={16:0}, arg={16:0}, i=2, last=2, r={16:0}, val=2] [L812] EXPR 0 r->writer VAL [\old(x)=2, r={16:0}, r={16:0}, r->writer=1, x=2] [L853] COND TRUE 1 i < 8 VAL [arg={16:0}, arg={16:0}, i=2, last=2, r={16:0}, val=2] [L812] EXPR 0 r->writer + 1 VAL [\old(x)=2, r={16:0}, r={16:0}, r->writer=1, x=2] [L854] CALL 1 ring_dequeue( r ) [L812] EXPR 0 r->writer + 1 VAL [\old(x)=2, r={16:0}, r={16:0}, r->writer=1, x=2] [L812] 0 r->writer = (r->writer + 1) % 4 VAL [\old(x)=2, r={16:0}, r={16:0}, r->writer=1, x=2] [L815] EXPR 1 r->reader VAL [r={16:0}, r={16:0}, r->reader=2] [L815] EXPR 1 r->q[ r->reader ] VAL [r={16:0}, r={16:0}, r->reader=2] [L812] 0 r->writer = (r->writer + 1) % 4 VAL [\old(x)=2, r={16:0}, r={16:0}, r->writer=1, r->writer = (r->writer + 1) % 4=122, x=2] [L815] EXPR 1 r->q[ r->reader ] VAL [r={16:0}, r={16:0}, r->reader=2] [L812] 0 r->writer = (r->writer + 1) % 4 VAL [\old(x)=2, r={16:0}, r={16:0}, r->writer=1, r->writer = (r->writer + 1) % 4=122, x=2] [L815] EXPR 1 r->q[ r->reader ] VAL [r={16:0}, r={16:0}, r->reader=2] [L812] 0 r->writer = (r->writer + 1) % 4 VAL [\old(x)=2, r={16:0}, r={16:0}, r->writer=1, r->writer = (r->writer + 1) % 4=122, x=2] [L815] EXPR 1 r->q[ r->reader ] VAL [r={16:0}, r={16:0}, r->reader=2] [L812] 0 r->writer = (r->writer + 1) % 4 VAL [\old(x)=2, r={16:0}, r={16:0}, r->writer=1, r->writer = (r->writer + 1) % 4=122, x=2] [L815] EXPR 1 r->q[ r->reader ] VAL [r={16:0}, r={16:0}, r->reader=2] [L812] 0 r->writer = (r->writer + 1) % 4 VAL [\old(x)=2, r={16:0}, r={16:0}, r->writer=1, r->writer = (r->writer + 1) % 4=122, x=2] [L815] EXPR 1 r->q[ r->reader ] VAL [r={16:0}, r={16:0}, r->q[ r->reader ]=115, r->reader=2] [L815] 1 long x = r->q[ r->reader ]; VAL [r={16:0}, r={16:0}, r->q[ r->reader ]=115, r->reader=2] [L815] 1 long x = r->q[ r->reader ]; VAL [r={16:0}, r={16:0}, r->q[ r->reader ]=115, r->reader=2] [L845] RET 0 ring_enqueue( r, i + 1 ) [L815] 1 long x = r->q[ r->reader ]; VAL [r={16:0}, r={16:0}, r->q[ r->reader ]=115, r->reader=2] [L843] 0 ++i VAL [++i=2, arg={16:0}, arg={16:0}, i=1, r={16:0}] [L815] 1 long x = r->q[ r->reader ]; VAL [r={16:0}, r={16:0}, r->q[ r->reader ]=115, r->reader=2] [L843] 0 ++i VAL [++i=2, arg={16:0}, arg={16:0}, i=2, r={16:0}] [L815] 1 long x = r->q[ r->reader ]; VAL [r={16:0}, r={16:0}, r->q[ r->reader ]=115, r->reader=2] [L815] 1 long x = r->q[ r->reader ]; VAL [r={16:0}, r={16:0}, r->q[ r->reader ]=115, r->reader=2, x=115] [L843] COND TRUE 0 i < 8 VAL [arg={16:0}, arg={16:0}, i=2, r={16:0}] [L845] CALL 0 ring_enqueue( r, i + 1 ) [L816] EXPR 1 r->reader VAL [r={16:0}, r={16:0}, r->reader=2, x=115] [L816] EXPR 1 r->reader + 1 VAL [r={16:0}, r={16:0}, r->reader=2, x=115] [L816] EXPR 1 r->reader + 1 VAL [r={16:0}, r={16:0}, r->reader=2, x=115] [L816] EXPR 1 r->reader + 1 VAL [r={16:0}, r={16:0}, r->reader=2, x=115] [L810] EXPR 0 r->writer VAL [\old(x)=3, r={16:0}, r={16:0}, r->writer=2, x=3] [L816] EXPR 1 r->reader + 1 VAL [r={16:0}, r={16:0}, r->reader=2, x=115] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=3, r={16:0}, r={16:0}, r->writer=2, x=3] [L816] EXPR 1 r->reader + 1 VAL [r={16:0}, r={16:0}, r->reader=2, x=115] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=3, r={16:0}, r={16:0}, r->writer=2, x=3] [L816] 1 r->reader = (r->reader + 1) % 4 VAL [r={16:0}, r={16:0}, r->reader=2, x=115] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=3, r={16:0}, r={16:0}, r->writer=2, x=3] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=3, r={16:0}, r={16:0}, r->writer=2, x=3] [L816] 1 r->reader = (r->reader + 1) % 4 VAL [r={16:0}, r={16:0}, r->reader=2, r->reader = (r->reader + 1) % 4=123, x=115] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=3, r={16:0}, r={16:0}, r->writer=2, x=3] [L816] 1 r->reader = (r->reader + 1) % 4 VAL [r={16:0}, r={16:0}, r->reader=2, r->reader = (r->reader + 1) % 4=123, x=115] [L810] EXPR 0 r->reader VAL [\old(x)=3, r={16:0}, r={16:0}, r->reader=3, r->writer=2, x=3] [L816] 1 r->reader = (r->reader + 1) % 4 VAL [r={16:0}, r={16:0}, r->reader=2, r->reader = (r->reader + 1) % 4=123, x=115] [L810] 0 (r->writer + 1) % 4 == r->reader VAL [\old(x)=3, r={16:0}, r={16:0}, r->reader=3, r->writer=2, x=3] [L816] 1 r->reader = (r->reader + 1) % 4 VAL [r={16:0}, r={16:0}, r->reader=2, r->reader = (r->reader + 1) % 4=123, x=115] [L810] 0 (r->writer + 1) % 4 == r->reader VAL [\old(x)=3, r={16:0}, r={16:0}, r->reader=3, r->writer=2, x=3] [L816] 1 r->reader = (r->reader + 1) % 4 VAL [r={16:0}, r={16:0}, r->reader=2, r->reader = (r->reader + 1) % 4=123, x=115] 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->reader + 1 [816] * C: r->q[ r->reader ] [815] * C: r->q[ r->writer ] [811] * C: long x = r->q[ r->reader ]; [815] * C: r->writer + 1 [810] * C: long x = r->q[ r->reader ]; [815] * C: r->q[ r->writer ] = x [811] * C: r->writer = (r->writer + 1) % 4 [812] * C: r->writer = 0 [823] * C: r->reader + 1 [816] * C: r->q[ r->writer ] [811] * C: r->writer = 0 [823] * C: r->reader + 1 [816] * C: r->q[ r->writer ] = x [811] * C: (r->writer + 1) % 4 == r->reader [810] * C: r->reader = r->writer = 0 [823] * C: r->reader = r->writer = 0 [823] * C: r->writer + 1 [810] * C: (r->writer + 1) % 4 == r->reader [810] * C: r->reader = r->writer = 0 [823] * C: r->q[ r->reader ] [815] * C: r->q[ r->reader ] [815] * C: r->writer = (r->writer + 1) % 4 [812] * C: long x = r->q[ r->reader ]; [815] * C: r->writer = (r->writer + 1) % 4 [812] * C: r->writer + 1 [812] * C: long x = r->q[ r->reader ]; [815] * C: r->writer = 0 [823] * C: r->writer + 1 [810] * C: r->writer + 1 [810] * C: r->reader + 1 [816] * C: r->writer + 1 [812] * C: r->writer + 1 [812] * C: r->q[ r->writer ] [811] * C: r->q[ r->writer ] = x [811] * C: r->q[ r->writer ] [811] * C: r->reader = r->writer = 0 [823] * C: r->writer + 1 [812] * C: (r->writer + 1) % 4 == r->reader [810] * C: r->q[ r->reader ] [815] * C: r->writer = 0 [823] * C: r->writer = (r->writer + 1) % 4 [812] * C: (r->writer + 1) % 4 == r->reader [810] * C: r->q[ r->writer ] = x [811] and C: r->reader = (r->reader + 1) % 4 [816] - 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: 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: 820]: 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_nowait_fnThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 320 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 22.6s, OverallIterations: 16, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 6.5s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 162, 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.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 4185 NumberOfCodeBlocks, 3683 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 4687 ConstructedInterpolants, 7 QuantifiedInterpolants, 26610 SizeOfPredicates, 35 NumberOfNonLiveVariables, 3073 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 25 InterpolantComputations, 11 PerfectInterpolantSequences, 1294/3191 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-18 17:05:41,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-04-18 17:05:41,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE