./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c149fc3-cc15-4b85-b2df-5abd01ba737d/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c149fc3-cc15-4b85-b2df-5abd01ba737d/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c149fc3-cc15-4b85-b2df-5abd01ba737d/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c149fc3-cc15-4b85-b2df-5abd01ba737d/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c149fc3-cc15-4b85-b2df-5abd01ba737d/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c149fc3-cc15-4b85-b2df-5abd01ba737d/bin/uautomizer-tPACEb0tL8 --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b71c781c26c072fdf5838e0877462128517513c3df1f3bde9f2474cb4533ecb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:21:07,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:21:07,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:21:07,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:21:07,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:21:07,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:21:07,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:21:07,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:21:07,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:21:07,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:21:07,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:21:07,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:21:07,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:21:07,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:21:07,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:21:07,148 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:21:07,150 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:21:07,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:21:07,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:21:07,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:21:07,164 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:21:07,166 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:21:07,167 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:21:07,169 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:21:07,172 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:21:07,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:21:07,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:21:07,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:21:07,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:21:07,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:21:07,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:21:07,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:21:07,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:21:07,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:21:07,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:21:07,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:21:07,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:21:07,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:21:07,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:21:07,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:21:07,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:21:07,197 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c149fc3-cc15-4b85-b2df-5abd01ba737d/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-16 12:21:07,232 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:21:07,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:21:07,233 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:21:07,233 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:21:07,234 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:21:07,234 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:21:07,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:21:07,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:21:07,235 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:21:07,236 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:21:07,237 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:21:07,237 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:21:07,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:21:07,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:21:07,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:21:07,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:21:07,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:21:07,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:21:07,238 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-16 12:21:07,239 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:21:07,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:21:07,239 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:21:07,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:21:07,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:21:07,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:21:07,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:21:07,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:21:07,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:21:07,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:21:07,242 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:21:07,242 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:21:07,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:21:07,243 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:21:07,243 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:21:07,243 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:21:07,243 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c149fc3-cc15-4b85-b2df-5abd01ba737d/bin/uautomizer-tPACEb0tL8/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c149fc3-cc15-4b85-b2df-5abd01ba737d/bin/uautomizer-tPACEb0tL8 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 -> Automizer 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 -> 7b71c781c26c072fdf5838e0877462128517513c3df1f3bde9f2474cb4533ecb [2022-11-16 12:21:07,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:21:07,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:21:07,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:21:07,571 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:21:07,572 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:21:07,573 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c149fc3-cc15-4b85-b2df-5abd01ba737d/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i [2022-11-16 12:21:07,645 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c149fc3-cc15-4b85-b2df-5abd01ba737d/bin/uautomizer-tPACEb0tL8/data/a01a2f24c/8c63f669592349b080396844366719e8/FLAG33176dd3b [2022-11-16 12:21:08,207 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:21:08,208 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c149fc3-cc15-4b85-b2df-5abd01ba737d/sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i [2022-11-16 12:21:08,227 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c149fc3-cc15-4b85-b2df-5abd01ba737d/bin/uautomizer-tPACEb0tL8/data/a01a2f24c/8c63f669592349b080396844366719e8/FLAG33176dd3b [2022-11-16 12:21:08,508 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c149fc3-cc15-4b85-b2df-5abd01ba737d/bin/uautomizer-tPACEb0tL8/data/a01a2f24c/8c63f669592349b080396844366719e8 [2022-11-16 12:21:08,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:21:08,514 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:21:08,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:21:08,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:21:08,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:21:08,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:21:08" (1/1) ... [2022-11-16 12:21:08,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ee3da2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:08, skipping insertion in model container [2022-11-16 12:21:08,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:21:08" (1/1) ... [2022-11-16 12:21:08,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:21:08,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:21:09,010 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c149fc3-cc15-4b85-b2df-5abd01ba737d/sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i[30358,30371] [2022-11-16 12:21:09,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:21:09,032 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:21:09,109 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c149fc3-cc15-4b85-b2df-5abd01ba737d/sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i[30358,30371] [2022-11-16 12:21:09,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:21:09,175 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:21:09,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:09 WrapperNode [2022-11-16 12:21:09,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:21:09,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:21:09,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:21:09,178 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:21:09,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:09" (1/1) ... [2022-11-16 12:21:09,220 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:09" (1/1) ... [2022-11-16 12:21:09,279 INFO L138 Inliner]: procedures = 170, calls = 34, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 166 [2022-11-16 12:21:09,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:21:09,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:21:09,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:21:09,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:21:09,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:09" (1/1) ... [2022-11-16 12:21:09,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:09" (1/1) ... [2022-11-16 12:21:09,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:09" (1/1) ... [2022-11-16 12:21:09,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:09" (1/1) ... [2022-11-16 12:21:09,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:09" (1/1) ... [2022-11-16 12:21:09,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:09" (1/1) ... [2022-11-16 12:21:09,347 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:09" (1/1) ... [2022-11-16 12:21:09,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:09" (1/1) ... [2022-11-16 12:21:09,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:21:09,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:21:09,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:21:09,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:21:09,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:09" (1/1) ... [2022-11-16 12:21:09,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:21:09,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c149fc3-cc15-4b85-b2df-5abd01ba737d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:21:09,411 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c149fc3-cc15-4b85-b2df-5abd01ba737d/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:21:09,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c149fc3-cc15-4b85-b2df-5abd01ba737d/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:21:09,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:21:09,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:21:09,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:21:09,457 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-11-16 12:21:09,458 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-11-16 12:21:09,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:21:09,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:21:09,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:21:09,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:21:09,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:21:09,459 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-11-16 12:21:09,459 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-11-16 12:21:09,460 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:21:09,602 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:21:09,604 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:21:09,999 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:21:10,220 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:21:10,221 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:21:10,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:21:10 BoogieIcfgContainer [2022-11-16 12:21:10,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:21:10,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:21:10,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:21:10,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:21:10,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:21:08" (1/3) ... [2022-11-16 12:21:10,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7e61d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:21:10, skipping insertion in model container [2022-11-16 12:21:10,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:09" (2/3) ... [2022-11-16 12:21:10,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7e61d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:21:10, skipping insertion in model container [2022-11-16 12:21:10,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:21:10" (3/3) ... [2022-11-16 12:21:10,259 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2b.i [2022-11-16 12:21:10,269 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 12:21:10,280 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:21:10,280 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-16 12:21:10,281 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:21:10,448 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-16 12:21:10,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 210 transitions, 452 flow [2022-11-16 12:21:10,603 INFO L130 PetriNetUnfolder]: 2/206 cut-off events. [2022-11-16 12:21:10,603 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-16 12:21:10,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 206 events. 2/206 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 396 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 153. Up to 2 conditions per place. [2022-11-16 12:21:10,612 INFO L82 GeneralOperation]: Start removeDead. Operand has 221 places, 210 transitions, 452 flow [2022-11-16 12:21:10,618 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 192 transitions, 405 flow [2022-11-16 12:21:10,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:21:10,635 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@671278c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:21:10,635 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-11-16 12:21:10,642 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-11-16 12:21:10,642 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:21:10,643 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:21:10,643 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:10,644 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting writerErr0ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:21:10,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:10,649 INFO L85 PathProgramCache]: Analyzing trace with hash -501401202, now seen corresponding path program 1 times [2022-11-16 12:21:10,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:10,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573274314] [2022-11-16 12:21:10,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:10,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:10,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:10,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573274314] [2022-11-16 12:21:10,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573274314] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:10,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:10,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:21:10,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789184137] [2022-11-16 12:21:10,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:10,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:21:10,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:10,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:21:10,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:21:10,985 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 210 [2022-11-16 12:21:10,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 192 transitions, 405 flow. Second operand has 2 states, 2 states have (on average 183.0) internal successors, (366), 2 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:10,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:21:10,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 210 [2022-11-16 12:21:10,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:21:11,263 INFO L130 PetriNetUnfolder]: 51/864 cut-off events. [2022-11-16 12:21:11,263 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-11-16 12:21:11,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 864 events. 51/864 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5439 event pairs, 51 based on Foata normal form. 19/727 useless extension candidates. Maximal degree in co-relation 859. Up to 96 conditions per place. [2022-11-16 12:21:11,282 INFO L137 encePairwiseOnDemand]: 196/210 looper letters, 11 selfloop transitions, 0 changer transitions 0/176 dead transitions. [2022-11-16 12:21:11,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 176 transitions, 395 flow [2022-11-16 12:21:11,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:21:11,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 12:21:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 389 transitions. [2022-11-16 12:21:11,307 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9261904761904762 [2022-11-16 12:21:11,308 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 389 transitions. [2022-11-16 12:21:11,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 389 transitions. [2022-11-16 12:21:11,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:21:11,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 389 transitions. [2022-11-16 12:21:11,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 194.5) internal successors, (389), 2 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:11,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:11,322 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:11,324 INFO L175 Difference]: Start difference. First operand has 203 places, 192 transitions, 405 flow. Second operand 2 states and 389 transitions. [2022-11-16 12:21:11,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 176 transitions, 395 flow [2022-11-16 12:21:11,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 176 transitions, 382 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-16 12:21:11,333 INFO L231 Difference]: Finished difference. Result has 183 places, 176 transitions, 360 flow [2022-11-16 12:21:11,335 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=360, PETRI_PLACES=183, PETRI_TRANSITIONS=176} [2022-11-16 12:21:11,342 INFO L288 CegarLoopForPetriNet]: 203 programPoint places, -20 predicate places. [2022-11-16 12:21:11,342 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 176 transitions, 360 flow [2022-11-16 12:21:11,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 183.0) internal successors, (366), 2 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:11,344 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:21:11,344 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:11,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:21:11,345 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:21:11,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:11,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1212378925, now seen corresponding path program 1 times [2022-11-16 12:21:11,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:11,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924836262] [2022-11-16 12:21:11,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:11,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:11,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:11,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924836262] [2022-11-16 12:21:11,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924836262] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:11,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:11,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:21:11,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652024751] [2022-11-16 12:21:11,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:11,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:21:11,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:11,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:21:11,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:21:11,506 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 210 [2022-11-16 12:21:11,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 176 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:11,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:21:11,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 210 [2022-11-16 12:21:11,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:21:15,756 INFO L130 PetriNetUnfolder]: 8850/24455 cut-off events. [2022-11-16 12:21:15,756 INFO L131 PetriNetUnfolder]: For 368/368 co-relation queries the response was YES. [2022-11-16 12:21:15,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37721 conditions, 24455 events. 8850/24455 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 917. Compared 285329 event pairs, 6197 based on Foata normal form. 0/18888 useless extension candidates. Maximal degree in co-relation 37718. Up to 10013 conditions per place. [2022-11-16 12:21:16,130 INFO L137 encePairwiseOnDemand]: 201/210 looper letters, 46 selfloop transitions, 8 changer transitions 0/199 dead transitions. [2022-11-16 12:21:16,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 199 transitions, 518 flow [2022-11-16 12:21:16,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:21:16,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:21:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2022-11-16 12:21:16,134 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8587301587301587 [2022-11-16 12:21:16,134 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 541 transitions. [2022-11-16 12:21:16,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 541 transitions. [2022-11-16 12:21:16,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:21:16,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 541 transitions. [2022-11-16 12:21:16,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:16,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:16,145 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:16,146 INFO L175 Difference]: Start difference. First operand has 183 places, 176 transitions, 360 flow. Second operand 3 states and 541 transitions. [2022-11-16 12:21:16,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 199 transitions, 518 flow [2022-11-16 12:21:16,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 199 transitions, 518 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:21:16,156 INFO L231 Difference]: Finished difference. Result has 187 places, 183 transitions, 422 flow [2022-11-16 12:21:16,156 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=187, PETRI_TRANSITIONS=183} [2022-11-16 12:21:16,158 INFO L288 CegarLoopForPetriNet]: 203 programPoint places, -16 predicate places. [2022-11-16 12:21:16,158 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 183 transitions, 422 flow [2022-11-16 12:21:16,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:16,159 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:21:16,160 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:16,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:21:16,161 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:21:16,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:16,166 INFO L85 PathProgramCache]: Analyzing trace with hash 875355591, now seen corresponding path program 1 times [2022-11-16 12:21:16,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:16,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158048487] [2022-11-16 12:21:16,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:16,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:16,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:16,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158048487] [2022-11-16 12:21:16,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158048487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:16,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:16,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:21:16,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119773528] [2022-11-16 12:21:16,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:16,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:21:16,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:16,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:21:16,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:21:16,467 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 210 [2022-11-16 12:21:16,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 183 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:16,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:21:16,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 210 [2022-11-16 12:21:16,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:21:21,983 INFO L130 PetriNetUnfolder]: 9634/34890 cut-off events. [2022-11-16 12:21:21,983 INFO L131 PetriNetUnfolder]: For 7356/8144 co-relation queries the response was YES. [2022-11-16 12:21:22,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57010 conditions, 34890 events. 9634/34890 cut-off events. For 7356/8144 co-relation queries the response was YES. Maximal size of possible extension queue 1334. Compared 476409 event pairs, 3650 based on Foata normal form. 19/28356 useless extension candidates. Maximal degree in co-relation 57005. Up to 7907 conditions per place. [2022-11-16 12:21:22,411 INFO L137 encePairwiseOnDemand]: 196/210 looper letters, 49 selfloop transitions, 15 changer transitions 0/212 dead transitions. [2022-11-16 12:21:22,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 212 transitions, 656 flow [2022-11-16 12:21:22,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:21:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:21:22,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 548 transitions. [2022-11-16 12:21:22,415 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8698412698412699 [2022-11-16 12:21:22,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 548 transitions. [2022-11-16 12:21:22,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 548 transitions. [2022-11-16 12:21:22,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:21:22,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 548 transitions. [2022-11-16 12:21:22,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:22,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:22,424 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:22,424 INFO L175 Difference]: Start difference. First operand has 187 places, 183 transitions, 422 flow. Second operand 3 states and 548 transitions. [2022-11-16 12:21:22,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 212 transitions, 656 flow [2022-11-16 12:21:22,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 212 transitions, 626 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:21:22,518 INFO L231 Difference]: Finished difference. Result has 189 places, 198 transitions, 556 flow [2022-11-16 12:21:22,519 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=189, PETRI_TRANSITIONS=198} [2022-11-16 12:21:22,521 INFO L288 CegarLoopForPetriNet]: 203 programPoint places, -14 predicate places. [2022-11-16 12:21:22,522 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 198 transitions, 556 flow [2022-11-16 12:21:22,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:22,523 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:21:22,523 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:22,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:21:22,523 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting writerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:21:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:22,525 INFO L85 PathProgramCache]: Analyzing trace with hash -36563742, now seen corresponding path program 1 times [2022-11-16 12:21:22,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:22,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406814515] [2022-11-16 12:21:22,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:22,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:22,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:22,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406814515] [2022-11-16 12:21:22,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406814515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:22,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:22,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:21:22,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486774889] [2022-11-16 12:21:22,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:22,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:21:22,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:22,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:21:22,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:21:22,639 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 210 [2022-11-16 12:21:22,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 198 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:22,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:21:22,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 210 [2022-11-16 12:21:22,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:21:26,181 INFO L130 PetriNetUnfolder]: 5215/21538 cut-off events. [2022-11-16 12:21:26,181 INFO L131 PetriNetUnfolder]: For 5079/7796 co-relation queries the response was YES. [2022-11-16 12:21:26,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36873 conditions, 21538 events. 5215/21538 cut-off events. For 5079/7796 co-relation queries the response was YES. Maximal size of possible extension queue 912. Compared 289211 event pairs, 2031 based on Foata normal form. 26/17715 useless extension candidates. Maximal degree in co-relation 36867. Up to 3991 conditions per place. [2022-11-16 12:21:26,533 INFO L137 encePairwiseOnDemand]: 202/210 looper letters, 23 selfloop transitions, 7 changer transitions 0/209 dead transitions. [2022-11-16 12:21:26,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 209 transitions, 642 flow [2022-11-16 12:21:26,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:21:26,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:21:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 553 transitions. [2022-11-16 12:21:26,536 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8777777777777778 [2022-11-16 12:21:26,537 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 553 transitions. [2022-11-16 12:21:26,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 553 transitions. [2022-11-16 12:21:26,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:21:26,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 553 transitions. [2022-11-16 12:21:26,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:26,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:26,543 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:26,543 INFO L175 Difference]: Start difference. First operand has 189 places, 198 transitions, 556 flow. Second operand 3 states and 553 transitions. [2022-11-16 12:21:26,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 209 transitions, 642 flow [2022-11-16 12:21:26,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 209 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:21:26,565 INFO L231 Difference]: Finished difference. Result has 191 places, 204 transitions, 580 flow [2022-11-16 12:21:26,567 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=580, PETRI_PLACES=191, PETRI_TRANSITIONS=204} [2022-11-16 12:21:26,569 INFO L288 CegarLoopForPetriNet]: 203 programPoint places, -12 predicate places. [2022-11-16 12:21:26,569 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 204 transitions, 580 flow [2022-11-16 12:21:26,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:26,576 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:21:26,577 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:26,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:21:26,577 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:21:26,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:26,578 INFO L85 PathProgramCache]: Analyzing trace with hash 160958644, now seen corresponding path program 1 times [2022-11-16 12:21:26,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:26,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425768251] [2022-11-16 12:21:26,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:26,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:26,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:26,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425768251] [2022-11-16 12:21:26,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425768251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:26,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:26,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:21:26,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810973711] [2022-11-16 12:21:26,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:26,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:21:26,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:26,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:21:26,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:21:26,986 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 210 [2022-11-16 12:21:26,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 204 transitions, 580 flow. Second operand has 5 states, 5 states have (on average 175.2) internal successors, (876), 5 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:26,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:21:26,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 210 [2022-11-16 12:21:26,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:21:34,309 INFO L130 PetriNetUnfolder]: 9632/52986 cut-off events. [2022-11-16 12:21:34,309 INFO L131 PetriNetUnfolder]: For 8371/10131 co-relation queries the response was YES. [2022-11-16 12:21:34,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83221 conditions, 52986 events. 9632/52986 cut-off events. For 8371/10131 co-relation queries the response was YES. Maximal size of possible extension queue 1890. Compared 852094 event pairs, 2044 based on Foata normal form. 841/44640 useless extension candidates. Maximal degree in co-relation 83214. Up to 6270 conditions per place. [2022-11-16 12:21:34,966 INFO L137 encePairwiseOnDemand]: 200/210 looper letters, 48 selfloop transitions, 24 changer transitions 0/254 dead transitions. [2022-11-16 12:21:34,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 254 transitions, 886 flow [2022-11-16 12:21:34,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:21:34,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 12:21:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 934 transitions. [2022-11-16 12:21:34,970 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8895238095238095 [2022-11-16 12:21:34,971 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 934 transitions. [2022-11-16 12:21:34,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 934 transitions. [2022-11-16 12:21:34,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:21:34,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 934 transitions. [2022-11-16 12:21:34,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 186.8) internal successors, (934), 5 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:34,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:34,980 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:34,980 INFO L175 Difference]: Start difference. First operand has 191 places, 204 transitions, 580 flow. Second operand 5 states and 934 transitions. [2022-11-16 12:21:34,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 254 transitions, 886 flow [2022-11-16 12:21:35,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 254 transitions, 858 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:21:35,098 INFO L231 Difference]: Finished difference. Result has 195 places, 225 transitions, 734 flow [2022-11-16 12:21:35,099 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=734, PETRI_PLACES=195, PETRI_TRANSITIONS=225} [2022-11-16 12:21:35,100 INFO L288 CegarLoopForPetriNet]: 203 programPoint places, -8 predicate places. [2022-11-16 12:21:35,100 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 225 transitions, 734 flow [2022-11-16 12:21:35,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.2) internal successors, (876), 5 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:35,101 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:21:35,101 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:35,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:21:35,102 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:21:35,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:35,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1699067936, now seen corresponding path program 2 times [2022-11-16 12:21:35,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:35,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238019974] [2022-11-16 12:21:35,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:35,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:35,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:35,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238019974] [2022-11-16 12:21:35,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238019974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:35,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:35,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:21:35,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556650279] [2022-11-16 12:21:35,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:35,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:21:35,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:35,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:21:35,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:21:35,377 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 210 [2022-11-16 12:21:35,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 225 transitions, 734 flow. Second operand has 4 states, 4 states have (on average 180.25) internal successors, (721), 4 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:35,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:21:35,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 210 [2022-11-16 12:21:35,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:21:36,083 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([516] L699-1-->L699-2: Formula: (= |v_#race~x~0_7| |v_writerThread1of1ForFork1_#t~nondet6#1_3|) InVars {writerThread1of1ForFork1_#t~nondet6#1=|v_writerThread1of1ForFork1_#t~nondet6#1_3|} OutVars{#race~x~0=|v_#race~x~0_7|, writerThread1of1ForFork1_#t~nondet6#1=|v_writerThread1of1ForFork1_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~x~0][155], [42#L700-3true, 247#(= ~r~0 0), 224#true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 56#L706-1true, Black: 235#(= |#race~x~0| 0), Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 175#L710-1true, 123#L718-4true, 19#L699-2true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), readerThread1of1ForFork3InUse, 256#(not (= ~w~0 0))]) [2022-11-16 12:21:36,083 INFO L383 tUnfolder$Statistics]: this new event has 82 ancestors and is not cut-off event [2022-11-16 12:21:36,084 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-11-16 12:21:36,084 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-11-16 12:21:36,084 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-11-16 12:21:36,119 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([516] L699-1-->L699-2: Formula: (= |v_#race~x~0_7| |v_writerThread1of1ForFork1_#t~nondet6#1_3|) InVars {writerThread1of1ForFork1_#t~nondet6#1=|v_writerThread1of1ForFork1_#t~nondet6#1_3|} OutVars{#race~x~0=|v_#race~x~0_7|, writerThread1of1ForFork1_#t~nondet6#1=|v_writerThread1of1ForFork1_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~x~0][155], [247#(= ~r~0 0), 224#true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 56#L706-1true, Black: 235#(= |#race~x~0| 0), Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 179#L700-4true, 175#L710-1true, 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), 19#L699-2true, readerThread1of1ForFork3InUse, 256#(not (= ~w~0 0))]) [2022-11-16 12:21:36,120 INFO L383 tUnfolder$Statistics]: this new event has 83 ancestors and is not cut-off event [2022-11-16 12:21:36,120 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is not cut-off event [2022-11-16 12:21:36,120 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is not cut-off event [2022-11-16 12:21:36,120 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is not cut-off event [2022-11-16 12:21:36,604 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([516] L699-1-->L699-2: Formula: (= |v_#race~x~0_7| |v_writerThread1of1ForFork1_#t~nondet6#1_3|) InVars {writerThread1of1ForFork1_#t~nondet6#1=|v_writerThread1of1ForFork1_#t~nondet6#1_3|} OutVars{#race~x~0=|v_#race~x~0_7|, writerThread1of1ForFork1_#t~nondet6#1=|v_writerThread1of1ForFork1_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~x~0][155], [42#L700-3true, 247#(= ~r~0 0), 224#true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 152#L708-4true, Black: 235#(= |#race~x~0| 0), Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 175#L710-1true, 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), 19#L699-2true, readerThread1of1ForFork3InUse, 256#(not (= ~w~0 0))]) [2022-11-16 12:21:36,604 INFO L383 tUnfolder$Statistics]: this new event has 92 ancestors and is not cut-off event [2022-11-16 12:21:36,604 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2022-11-16 12:21:36,604 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2022-11-16 12:21:36,604 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2022-11-16 12:21:36,626 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([516] L699-1-->L699-2: Formula: (= |v_#race~x~0_7| |v_writerThread1of1ForFork1_#t~nondet6#1_3|) InVars {writerThread1of1ForFork1_#t~nondet6#1=|v_writerThread1of1ForFork1_#t~nondet6#1_3|} OutVars{#race~x~0=|v_#race~x~0_7|, writerThread1of1ForFork1_#t~nondet6#1=|v_writerThread1of1ForFork1_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~x~0][155], [247#(= ~r~0 0), 224#true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 152#L708-4true, Black: 235#(= |#race~x~0| 0), Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 179#L700-4true, 175#L710-1true, 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), 19#L699-2true, readerThread1of1ForFork3InUse, 256#(not (= ~w~0 0))]) [2022-11-16 12:21:36,626 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is not cut-off event [2022-11-16 12:21:36,626 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is not cut-off event [2022-11-16 12:21:36,626 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is not cut-off event [2022-11-16 12:21:36,626 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is not cut-off event [2022-11-16 12:21:36,666 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([482] L710-->L710-1: Formula: (= |v_readerThread1of1ForFork3_~l~0#1_9| v_~r~0_4) InVars {readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_9|} OutVars{readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_9|, ~r~0=v_~r~0_4} AuxVars[] AssignedVars[~r~0][188], [42#L700-3true, 224#true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 70#L698-2true, 209#L710-1true, Black: 233#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 175#L710-1true, 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), 245#true, Black: 247#(= ~r~0 0), readerThread1of1ForFork3InUse, 256#(not (= ~w~0 0))]) [2022-11-16 12:21:36,667 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is not cut-off event [2022-11-16 12:21:36,667 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2022-11-16 12:21:36,667 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2022-11-16 12:21:36,667 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2022-11-16 12:21:36,693 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([482] L710-->L710-1: Formula: (= |v_readerThread1of1ForFork3_~l~0#1_9| v_~r~0_4) InVars {readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_9|} OutVars{readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_9|, ~r~0=v_~r~0_4} AuxVars[] AssignedVars[~r~0][188], [224#true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 70#L698-2true, 209#L710-1true, Black: 233#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 179#L700-4true, 175#L710-1true, 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), 245#true, Black: 247#(= ~r~0 0), readerThread1of1ForFork3InUse, 256#(not (= ~w~0 0))]) [2022-11-16 12:21:36,693 INFO L383 tUnfolder$Statistics]: this new event has 95 ancestors and is not cut-off event [2022-11-16 12:21:36,693 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2022-11-16 12:21:36,693 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2022-11-16 12:21:36,694 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2022-11-16 12:21:36,990 INFO L130 PetriNetUnfolder]: 1328/10553 cut-off events. [2022-11-16 12:21:36,990 INFO L131 PetriNetUnfolder]: For 3163/3452 co-relation queries the response was YES. [2022-11-16 12:21:37,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16765 conditions, 10553 events. 1328/10553 cut-off events. For 3163/3452 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 132795 event pairs, 450 based on Foata normal form. 142/8939 useless extension candidates. Maximal degree in co-relation 16756. Up to 1267 conditions per place. [2022-11-16 12:21:37,110 INFO L137 encePairwiseOnDemand]: 203/210 looper letters, 20 selfloop transitions, 11 changer transitions 0/220 dead transitions. [2022-11-16 12:21:37,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 220 transitions, 750 flow [2022-11-16 12:21:37,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:21:37,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 12:21:37,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 739 transitions. [2022-11-16 12:21:37,114 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8797619047619047 [2022-11-16 12:21:37,114 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 739 transitions. [2022-11-16 12:21:37,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 739 transitions. [2022-11-16 12:21:37,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:21:37,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 739 transitions. [2022-11-16 12:21:37,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.75) internal successors, (739), 4 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:37,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:37,120 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:37,121 INFO L175 Difference]: Start difference. First operand has 195 places, 225 transitions, 734 flow. Second operand 4 states and 739 transitions. [2022-11-16 12:21:37,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 220 transitions, 750 flow [2022-11-16 12:21:37,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 220 transitions, 750 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:21:37,129 INFO L231 Difference]: Finished difference. Result has 198 places, 215 transitions, 694 flow [2022-11-16 12:21:37,129 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=694, PETRI_PLACES=198, PETRI_TRANSITIONS=215} [2022-11-16 12:21:37,130 INFO L288 CegarLoopForPetriNet]: 203 programPoint places, -5 predicate places. [2022-11-16 12:21:37,131 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 215 transitions, 694 flow [2022-11-16 12:21:37,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 180.25) internal successors, (721), 4 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:37,131 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:21:37,132 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:37,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:21:37,132 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:21:37,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:37,133 INFO L85 PathProgramCache]: Analyzing trace with hash 330204001, now seen corresponding path program 1 times [2022-11-16 12:21:37,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:37,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198625092] [2022-11-16 12:21:37,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:37,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:37,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:37,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:37,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198625092] [2022-11-16 12:21:37,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198625092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:37,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:37,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:21:37,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226255530] [2022-11-16 12:21:37,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:37,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:21:37,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:37,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:21:37,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:21:37,187 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 210 [2022-11-16 12:21:37,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 215 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:37,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:21:37,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 210 [2022-11-16 12:21:37,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:21:39,674 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([464] L707-2-->L707-3: Formula: (= |v_#race~y~0_1| |v_readerThread1of1ForFork3_#t~nondet8#1_3|) InVars {readerThread1of1ForFork3_#t~nondet8#1=|v_readerThread1of1ForFork3_#t~nondet8#1_3|} OutVars{#race~y~0=|v_#race~y~0_1|, readerThread1of1ForFork3_#t~nondet8#1=|v_readerThread1of1ForFork3_#t~nondet8#1_3|} AuxVars[] AssignedVars[#race~y~0][125], [Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 247#(= ~r~0 0), 224#true, 164#L720-7true, 70#L698-2true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 103#L707-3true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 233#true, readerThread1of1ForFork3InUse, 258#true, 256#(not (= ~w~0 0))]) [2022-11-16 12:21:39,674 INFO L383 tUnfolder$Statistics]: this new event has 110 ancestors and is cut-off event [2022-11-16 12:21:39,674 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-16 12:21:39,675 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-16 12:21:39,675 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-16 12:21:39,784 INFO L130 PetriNetUnfolder]: 4263/20009 cut-off events. [2022-11-16 12:21:39,784 INFO L131 PetriNetUnfolder]: For 10818/11106 co-relation queries the response was YES. [2022-11-16 12:21:39,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37042 conditions, 20009 events. 4263/20009 cut-off events. For 10818/11106 co-relation queries the response was YES. Maximal size of possible extension queue 884. Compared 271605 event pairs, 2171 based on Foata normal form. 11/16443 useless extension candidates. Maximal degree in co-relation 37032. Up to 5461 conditions per place. [2022-11-16 12:21:39,984 INFO L137 encePairwiseOnDemand]: 204/210 looper letters, 49 selfloop transitions, 5 changer transitions 0/234 dead transitions. [2022-11-16 12:21:39,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 234 transitions, 897 flow [2022-11-16 12:21:39,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:21:39,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:21:39,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 544 transitions. [2022-11-16 12:21:39,987 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8634920634920635 [2022-11-16 12:21:39,987 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 544 transitions. [2022-11-16 12:21:39,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 544 transitions. [2022-11-16 12:21:39,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:21:39,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 544 transitions. [2022-11-16 12:21:39,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:39,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:39,993 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:39,993 INFO L175 Difference]: Start difference. First operand has 198 places, 215 transitions, 694 flow. Second operand 3 states and 544 transitions. [2022-11-16 12:21:39,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 234 transitions, 897 flow [2022-11-16 12:21:40,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 234 transitions, 880 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:21:40,005 INFO L231 Difference]: Finished difference. Result has 200 places, 219 transitions, 721 flow [2022-11-16 12:21:40,005 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=721, PETRI_PLACES=200, PETRI_TRANSITIONS=219} [2022-11-16 12:21:40,006 INFO L288 CegarLoopForPetriNet]: 203 programPoint places, -3 predicate places. [2022-11-16 12:21:40,006 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 219 transitions, 721 flow [2022-11-16 12:21:40,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:40,007 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:21:40,007 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:40,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:21:40,008 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:21:40,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:40,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1673146552, now seen corresponding path program 1 times [2022-11-16 12:21:40,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:40,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388723702] [2022-11-16 12:21:40,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:40,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:40,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:40,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388723702] [2022-11-16 12:21:40,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388723702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:40,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:40,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:21:40,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560257872] [2022-11-16 12:21:40,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:40,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:21:40,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:40,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:21:40,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:21:40,055 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 210 [2022-11-16 12:21:40,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 219 transitions, 721 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:40,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:21:40,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 210 [2022-11-16 12:21:40,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:21:42,846 INFO L130 PetriNetUnfolder]: 3068/16663 cut-off events. [2022-11-16 12:21:42,846 INFO L131 PetriNetUnfolder]: For 9215/9892 co-relation queries the response was YES. [2022-11-16 12:21:42,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31774 conditions, 16663 events. 3068/16663 cut-off events. For 9215/9892 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 223020 event pairs, 1372 based on Foata normal form. 46/13926 useless extension candidates. Maximal degree in co-relation 31763. Up to 4245 conditions per place. [2022-11-16 12:21:43,057 INFO L137 encePairwiseOnDemand]: 202/210 looper letters, 71 selfloop transitions, 10 changer transitions 0/242 dead transitions. [2022-11-16 12:21:43,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 242 transitions, 981 flow [2022-11-16 12:21:43,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:21:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:21:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2022-11-16 12:21:43,060 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8492063492063492 [2022-11-16 12:21:43,060 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2022-11-16 12:21:43,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2022-11-16 12:21:43,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:21:43,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2022-11-16 12:21:43,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:43,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:43,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:43,066 INFO L175 Difference]: Start difference. First operand has 200 places, 219 transitions, 721 flow. Second operand 3 states and 535 transitions. [2022-11-16 12:21:43,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 242 transitions, 981 flow [2022-11-16 12:21:43,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 242 transitions, 971 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:21:43,088 INFO L231 Difference]: Finished difference. Result has 202 places, 227 transitions, 809 flow [2022-11-16 12:21:43,089 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=809, PETRI_PLACES=202, PETRI_TRANSITIONS=227} [2022-11-16 12:21:43,090 INFO L288 CegarLoopForPetriNet]: 203 programPoint places, -1 predicate places. [2022-11-16 12:21:43,090 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 227 transitions, 809 flow [2022-11-16 12:21:43,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:43,091 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:21:43,091 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:43,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:21:43,091 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr5ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:21:43,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:43,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1632741772, now seen corresponding path program 1 times [2022-11-16 12:21:43,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:43,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040269079] [2022-11-16 12:21:43,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:43,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:43,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:43,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:43,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040269079] [2022-11-16 12:21:43,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040269079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:43,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:43,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:21:43,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366524608] [2022-11-16 12:21:43,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:43,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:21:43,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:43,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:21:43,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:21:43,148 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 210 [2022-11-16 12:21:43,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 227 transitions, 809 flow. Second operand has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:43,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:21:43,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 210 [2022-11-16 12:21:43,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:21:44,552 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([516] L699-1-->L699-2: Formula: (= |v_#race~x~0_7| |v_writerThread1of1ForFork1_#t~nondet6#1_3|) InVars {writerThread1of1ForFork1_#t~nondet6#1=|v_writerThread1of1ForFork1_#t~nondet6#1_3|} OutVars{#race~x~0=|v_#race~x~0_7|, writerThread1of1ForFork1_#t~nondet6#1=|v_writerThread1of1ForFork1_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~x~0][153], [247#(= ~r~0 0), 224#true, Black: 260#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 56#L706-1true, 266#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 264#true, Black: 235#(= |#race~x~0| 0), Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 179#L700-4true, 175#L710-1true, 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), 19#L699-2true, 272#(= |#race~y~0| 0), readerThread1of1ForFork3InUse]) [2022-11-16 12:21:44,552 INFO L383 tUnfolder$Statistics]: this new event has 83 ancestors and is not cut-off event [2022-11-16 12:21:44,553 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is not cut-off event [2022-11-16 12:21:44,553 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is not cut-off event [2022-11-16 12:21:44,553 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is not cut-off event [2022-11-16 12:21:44,655 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([464] L707-2-->L707-3: Formula: (= |v_#race~y~0_1| |v_readerThread1of1ForFork3_#t~nondet8#1_3|) InVars {readerThread1of1ForFork3_#t~nondet8#1=|v_readerThread1of1ForFork3_#t~nondet8#1_3|} OutVars{#race~y~0=|v_#race~y~0_1|, readerThread1of1ForFork3_#t~nondet8#1=|v_readerThread1of1ForFork3_#t~nondet8#1_3|} AuxVars[] AssignedVars[#race~y~0][154], [247#(= ~r~0 0), 224#true, Black: 260#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 70#L698-2true, Black: 266#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 233#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 179#L700-4true, 175#L710-1true, 123#L718-4true, 103#L707-3true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), 264#true, readerThread1of1ForFork3InUse, 270#true]) [2022-11-16 12:21:44,655 INFO L383 tUnfolder$Statistics]: this new event has 84 ancestors and is not cut-off event [2022-11-16 12:21:44,655 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2022-11-16 12:21:44,655 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2022-11-16 12:21:44,655 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2022-11-16 12:21:45,854 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([464] L707-2-->L707-3: Formula: (= |v_#race~y~0_1| |v_readerThread1of1ForFork3_#t~nondet8#1_3|) InVars {readerThread1of1ForFork3_#t~nondet8#1=|v_readerThread1of1ForFork3_#t~nondet8#1_3|} OutVars{#race~y~0=|v_#race~y~0_1|, readerThread1of1ForFork3_#t~nondet8#1=|v_readerThread1of1ForFork3_#t~nondet8#1_3|} AuxVars[] AssignedVars[#race~y~0][154], [247#(= ~r~0 0), 224#true, Black: 260#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 70#L698-2true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), Black: 266#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 233#true, 182#L719-7true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 175#L710-1true, 103#L707-3true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), 264#true, 270#true, readerThread1of1ForFork3InUse]) [2022-11-16 12:21:45,854 INFO L383 tUnfolder$Statistics]: this new event has 96 ancestors and is not cut-off event [2022-11-16 12:21:45,855 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2022-11-16 12:21:45,855 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2022-11-16 12:21:45,855 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2022-11-16 12:21:46,225 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([464] L707-2-->L707-3: Formula: (= |v_#race~y~0_1| |v_readerThread1of1ForFork3_#t~nondet8#1_3|) InVars {readerThread1of1ForFork3_#t~nondet8#1=|v_readerThread1of1ForFork3_#t~nondet8#1_3|} OutVars{#race~y~0=|v_#race~y~0_1|, readerThread1of1ForFork3_#t~nondet8#1=|v_readerThread1of1ForFork3_#t~nondet8#1_3|} AuxVars[] AssignedVars[#race~y~0][154], [247#(= ~r~0 0), 224#true, Black: 260#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 164#L720-7true, 70#L698-2true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), Black: 266#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 233#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 103#L707-3true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), 264#true, readerThread1of1ForFork3InUse, 270#true]) [2022-11-16 12:21:46,225 INFO L383 tUnfolder$Statistics]: this new event has 110 ancestors and is not cut-off event [2022-11-16 12:21:46,225 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is not cut-off event [2022-11-16 12:21:46,225 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is not cut-off event [2022-11-16 12:21:46,225 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is not cut-off event [2022-11-16 12:21:46,608 INFO L130 PetriNetUnfolder]: 4053/22737 cut-off events. [2022-11-16 12:21:46,608 INFO L131 PetriNetUnfolder]: For 15951/16489 co-relation queries the response was YES. [2022-11-16 12:21:46,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43654 conditions, 22737 events. 4053/22737 cut-off events. For 15951/16489 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 324836 event pairs, 1271 based on Foata normal form. 39/19279 useless extension candidates. Maximal degree in co-relation 43642. Up to 2996 conditions per place. [2022-11-16 12:21:46,820 INFO L137 encePairwiseOnDemand]: 202/210 looper letters, 59 selfloop transitions, 7 changer transitions 0/257 dead transitions. [2022-11-16 12:21:46,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 257 transitions, 1098 flow [2022-11-16 12:21:46,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:21:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:21:46,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2022-11-16 12:21:46,823 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8793650793650793 [2022-11-16 12:21:46,823 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 554 transitions. [2022-11-16 12:21:46,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 554 transitions. [2022-11-16 12:21:46,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:21:46,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 554 transitions. [2022-11-16 12:21:46,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:46,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:46,827 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:46,827 INFO L175 Difference]: Start difference. First operand has 202 places, 227 transitions, 809 flow. Second operand 3 states and 554 transitions. [2022-11-16 12:21:46,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 257 transitions, 1098 flow [2022-11-16 12:21:46,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 257 transitions, 1066 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-11-16 12:21:46,903 INFO L231 Difference]: Finished difference. Result has 204 places, 233 transitions, 839 flow [2022-11-16 12:21:46,904 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=839, PETRI_PLACES=204, PETRI_TRANSITIONS=233} [2022-11-16 12:21:46,905 INFO L288 CegarLoopForPetriNet]: 203 programPoint places, 1 predicate places. [2022-11-16 12:21:46,905 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 233 transitions, 839 flow [2022-11-16 12:21:46,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:46,906 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:21:46,906 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:46,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:21:46,906 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting writerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:21:46,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:46,907 INFO L85 PathProgramCache]: Analyzing trace with hash 206680893, now seen corresponding path program 1 times [2022-11-16 12:21:46,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:46,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972661796] [2022-11-16 12:21:46,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:46,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:21:46,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:21:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:21:46,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:21:46,991 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:21:46,992 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location writerErr4ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2022-11-16 12:21:46,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2022-11-16 12:21:46,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2022-11-16 12:21:46,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2022-11-16 12:21:46,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2022-11-16 12:21:46,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2022-11-16 12:21:46,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2022-11-16 12:21:46,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2022-11-16 12:21:46,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2022-11-16 12:21:46,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2022-11-16 12:21:46,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2022-11-16 12:21:46,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2022-11-16 12:21:46,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2022-11-16 12:21:46,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2022-11-16 12:21:46,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 50 remaining) [2022-11-16 12:21:47,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 50 remaining) [2022-11-16 12:21:47,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 50 remaining) [2022-11-16 12:21:47,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 50 remaining) [2022-11-16 12:21:47,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2022-11-16 12:21:47,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2022-11-16 12:21:47,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2022-11-16 12:21:47,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2022-11-16 12:21:47,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2022-11-16 12:21:47,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2022-11-16 12:21:47,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2022-11-16 12:21:47,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2022-11-16 12:21:47,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2022-11-16 12:21:47,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2022-11-16 12:21:47,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2022-11-16 12:21:47,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2022-11-16 12:21:47,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (19 of 50 remaining) [2022-11-16 12:21:47,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (18 of 50 remaining) [2022-11-16 12:21:47,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2022-11-16 12:21:47,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2022-11-16 12:21:47,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2022-11-16 12:21:47,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2022-11-16 12:21:47,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2022-11-16 12:21:47,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2022-11-16 12:21:47,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2022-11-16 12:21:47,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2022-11-16 12:21:47,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2022-11-16 12:21:47,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2022-11-16 12:21:47,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2022-11-16 12:21:47,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2022-11-16 12:21:47,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2022-11-16 12:21:47,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2022-11-16 12:21:47,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2022-11-16 12:21:47,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2022-11-16 12:21:47,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2022-11-16 12:21:47,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2022-11-16 12:21:47,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:21:47,009 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:47,019 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 12:21:47,019 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:21:47,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:21:47 BasicIcfg [2022-11-16 12:21:47,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:21:47,097 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:21:47,097 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:21:47,097 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:21:47,098 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:21:10" (3/4) ... [2022-11-16 12:21:47,101 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 12:21:47,101 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:21:47,102 INFO L158 Benchmark]: Toolchain (without parser) took 38587.51ms. Allocated memory was 113.2MB in the beginning and 11.7GB in the end (delta: 11.6GB). Free memory was 77.6MB in the beginning and 10.2GB in the end (delta: -10.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-11-16 12:21:47,102 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 79.7MB. Free memory is still 32.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:21:47,103 INFO L158 Benchmark]: CACSL2BoogieTranslator took 658.29ms. Allocated memory is still 113.2MB. Free memory was 77.3MB in the beginning and 76.7MB in the end (delta: 673.6kB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2022-11-16 12:21:47,103 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.59ms. Allocated memory is still 113.2MB. Free memory was 76.7MB in the beginning and 74.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:21:47,104 INFO L158 Benchmark]: Boogie Preprocessor took 82.84ms. Allocated memory is still 113.2MB. Free memory was 74.1MB in the beginning and 72.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:21:47,104 INFO L158 Benchmark]: RCFGBuilder took 859.89ms. Allocated memory is still 113.2MB. Free memory was 72.0MB in the beginning and 46.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-16 12:21:47,105 INFO L158 Benchmark]: TraceAbstraction took 36871.17ms. Allocated memory was 113.2MB in the beginning and 11.7GB in the end (delta: 11.6GB). Free memory was 46.2MB in the beginning and 10.2GB in the end (delta: -10.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-11-16 12:21:47,105 INFO L158 Benchmark]: Witness Printer took 4.58ms. Allocated memory is still 11.7GB. Free memory is still 10.2GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:21:47,107 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.32ms. Allocated memory is still 79.7MB. Free memory is still 32.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 658.29ms. Allocated memory is still 113.2MB. Free memory was 77.3MB in the beginning and 76.7MB in the end (delta: 673.6kB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.59ms. Allocated memory is still 113.2MB. Free memory was 76.7MB in the beginning and 74.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.84ms. Allocated memory is still 113.2MB. Free memory was 74.1MB in the beginning and 72.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 859.89ms. Allocated memory is still 113.2MB. Free memory was 72.0MB in the beginning and 46.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 36871.17ms. Allocated memory was 113.2MB in the beginning and 11.7GB in the end (delta: 11.6GB). Free memory was 46.2MB in the beginning and 10.2GB in the end (delta: -10.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 4.58ms. Allocated memory is still 11.7GB. Free memory is still 10.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 700]: Data race detected Data race detected The following path leads to a data race: [L688] 0 int w=0, r=0, x, y; VAL [r=0, w=0, x=0, y=0] [L714] 0 pthread_t t1, t2, t3, t4; VAL [r=0, t1={5:0}, t2={6:0}, t3={7:0}, t4={3:0}, w=0, x=0, y=0] [L715] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [pthread_create(&t1, 0, writer, 0)=-1, r=0, t1={5:0}, t2={6:0}, t3={7:0}, t4={3:0}, w=0, x=0, y=0] [L716] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [pthread_create(&t2, 0, reader, 0)=0, r=0, t1={5:0}, t2={6:0}, t3={7:0}, t4={3:0}, w=0, x=0, y=0] [L698] CALL 1 __VERIFIER_atomic_take_write_lock() [L690] EXPR 1 w==0 [L690] EXPR 1 w==0 && r==0 [L690] EXPR 1 r==0 [L690] EXPR 1 w==0 && r==0 [L690] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L690] RET 1 assume_abort_if_not(w==0 && r==0) [L691] 1 w = 1 [L698] RET 1 __VERIFIER_atomic_take_write_lock() [L699] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L700] 1 w = 0 VAL [arg={0:0}, arg={0:0}, r=0, w=0, w = 0=50, x=3, y=0] [L704] 2 int l; VAL [arg={0:0}, arg={0:0}, r=0, w=0, x=3, y=0] [L705] CALL 2 __VERIFIER_atomic_take_read_lock() [L694] EXPR 2 w==0 [L694] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L694] RET 2 assume_abort_if_not(w==0) [L695] EXPR 2 r+1 [L695] 2 r = r+1 [L705] RET 2 __VERIFIER_atomic_take_read_lock() [L700] 1 w = 0 VAL [arg={0:0}, arg={0:0}, r=1, w=0, w = 0=50, x=3, y=0] Now there is a data race on ~w~0 between C: w==0 [694] and C: w = 0 [700] - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: 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 with 1 thread instances CFG has 7 procedures, 271 locations, 50 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 36.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 34.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 120 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 445 IncrementalHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 118 mSDtfsCounter, 445 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=839occurred in iteration=9, InterpolantAutomatonStates: 29, 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.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 322 ConstructedInterpolants, 0 QuantifiedInterpolants, 548 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-16 12:21:47,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c149fc3-cc15-4b85-b2df-5abd01ba737d/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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