./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 0e0057cc 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_3ee0b4a4-0ebe-4c2c-9f67-78633d9c215a/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ee0b4a4-0ebe-4c2c-9f67-78633d9c215a/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ee0b4a4-0ebe-4c2c-9f67-78633d9c215a/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ee0b4a4-0ebe-4c2c-9f67-78633d9c215a/bin/uautomizer-verify-BQ2R08f2Ya/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_3ee0b4a4-0ebe-4c2c-9f67-78633d9c215a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ee0b4a4-0ebe-4c2c-9f67-78633d9c215a/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:39:13,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:39:13,827 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ee0b4a4-0ebe-4c2c-9f67-78633d9c215a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 00:39:13,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:39:13,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:39:13,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:39:13,857 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:39:13,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:39:13,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:39:13,859 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:39:13,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:39:13,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:39:13,861 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:39:13,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:39:13,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:39:13,862 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:39:13,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:39:13,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:39:13,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:39:13,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:39:13,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:39:13,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:39:13,866 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 00:39:13,866 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:39:13,867 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:39:13,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:39:13,867 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:39:13,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:39:13,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:39:13,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:39:13,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:39:13,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:39:13,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:39:13,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:39:13,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:39:13,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:39:13,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:39:13,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:39:13,872 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:39:13,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:39:13,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:39:13,873 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_3ee0b4a4-0ebe-4c2c-9f67-78633d9c215a/bin/uautomizer-verify-BQ2R08f2Ya/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_3ee0b4a4-0ebe-4c2c-9f67-78633d9c215a/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 [2023-11-29 00:39:14,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:39:14,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:39:14,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:39:14,136 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:39:14,137 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:39:14,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ee0b4a4-0ebe-4c2c-9f67-78633d9c215a/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i [2023-11-29 00:39:16,841 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:39:17,071 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:39:17,072 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ee0b4a4-0ebe-4c2c-9f67-78633d9c215a/sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i [2023-11-29 00:39:17,088 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ee0b4a4-0ebe-4c2c-9f67-78633d9c215a/bin/uautomizer-verify-BQ2R08f2Ya/data/847ae1516/5a5a45ea1ccc482f9bd49e31749bbe60/FLAG869b2f339 [2023-11-29 00:39:17,102 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ee0b4a4-0ebe-4c2c-9f67-78633d9c215a/bin/uautomizer-verify-BQ2R08f2Ya/data/847ae1516/5a5a45ea1ccc482f9bd49e31749bbe60 [2023-11-29 00:39:17,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:39:17,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:39:17,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:39:17,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:39:17,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:39:17,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:39:17" (1/1) ... [2023-11-29 00:39:17,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5efef3ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:39:17, skipping insertion in model container [2023-11-29 00:39:17,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:39:17" (1/1) ... [2023-11-29 00:39:17,173 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:39:17,497 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:39:17,507 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:39:17,552 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:39:17,592 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:39:17,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:39:17 WrapperNode [2023-11-29 00:39:17,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:39:17,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:39:17,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:39:17,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:39:17,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:39:17" (1/1) ... [2023-11-29 00:39:17,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:39:17" (1/1) ... [2023-11-29 00:39:17,646 INFO L138 Inliner]: procedures = 170, calls = 35, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 168 [2023-11-29 00:39:17,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:39:17,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:39:17,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:39:17,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:39:17,657 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:39:17" (1/1) ... [2023-11-29 00:39:17,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:39:17" (1/1) ... [2023-11-29 00:39:17,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:39:17" (1/1) ... [2023-11-29 00:39:17,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:39:17" (1/1) ... [2023-11-29 00:39:17,672 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:39:17" (1/1) ... [2023-11-29 00:39:17,674 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:39:17" (1/1) ... [2023-11-29 00:39:17,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:39:17" (1/1) ... [2023-11-29 00:39:17,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:39:17" (1/1) ... [2023-11-29 00:39:17,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:39:17,682 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:39:17,683 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:39:17,683 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:39:17,684 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:39:17" (1/1) ... [2023-11-29 00:39:17,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:39:17,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ee0b4a4-0ebe-4c2c-9f67-78633d9c215a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:39:17,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ee0b4a4-0ebe-4c2c-9f67-78633d9c215a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:39:17,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ee0b4a4-0ebe-4c2c-9f67-78633d9c215a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:39:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 00:39:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 00:39:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:39:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2023-11-29 00:39:17,748 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2023-11-29 00:39:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:39:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:39:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 00:39:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:39:17,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:39:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2023-11-29 00:39:17,749 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2023-11-29 00:39:17,751 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 00:39:17,885 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:39:17,887 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:39:18,184 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:39:18,266 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:39:18,266 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 00:39:18,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:39:18 BoogieIcfgContainer [2023-11-29 00:39:18,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:39:18,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:39:18,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:39:18,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:39:18,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:39:17" (1/3) ... [2023-11-29 00:39:18,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e62323d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:39:18, skipping insertion in model container [2023-11-29 00:39:18,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:39:17" (2/3) ... [2023-11-29 00:39:18,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e62323d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:39:18, skipping insertion in model container [2023-11-29 00:39:18,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:39:18" (3/3) ... [2023-11-29 00:39:18,277 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2b.i [2023-11-29 00:39:18,284 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 00:39:18,292 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:39:18,293 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-11-29 00:39:18,293 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:39:18,384 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-29 00:39:18,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 216 transitions, 460 flow [2023-11-29 00:39:18,516 INFO L124 PetriNetUnfolderBase]: 4/212 cut-off events. [2023-11-29 00:39:18,517 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 00:39:18,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 212 events. 4/212 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 451 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 163. Up to 2 conditions per place. [2023-11-29 00:39:18,526 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 216 transitions, 460 flow [2023-11-29 00:39:18,535 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 198 transitions, 417 flow [2023-11-29 00:39:18,545 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:39:18,553 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=LoopHeads, 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;@59c62fc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:39:18,553 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2023-11-29 00:39:18,561 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:39:18,561 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-11-29 00:39:18,561 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:39:18,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:39:18,562 INFO L208 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] [2023-11-29 00:39:18,563 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting writerErr0ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-29 00:39:18,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:39:18,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1833587175, now seen corresponding path program 1 times [2023-11-29 00:39:18,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:39:18,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446540124] [2023-11-29 00:39:18,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:39:18,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:39:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:39:18,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:39:18,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:39:18,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446540124] [2023-11-29 00:39:18,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446540124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:39:18,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:39:18,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:39:18,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286343880] [2023-11-29 00:39:18,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:39:18,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:39:18,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:39:18,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:39:18,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:39:18,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 216 [2023-11-29 00:39:18,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 198 transitions, 417 flow. Second operand has 2 states, 2 states have (on average 187.0) internal successors, (374), 2 states have internal predecessors, (374), 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) [2023-11-29 00:39:18,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:39:18,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 216 [2023-11-29 00:39:18,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:39:19,044 INFO L124 PetriNetUnfolderBase]: 51/884 cut-off events. [2023-11-29 00:39:19,044 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2023-11-29 00:39:19,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 884 events. 51/884 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5664 event pairs, 51 based on Foata normal form. 38/766 useless extension candidates. Maximal degree in co-relation 883. Up to 96 conditions per place. [2023-11-29 00:39:19,059 INFO L140 encePairwiseOnDemand]: 200/216 looper letters, 11 selfloop transitions, 0 changer transitions 0/176 dead transitions. [2023-11-29 00:39:19,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 176 transitions, 395 flow [2023-11-29 00:39:19,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:39:19,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 00:39:19,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 399 transitions. [2023-11-29 00:39:19,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9236111111111112 [2023-11-29 00:39:19,075 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 399 transitions. [2023-11-29 00:39:19,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 399 transitions. [2023-11-29 00:39:19,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:39:19,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 399 transitions. [2023-11-29 00:39:19,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 199.5) internal successors, (399), 2 states have internal predecessors, (399), 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) [2023-11-29 00:39:19,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 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) [2023-11-29 00:39:19,091 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 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) [2023-11-29 00:39:19,093 INFO L175 Difference]: Start difference. First operand has 207 places, 198 transitions, 417 flow. Second operand 2 states and 399 transitions. [2023-11-29 00:39:19,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 176 transitions, 395 flow [2023-11-29 00:39:19,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 176 transitions, 382 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-29 00:39:19,104 INFO L231 Difference]: Finished difference. Result has 183 places, 176 transitions, 360 flow [2023-11-29 00:39:19,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, 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} [2023-11-29 00:39:19,110 INFO L281 CegarLoopForPetriNet]: 207 programPoint places, -24 predicate places. [2023-11-29 00:39:19,110 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 176 transitions, 360 flow [2023-11-29 00:39:19,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 187.0) internal successors, (374), 2 states have internal predecessors, (374), 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) [2023-11-29 00:39:19,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:39:19,111 INFO L208 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] [2023-11-29 00:39:19,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:39:19,111 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-29 00:39:19,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:39:19,112 INFO L85 PathProgramCache]: Analyzing trace with hash -961952738, now seen corresponding path program 1 times [2023-11-29 00:39:19,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:39:19,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092279127] [2023-11-29 00:39:19,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:39:19,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:39:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:39:19,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:39:19,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:39:19,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092279127] [2023-11-29 00:39:19,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092279127] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:39:19,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:39:19,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:39:19,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022720265] [2023-11-29 00:39:19,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:39:19,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:39:19,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:39:19,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:39:19,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:39:19,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 216 [2023-11-29 00:39:19,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 176 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 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) [2023-11-29 00:39:19,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:39:19,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 216 [2023-11-29 00:39:19,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:39:20,283 INFO L124 PetriNetUnfolderBase]: 1206/6432 cut-off events. [2023-11-29 00:39:20,283 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-11-29 00:39:20,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8474 conditions, 6432 events. 1206/6432 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 71318 event pairs, 825 based on Foata normal form. 0/5194 useless extension candidates. Maximal degree in co-relation 8471. Up to 1501 conditions per place. [2023-11-29 00:39:20,348 INFO L140 encePairwiseOnDemand]: 207/216 looper letters, 26 selfloop transitions, 8 changer transitions 0/189 dead transitions. [2023-11-29 00:39:20,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 189 transitions, 458 flow [2023-11-29 00:39:20,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:39:20,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:39:20,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions. [2023-11-29 00:39:20,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8688271604938271 [2023-11-29 00:39:20,353 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 563 transitions. [2023-11-29 00:39:20,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 563 transitions. [2023-11-29 00:39:20,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:39:20,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 563 transitions. [2023-11-29 00:39:20,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 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) [2023-11-29 00:39:20,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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) [2023-11-29 00:39:20,360 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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) [2023-11-29 00:39:20,360 INFO L175 Difference]: Start difference. First operand has 183 places, 176 transitions, 360 flow. Second operand 3 states and 563 transitions. [2023-11-29 00:39:20,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 189 transitions, 458 flow [2023-11-29 00:39:20,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 189 transitions, 458 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:39:20,367 INFO L231 Difference]: Finished difference. Result has 187 places, 183 transitions, 422 flow [2023-11-29 00:39:20,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, 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} [2023-11-29 00:39:20,368 INFO L281 CegarLoopForPetriNet]: 207 programPoint places, -20 predicate places. [2023-11-29 00:39:20,368 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 183 transitions, 422 flow [2023-11-29 00:39:20,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 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) [2023-11-29 00:39:20,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:39:20,369 INFO L208 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] [2023-11-29 00:39:20,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:39:20,370 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting writerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-29 00:39:20,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:39:20,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1021328312, now seen corresponding path program 1 times [2023-11-29 00:39:20,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:39:20,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956882083] [2023-11-29 00:39:20,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:39:20,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:39:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:39:20,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:39:20,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:39:20,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956882083] [2023-11-29 00:39:20,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956882083] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:39:20,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:39:20,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:39:20,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977329522] [2023-11-29 00:39:20,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:39:20,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:39:20,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:39:20,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:39:20,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:39:20,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 216 [2023-11-29 00:39:20,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 183 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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) [2023-11-29 00:39:20,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:39:20,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 216 [2023-11-29 00:39:20,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:39:21,408 INFO L124 PetriNetUnfolderBase]: 846/6698 cut-off events. [2023-11-29 00:39:21,408 INFO L125 PetriNetUnfolderBase]: For 175/228 co-relation queries the response was YES. [2023-11-29 00:39:21,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8669 conditions, 6698 events. 846/6698 cut-off events. For 175/228 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 79931 event pairs, 528 based on Foata normal form. 2/5338 useless extension candidates. Maximal degree in co-relation 8664. Up to 821 conditions per place. [2023-11-29 00:39:21,496 INFO L140 encePairwiseOnDemand]: 208/216 looper letters, 19 selfloop transitions, 7 changer transitions 0/192 dead transitions. [2023-11-29 00:39:21,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 192 transitions, 496 flow [2023-11-29 00:39:21,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:39:21,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:39:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2023-11-29 00:39:21,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.875 [2023-11-29 00:39:21,499 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 567 transitions. [2023-11-29 00:39:21,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 567 transitions. [2023-11-29 00:39:21,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:39:21,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 567 transitions. [2023-11-29 00:39:21,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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) [2023-11-29 00:39:21,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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) [2023-11-29 00:39:21,536 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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) [2023-11-29 00:39:21,536 INFO L175 Difference]: Start difference. First operand has 187 places, 183 transitions, 422 flow. Second operand 3 states and 567 transitions. [2023-11-29 00:39:21,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 192 transitions, 496 flow [2023-11-29 00:39:21,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 192 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:39:21,549 INFO L231 Difference]: Finished difference. Result has 189 places, 189 transitions, 460 flow [2023-11-29 00:39:21,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=189, PETRI_TRANSITIONS=189} [2023-11-29 00:39:21,550 INFO L281 CegarLoopForPetriNet]: 207 programPoint places, -18 predicate places. [2023-11-29 00:39:21,551 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 189 transitions, 460 flow [2023-11-29 00:39:21,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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) [2023-11-29 00:39:21,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:39:21,552 INFO L208 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] [2023-11-29 00:39:21,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:39:21,552 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-29 00:39:21,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:39:21,553 INFO L85 PathProgramCache]: Analyzing trace with hash 142273567, now seen corresponding path program 1 times [2023-11-29 00:39:21,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:39:21,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979536934] [2023-11-29 00:39:21,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:39:21,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:39:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:39:21,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:39:21,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:39:21,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979536934] [2023-11-29 00:39:21,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979536934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:39:21,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:39:21,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:39:21,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247397230] [2023-11-29 00:39:21,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:39:21,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:39:21,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:39:21,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:39:21,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:39:21,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 216 [2023-11-29 00:39:21,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 189 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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) [2023-11-29 00:39:21,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:39:21,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 216 [2023-11-29 00:39:21,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:39:25,480 INFO L124 PetriNetUnfolderBase]: 7346/32738 cut-off events. [2023-11-29 00:39:25,480 INFO L125 PetriNetUnfolderBase]: For 6803/8092 co-relation queries the response was YES. [2023-11-29 00:39:25,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52991 conditions, 32738 events. 7346/32738 cut-off events. For 6803/8092 co-relation queries the response was YES. Maximal size of possible extension queue 1329. Compared 473789 event pairs, 2151 based on Foata normal form. 38/26642 useless extension candidates. Maximal degree in co-relation 52985. Up to 6420 conditions per place. [2023-11-29 00:39:25,953 INFO L140 encePairwiseOnDemand]: 202/216 looper letters, 45 selfloop transitions, 15 changer transitions 0/216 dead transitions. [2023-11-29 00:39:25,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 216 transitions, 680 flow [2023-11-29 00:39:25,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:39:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:39:25,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2023-11-29 00:39:25,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8703703703703703 [2023-11-29 00:39:25,965 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 564 transitions. [2023-11-29 00:39:25,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 564 transitions. [2023-11-29 00:39:25,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:39:25,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 564 transitions. [2023-11-29 00:39:25,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 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) [2023-11-29 00:39:25,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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) [2023-11-29 00:39:25,971 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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) [2023-11-29 00:39:25,971 INFO L175 Difference]: Start difference. First operand has 189 places, 189 transitions, 460 flow. Second operand 3 states and 564 transitions. [2023-11-29 00:39:25,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 216 transitions, 680 flow [2023-11-29 00:39:25,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 216 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:39:26,000 INFO L231 Difference]: Finished difference. Result has 191 places, 204 transitions, 596 flow [2023-11-29 00:39:26,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=191, PETRI_TRANSITIONS=204} [2023-11-29 00:39:26,002 INFO L281 CegarLoopForPetriNet]: 207 programPoint places, -16 predicate places. [2023-11-29 00:39:26,002 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 204 transitions, 596 flow [2023-11-29 00:39:26,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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) [2023-11-29 00:39:26,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:39:26,003 INFO L208 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] [2023-11-29 00:39:26,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:39:26,003 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-29 00:39:26,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:39:26,004 INFO L85 PathProgramCache]: Analyzing trace with hash 654782796, now seen corresponding path program 1 times [2023-11-29 00:39:26,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:39:26,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487286693] [2023-11-29 00:39:26,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:39:26,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:39:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:39:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:39:26,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:39:26,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487286693] [2023-11-29 00:39:26,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487286693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:39:26,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:39:26,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:39:26,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291355579] [2023-11-29 00:39:26,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:39:26,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:39:26,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:39:26,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:39:26,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:39:26,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 216 [2023-11-29 00:39:26,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 204 transitions, 596 flow. Second operand has 5 states, 5 states have (on average 181.2) internal successors, (906), 5 states have internal predecessors, (906), 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) [2023-11-29 00:39:26,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:39:26,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 216 [2023-11-29 00:39:26,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:39:31,869 INFO L124 PetriNetUnfolderBase]: 10227/46861 cut-off events. [2023-11-29 00:39:31,869 INFO L125 PetriNetUnfolderBase]: For 12378/18283 co-relation queries the response was YES. [2023-11-29 00:39:32,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78087 conditions, 46861 events. 10227/46861 cut-off events. For 12378/18283 co-relation queries the response was YES. Maximal size of possible extension queue 1837. Compared 720511 event pairs, 2393 based on Foata normal form. 70/38780 useless extension candidates. Maximal degree in co-relation 78080. Up to 6188 conditions per place. [2023-11-29 00:39:32,325 INFO L140 encePairwiseOnDemand]: 206/216 looper letters, 31 selfloop transitions, 17 changer transitions 0/232 dead transitions. [2023-11-29 00:39:32,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 232 transitions, 781 flow [2023-11-29 00:39:32,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:39:32,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:39:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 945 transitions. [2023-11-29 00:39:32,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.875 [2023-11-29 00:39:32,330 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 945 transitions. [2023-11-29 00:39:32,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 945 transitions. [2023-11-29 00:39:32,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:39:32,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 945 transitions. [2023-11-29 00:39:32,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 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) [2023-11-29 00:39:32,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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) [2023-11-29 00:39:32,340 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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) [2023-11-29 00:39:32,340 INFO L175 Difference]: Start difference. First operand has 191 places, 204 transitions, 596 flow. Second operand 5 states and 945 transitions. [2023-11-29 00:39:32,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 232 transitions, 781 flow [2023-11-29 00:39:32,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 232 transitions, 751 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:39:32,383 INFO L231 Difference]: Finished difference. Result has 196 places, 218 transitions, 689 flow [2023-11-29 00:39:32,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=689, PETRI_PLACES=196, PETRI_TRANSITIONS=218} [2023-11-29 00:39:32,384 INFO L281 CegarLoopForPetriNet]: 207 programPoint places, -11 predicate places. [2023-11-29 00:39:32,384 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 218 transitions, 689 flow [2023-11-29 00:39:32,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 181.2) internal successors, (906), 5 states have internal predecessors, (906), 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) [2023-11-29 00:39:32,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:39:32,386 INFO L208 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] [2023-11-29 00:39:32,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:39:32,386 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-29 00:39:32,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:39:32,387 INFO L85 PathProgramCache]: Analyzing trace with hash -2027329442, now seen corresponding path program 2 times [2023-11-29 00:39:32,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:39:32,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738836875] [2023-11-29 00:39:32,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:39:32,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:39:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:39:32,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:39:32,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:39:32,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738836875] [2023-11-29 00:39:32,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738836875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:39:32,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:39:32,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:39:32,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930063360] [2023-11-29 00:39:32,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:39:32,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:39:32,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:39:32,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:39:32,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:39:32,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 216 [2023-11-29 00:39:32,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 218 transitions, 689 flow. Second operand has 3 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) [2023-11-29 00:39:32,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:39:32,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 216 [2023-11-29 00:39:32,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:39:34,578 INFO L124 PetriNetUnfolderBase]: 2580/18703 cut-off events. [2023-11-29 00:39:34,578 INFO L125 PetriNetUnfolderBase]: For 4201/4951 co-relation queries the response was YES. [2023-11-29 00:39:34,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29162 conditions, 18703 events. 2580/18703 cut-off events. For 4201/4951 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 266789 event pairs, 740 based on Foata normal form. 124/15416 useless extension candidates. Maximal degree in co-relation 29153. Up to 2615 conditions per place. [2023-11-29 00:39:34,834 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 19 selfloop transitions, 7 changer transitions 0/213 dead transitions. [2023-11-29 00:39:34,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 213 transitions, 699 flow [2023-11-29 00:39:34,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:39:34,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:39:34,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 572 transitions. [2023-11-29 00:39:34,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8827160493827161 [2023-11-29 00:39:34,838 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 572 transitions. [2023-11-29 00:39:34,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 572 transitions. [2023-11-29 00:39:34,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:39:34,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 572 transitions. [2023-11-29 00:39:34,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:39:34,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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) [2023-11-29 00:39:34,844 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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) [2023-11-29 00:39:34,844 INFO L175 Difference]: Start difference. First operand has 196 places, 218 transitions, 689 flow. Second operand 3 states and 572 transitions. [2023-11-29 00:39:34,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 213 transitions, 699 flow [2023-11-29 00:39:34,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 213 transitions, 685 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-29 00:39:34,858 INFO L231 Difference]: Finished difference. Result has 197 places, 208 transitions, 631 flow [2023-11-29 00:39:34,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=631, PETRI_PLACES=197, PETRI_TRANSITIONS=208} [2023-11-29 00:39:34,859 INFO L281 CegarLoopForPetriNet]: 207 programPoint places, -10 predicate places. [2023-11-29 00:39:34,859 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 208 transitions, 631 flow [2023-11-29 00:39:34,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2023-11-29 00:39:34,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:39:34,860 INFO L208 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] [2023-11-29 00:39:34,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:39:34,861 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-29 00:39:34,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:39:34,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1023131579, now seen corresponding path program 1 times [2023-11-29 00:39:34,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:39:34,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961486546] [2023-11-29 00:39:34,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:39:34,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:39:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:39:34,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:39:34,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:39:34,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961486546] [2023-11-29 00:39:34,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961486546] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:39:34,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:39:34,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:39:34,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926647399] [2023-11-29 00:39:34,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:39:34,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:39:34,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:39:34,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:39:34,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:39:34,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 216 [2023-11-29 00:39:34,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 208 transitions, 631 flow. Second operand has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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) [2023-11-29 00:39:34,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:39:34,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 216 [2023-11-29 00:39:34,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:39:39,186 INFO L124 PetriNetUnfolderBase]: 5696/32229 cut-off events. [2023-11-29 00:39:39,187 INFO L125 PetriNetUnfolderBase]: For 12391/13563 co-relation queries the response was YES. [2023-11-29 00:39:39,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54606 conditions, 32229 events. 5696/32229 cut-off events. For 12391/13563 co-relation queries the response was YES. Maximal size of possible extension queue 1320. Compared 491346 event pairs, 2140 based on Foata normal form. 3/26222 useless extension candidates. Maximal degree in co-relation 54597. Up to 3938 conditions per place. [2023-11-29 00:39:39,457 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 33 selfloop transitions, 5 changer transitions 0/220 dead transitions. [2023-11-29 00:39:39,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 220 transitions, 761 flow [2023-11-29 00:39:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:39:39,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:39:39,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2023-11-29 00:39:39,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8703703703703703 [2023-11-29 00:39:39,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 564 transitions. [2023-11-29 00:39:39,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 564 transitions. [2023-11-29 00:39:39,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:39:39,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 564 transitions. [2023-11-29 00:39:39,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 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) [2023-11-29 00:39:39,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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) [2023-11-29 00:39:39,465 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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) [2023-11-29 00:39:39,465 INFO L175 Difference]: Start difference. First operand has 197 places, 208 transitions, 631 flow. Second operand 3 states and 564 transitions. [2023-11-29 00:39:39,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 220 transitions, 761 flow [2023-11-29 00:39:39,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 220 transitions, 741 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:39:39,488 INFO L231 Difference]: Finished difference. Result has 199 places, 212 transitions, 655 flow [2023-11-29 00:39:39,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=199, PETRI_TRANSITIONS=212} [2023-11-29 00:39:39,489 INFO L281 CegarLoopForPetriNet]: 207 programPoint places, -8 predicate places. [2023-11-29 00:39:39,489 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 212 transitions, 655 flow [2023-11-29 00:39:39,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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) [2023-11-29 00:39:39,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:39:39,490 INFO L208 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] [2023-11-29 00:39:39,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:39:39,491 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-29 00:39:39,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:39:39,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1214123678, now seen corresponding path program 1 times [2023-11-29 00:39:39,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:39:39,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116153893] [2023-11-29 00:39:39,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:39:39,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:39:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:39:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:39:39,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:39:39,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116153893] [2023-11-29 00:39:39,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116153893] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:39:39,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:39:39,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:39:39,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925850436] [2023-11-29 00:39:39,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:39:39,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:39:39,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:39:39,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:39:39,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:39:39,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 216 [2023-11-29 00:39:39,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 212 transitions, 655 flow. Second operand has 3 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) [2023-11-29 00:39:39,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:39:39,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 216 [2023-11-29 00:39:39,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:39:44,387 INFO L124 PetriNetUnfolderBase]: 6966/41333 cut-off events. [2023-11-29 00:39:44,387 INFO L125 PetriNetUnfolderBase]: For 17662/22469 co-relation queries the response was YES. [2023-11-29 00:39:44,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72246 conditions, 41333 events. 6966/41333 cut-off events. For 17662/22469 co-relation queries the response was YES. Maximal size of possible extension queue 1791. Compared 663353 event pairs, 2442 based on Foata normal form. 115/34051 useless extension candidates. Maximal degree in co-relation 72236. Up to 6960 conditions per place. [2023-11-29 00:39:44,783 INFO L140 encePairwiseOnDemand]: 208/216 looper letters, 43 selfloop transitions, 12 changer transitions 0/225 dead transitions. [2023-11-29 00:39:44,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 225 transitions, 827 flow [2023-11-29 00:39:44,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:39:44,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:39:44,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions. [2023-11-29 00:39:44,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8626543209876543 [2023-11-29 00:39:44,786 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 559 transitions. [2023-11-29 00:39:44,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 559 transitions. [2023-11-29 00:39:44,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:39:44,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 559 transitions. [2023-11-29 00:39:44,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 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) [2023-11-29 00:39:44,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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) [2023-11-29 00:39:44,790 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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) [2023-11-29 00:39:44,790 INFO L175 Difference]: Start difference. First operand has 199 places, 212 transitions, 655 flow. Second operand 3 states and 559 transitions. [2023-11-29 00:39:44,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 225 transitions, 827 flow [2023-11-29 00:39:44,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 225 transitions, 817 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:39:44,951 INFO L231 Difference]: Finished difference. Result has 201 places, 222 transitions, 767 flow [2023-11-29 00:39:44,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=201, PETRI_TRANSITIONS=222} [2023-11-29 00:39:44,952 INFO L281 CegarLoopForPetriNet]: 207 programPoint places, -6 predicate places. [2023-11-29 00:39:44,952 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 222 transitions, 767 flow [2023-11-29 00:39:44,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2023-11-29 00:39:44,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:39:44,953 INFO L208 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] [2023-11-29 00:39:44,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:39:44,953 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr5ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-29 00:39:44,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:39:44,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1269524252, now seen corresponding path program 1 times [2023-11-29 00:39:44,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:39:44,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902352480] [2023-11-29 00:39:44,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:39:44,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:39:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:39:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:39:44,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:39:44,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902352480] [2023-11-29 00:39:44,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902352480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:39:44,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:39:44,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:39:44,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520730506] [2023-11-29 00:39:44,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:39:44,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:39:44,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:39:44,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:39:44,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:39:45,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 216 [2023-11-29 00:39:45,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 222 transitions, 767 flow. Second operand has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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) [2023-11-29 00:39:45,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:39:45,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 216 [2023-11-29 00:39:45,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:39:48,126 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][212], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 9#L699-3true, 122#L718-4true, 276#(= |#race~y~0| 0), 134#L700-1true, Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 97#L708-3true, 95#L708-4true, Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), 268#true, Black: 243#true, 228#true, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-29 00:39:48,126 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-29 00:39:48,126 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-29 00:39:48,126 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-29 00:39:48,126 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-29 00:39:48,617 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][151], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 18#L700true, 122#L718-4true, 276#(= |#race~y~0| 0), Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), 97#L708-3true, Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 52#L700-1true, 95#L708-4true, Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 268#true, Black: 243#true, 228#true, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-29 00:39:48,617 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-29 00:39:48,617 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 00:39:48,617 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 00:39:48,617 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 00:39:48,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][151], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 24#L700true, 122#L718-4true, 276#(= |#race~y~0| 0), 134#L700-1true, Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), 97#L708-3true, Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 95#L708-4true, Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 268#true, Black: 243#true, 228#true, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-29 00:39:48,652 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-29 00:39:48,652 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 00:39:48,652 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 00:39:48,652 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 00:39:48,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][212], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 9#L699-3true, 122#L718-4true, 276#(= |#race~y~0| 0), Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), 97#L708-3true, Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 95#L708-4true, Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), 40#L700-3true, 268#true, Black: 243#true, 228#true, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-29 00:39:48,695 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2023-11-29 00:39:48,695 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-29 00:39:48,695 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-29 00:39:48,695 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-29 00:39:48,811 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][211], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 122#L718-4true, 276#(= |#race~y~0| 0), Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 97#L708-3true, 95#L708-4true, Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 268#true, Black: 243#true, 35#L699-3true, 228#true, 121#writerErr4ASSERT_VIOLATIONDATA_RACEtrue, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-29 00:39:48,811 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2023-11-29 00:39:48,811 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 00:39:48,812 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 00:39:48,812 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 00:39:49,104 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][151], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 18#L700true, 193#L700-3true, 122#L718-4true, 276#(= |#race~y~0| 0), Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 97#L708-3true, 95#L708-4true, Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), 268#true, Black: 243#true, 228#true, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-29 00:39:49,104 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2023-11-29 00:39:49,104 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 00:39:49,104 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 00:39:49,105 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 00:39:49,199 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][151], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 24#L700true, 122#L718-4true, 276#(= |#race~y~0| 0), Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 97#L708-3true, 95#L708-4true, 40#L700-3true, Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), 268#true, Black: 243#true, 228#true, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-29 00:39:49,200 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2023-11-29 00:39:49,200 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 00:39:49,200 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 00:39:49,200 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 00:39:49,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][151], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 18#L700true, 122#L718-4true, 276#(= |#race~y~0| 0), Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 97#L708-3true, 95#L708-4true, 125#L700-4true, Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 268#true, Black: 243#true, 228#true, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-29 00:39:49,297 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2023-11-29 00:39:49,297 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 00:39:49,297 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 00:39:49,297 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 00:39:49,329 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][151], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 18#L700true, 122#L718-4true, 276#(= |#race~y~0| 0), Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), 97#L708-3true, Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 95#L708-4true, Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 268#true, Black: 243#true, 228#true, 121#writerErr4ASSERT_VIOLATIONDATA_RACEtrue, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-29 00:39:49,329 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2023-11-29 00:39:49,329 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 00:39:49,329 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 00:39:49,329 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 00:39:49,486 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][151], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 18#L700true, 114#L701true, 122#L718-4true, 276#(= |#race~y~0| 0), Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 97#L708-3true, 95#L708-4true, Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 268#true, Black: 243#true, 228#true, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-29 00:39:49,486 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-11-29 00:39:49,486 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-29 00:39:49,486 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-29 00:39:49,486 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-29 00:39:50,886 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][151], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 18#L700true, 192#L719-7true, 276#(= |#race~y~0| 0), Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 97#L708-3true, 95#L708-4true, Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 268#true, Black: 243#true, 228#true, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-29 00:39:50,886 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2023-11-29 00:39:50,886 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 00:39:50,886 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 00:39:50,886 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 00:39:51,294 INFO L124 PetriNetUnfolderBase]: 9140/54896 cut-off events. [2023-11-29 00:39:51,295 INFO L125 PetriNetUnfolderBase]: For 29217/32551 co-relation queries the response was YES. [2023-11-29 00:39:51,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100021 conditions, 54896 events. 9140/54896 cut-off events. For 29217/32551 co-relation queries the response was YES. Maximal size of possible extension queue 2493. Compared 921638 event pairs, 1959 based on Foata normal form. 246/46351 useless extension candidates. Maximal degree in co-relation 100010. Up to 7248 conditions per place. [2023-11-29 00:39:51,795 INFO L140 encePairwiseOnDemand]: 208/216 looper letters, 39 selfloop transitions, 7 changer transitions 0/240 dead transitions. [2023-11-29 00:39:51,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 240 transitions, 937 flow [2023-11-29 00:39:51,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:39:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:39:51,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 570 transitions. [2023-11-29 00:39:51,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8796296296296297 [2023-11-29 00:39:51,798 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 570 transitions. [2023-11-29 00:39:51,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 570 transitions. [2023-11-29 00:39:51,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:39:51,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 570 transitions. [2023-11-29 00:39:51,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 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) [2023-11-29 00:39:51,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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) [2023-11-29 00:39:51,802 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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) [2023-11-29 00:39:51,802 INFO L175 Difference]: Start difference. First operand has 201 places, 222 transitions, 767 flow. Second operand 3 states and 570 transitions. [2023-11-29 00:39:51,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 240 transitions, 937 flow [2023-11-29 00:39:51,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 240 transitions, 897 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-29 00:39:51,877 INFO L231 Difference]: Finished difference. Result has 203 places, 228 transitions, 789 flow [2023-11-29 00:39:51,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=789, PETRI_PLACES=203, PETRI_TRANSITIONS=228} [2023-11-29 00:39:51,878 INFO L281 CegarLoopForPetriNet]: 207 programPoint places, -4 predicate places. [2023-11-29 00:39:51,878 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 228 transitions, 789 flow [2023-11-29 00:39:51,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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) [2023-11-29 00:39:51,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:39:51,879 INFO L208 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] [2023-11-29 00:39:51,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:39:51,879 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting writerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-29 00:39:51,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:39:51,879 INFO L85 PathProgramCache]: Analyzing trace with hash 8790168, now seen corresponding path program 1 times [2023-11-29 00:39:51,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:39:51,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684186530] [2023-11-29 00:39:51,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:39:51,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:39:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:39:51,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:39:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:39:51,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:39:51,940 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:39:51,941 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location writerErr4ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2023-11-29 00:39:51,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2023-11-29 00:39:51,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2023-11-29 00:39:51,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2023-11-29 00:39:51,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2023-11-29 00:39:51,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2023-11-29 00:39:51,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2023-11-29 00:39:51,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2023-11-29 00:39:51,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2023-11-29 00:39:51,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2023-11-29 00:39:51,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2023-11-29 00:39:51,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2023-11-29 00:39:51,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2023-11-29 00:39:51,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2023-11-29 00:39:51,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 50 remaining) [2023-11-29 00:39:51,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 50 remaining) [2023-11-29 00:39:51,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 50 remaining) [2023-11-29 00:39:51,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 50 remaining) [2023-11-29 00:39:51,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2023-11-29 00:39:51,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2023-11-29 00:39:51,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2023-11-29 00:39:51,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2023-11-29 00:39:51,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2023-11-29 00:39:51,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2023-11-29 00:39:51,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2023-11-29 00:39:51,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2023-11-29 00:39:51,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2023-11-29 00:39:51,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2023-11-29 00:39:51,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2023-11-29 00:39:51,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2023-11-29 00:39:51,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (19 of 50 remaining) [2023-11-29 00:39:51,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (18 of 50 remaining) [2023-11-29 00:39:51,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2023-11-29 00:39:51,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2023-11-29 00:39:51,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2023-11-29 00:39:51,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2023-11-29 00:39:51,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2023-11-29 00:39:51,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2023-11-29 00:39:51,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2023-11-29 00:39:51,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2023-11-29 00:39:51,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2023-11-29 00:39:51,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2023-11-29 00:39:51,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2023-11-29 00:39:51,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2023-11-29 00:39:51,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2023-11-29 00:39:51,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2023-11-29 00:39:51,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2023-11-29 00:39:51,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2023-11-29 00:39:51,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2023-11-29 00:39:51,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2023-11-29 00:39:51,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:39:51,953 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:39:51,960 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 00:39:51,960 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:39:51,997 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre10 could not be translated [2023-11-29 00:39:51,998 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated [2023-11-29 00:39:51,999 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-29 00:39:52,000 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-29 00:39:52,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:39:52 BasicIcfg [2023-11-29 00:39:52,008 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:39:52,009 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:39:52,009 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:39:52,009 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:39:52,009 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:39:18" (3/4) ... [2023-11-29 00:39:52,011 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 00:39:52,012 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:39:52,013 INFO L158 Benchmark]: Toolchain (without parser) took 34906.70ms. Allocated memory was 169.9MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 120.2MB in the beginning and 5.9GB in the end (delta: -5.7GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2023-11-29 00:39:52,013 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 169.9MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:39:52,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 485.33ms. Allocated memory is still 169.9MB. Free memory was 120.1MB in the beginning and 100.0MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 00:39:52,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.55ms. Allocated memory is still 169.9MB. Free memory was 99.9MB in the beginning and 97.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:39:52,014 INFO L158 Benchmark]: Boogie Preprocessor took 34.01ms. Allocated memory is still 169.9MB. Free memory was 97.3MB in the beginning and 95.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:39:52,014 INFO L158 Benchmark]: RCFGBuilder took 585.75ms. Allocated memory was 169.9MB in the beginning and 216.0MB in the end (delta: 46.1MB). Free memory was 95.4MB in the beginning and 170.4MB in the end (delta: -75.1MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2023-11-29 00:39:52,015 INFO L158 Benchmark]: TraceAbstraction took 33737.13ms. Allocated memory was 216.0MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 170.4MB in the beginning and 5.9GB in the end (delta: -5.7GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2023-11-29 00:39:52,015 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 7.9GB. Free memory was 5.9GB in the beginning and 5.9GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:39:52,017 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 169.9MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 485.33ms. Allocated memory is still 169.9MB. Free memory was 120.1MB in the beginning and 100.0MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.55ms. Allocated memory is still 169.9MB. Free memory was 99.9MB in the beginning and 97.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.01ms. Allocated memory is still 169.9MB. Free memory was 97.3MB in the beginning and 95.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 585.75ms. Allocated memory was 169.9MB in the beginning and 216.0MB in the end (delta: 46.1MB). Free memory was 95.4MB in the beginning and 170.4MB in the end (delta: -75.1MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * TraceAbstraction took 33737.13ms. Allocated memory was 216.0MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 170.4MB in the beginning and 5.9GB in the end (delta: -5.7GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 7.9GB. Free memory was 5.9GB in the beginning and 5.9GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 700]: Data race detected [2023-11-29 00:39:52,042 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre10 could not be translated [2023-11-29 00:39:52,042 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated [2023-11-29 00:39:52,043 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-29 00:39:52,044 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-29 00:39:52,060 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre10 could not be translated [2023-11-29 00:39:52,061 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated [2023-11-29 00:39:52,062 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-29 00:39:52,062 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated 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 [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 [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() [L704] 2 int l; VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=0, y=0] [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, 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, 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: 716]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) 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, 279 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: 33.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 32.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 241 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 418 IncrementalHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 52 mSDtfsCounter, 418 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=789occurred in iteration=9, InterpolantAutomatonStates: 28, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 335 NumberOfCodeBlocks, 335 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 462 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! [2023-11-29 00:39:52,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ee0b4a4-0ebe-4c2c-9f67-78633d9c215a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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