./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-atomic/dekker-b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983fb3af-0e98-49f5-b4d5-fc890b610bbf/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983fb3af-0e98-49f5-b4d5-fc890b610bbf/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_983fb3af-0e98-49f5-b4d5-fc890b610bbf/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983fb3af-0e98-49f5-b4d5-fc890b610bbf/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-atomic/dekker-b.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983fb3af-0e98-49f5-b4d5-fc890b610bbf/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_983fb3af-0e98-49f5-b4d5-fc890b610bbf/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 8495a4f5aea7cc78cc34cbe091df9506d17978f2685019ca49cb76f0e1f4a919 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:10:20,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:10:20,632 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983fb3af-0e98-49f5-b4d5-fc890b610bbf/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 00:10:20,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:10:20,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:10:20,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:10:20,663 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:10:20,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:10:20,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:10:20,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:10:20,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:10:20,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:10:20,667 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:10:20,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:10:20,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:10:20,669 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:10:20,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:10:20,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:10:20,670 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:10:20,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:10:20,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:10:20,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:10:20,673 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 00:10:20,673 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:10:20,674 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:10:20,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:10:20,684 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:10:20,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:10:20,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:10:20,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:10:20,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:10:20,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:10:20,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:10:20,687 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:10:20,687 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:10:20,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:10:20,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:10:20,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:10:20,688 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:10:20,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:10:20,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:10:20,688 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_983fb3af-0e98-49f5-b4d5-fc890b610bbf/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_983fb3af-0e98-49f5-b4d5-fc890b610bbf/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 -> 8495a4f5aea7cc78cc34cbe091df9506d17978f2685019ca49cb76f0e1f4a919 [2023-11-29 00:10:20,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:10:20,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:10:20,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:10:20,922 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:10:20,922 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:10:20,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983fb3af-0e98-49f5-b4d5-fc890b610bbf/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-atomic/dekker-b.i [2023-11-29 00:10:23,728 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:10:23,941 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:10:23,942 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983fb3af-0e98-49f5-b4d5-fc890b610bbf/sv-benchmarks/c/pthread-atomic/dekker-b.i [2023-11-29 00:10:23,957 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983fb3af-0e98-49f5-b4d5-fc890b610bbf/bin/uautomizer-verify-BQ2R08f2Ya/data/277329454/703f636c494d4ec0bac0a6f15281b6ee/FLAG24b20f131 [2023-11-29 00:10:23,970 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983fb3af-0e98-49f5-b4d5-fc890b610bbf/bin/uautomizer-verify-BQ2R08f2Ya/data/277329454/703f636c494d4ec0bac0a6f15281b6ee [2023-11-29 00:10:23,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:10:23,973 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:10:23,974 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:10:23,974 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:10:23,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:10:23,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:10:23" (1/1) ... [2023-11-29 00:10:23,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@253e9a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:23, skipping insertion in model container [2023-11-29 00:10:23,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:10:23" (1/1) ... [2023-11-29 00:10:24,030 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:10:24,313 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:10:24,324 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:10:24,370 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:10:24,408 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:10:24,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24 WrapperNode [2023-11-29 00:10:24,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:10:24,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:10:24,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:10:24,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:10:24,417 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:10:24" (1/1) ... [2023-11-29 00:10:24,431 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:10:24" (1/1) ... [2023-11-29 00:10:24,457 INFO L138 Inliner]: procedures = 168, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 178 [2023-11-29 00:10:24,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:10:24,458 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:10:24,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:10:24,459 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:10:24,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24" (1/1) ... [2023-11-29 00:10:24,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24" (1/1) ... [2023-11-29 00:10:24,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24" (1/1) ... [2023-11-29 00:10:24,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24" (1/1) ... [2023-11-29 00:10:24,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24" (1/1) ... [2023-11-29 00:10:24,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24" (1/1) ... [2023-11-29 00:10:24,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24" (1/1) ... [2023-11-29 00:10:24,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24" (1/1) ... [2023-11-29 00:10:24,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:10:24,495 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:10:24,495 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:10:24,496 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:10:24,497 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24" (1/1) ... [2023-11-29 00:10:24,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:10:24,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983fb3af-0e98-49f5-b4d5-fc890b610bbf/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:10:24,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983fb3af-0e98-49f5-b4d5-fc890b610bbf/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:10:24,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983fb3af-0e98-49f5-b4d5-fc890b610bbf/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:10:24,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 00:10:24,556 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2023-11-29 00:10:24,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2023-11-29 00:10:24,557 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-29 00:10:24,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-29 00:10:24,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 00:10:24,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:10:24,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:10:24,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:10:24,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 00:10:24,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:10:24,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:10:24,560 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:10:24,677 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:10:24,679 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:10:24,926 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:10:24,940 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:10:24,940 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 00:10:24,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:24 BoogieIcfgContainer [2023-11-29 00:10:24,942 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:10:24,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:10:24,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:10:24,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:10:24,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:10:23" (1/3) ... [2023-11-29 00:10:24,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c007c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:10:24, skipping insertion in model container [2023-11-29 00:10:24,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:24" (2/3) ... [2023-11-29 00:10:24,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c007c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:10:24, skipping insertion in model container [2023-11-29 00:10:24,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:24" (3/3) ... [2023-11-29 00:10:24,952 INFO L112 eAbstractionObserver]: Analyzing ICFG dekker-b.i [2023-11-29 00:10:24,961 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 00:10:24,973 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:10:24,973 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-11-29 00:10:24,973 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:10:25,063 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 00:10:25,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 209 transitions, 432 flow [2023-11-29 00:10:25,219 INFO L124 PetriNetUnfolderBase]: 16/207 cut-off events. [2023-11-29 00:10:25,219 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 00:10:25,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 207 events. 16/207 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 516 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 155. Up to 3 conditions per place. [2023-11-29 00:10:25,228 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 209 transitions, 432 flow [2023-11-29 00:10:25,236 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 188 places, 197 transitions, 403 flow [2023-11-29 00:10:25,248 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:10:25,255 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;@37b903bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:10:25,255 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2023-11-29 00:10:25,260 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:10:25,261 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2023-11-29 00:10:25,261 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:10:25,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:10:25,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:10:25,262 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-11-29 00:10:25,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:10:25,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1856580890, now seen corresponding path program 1 times [2023-11-29 00:10:25,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:10:25,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248429273] [2023-11-29 00:10:25,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:10:25,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:10:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:25,483 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:10:25,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:10:25,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248429273] [2023-11-29 00:10:25,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248429273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:10:25,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:10:25,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:10:25,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893231202] [2023-11-29 00:10:25,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:10:25,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:10:25,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:10:25,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:10:25,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:10:25,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 209 [2023-11-29 00:10:25,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 197 transitions, 403 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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:10:25,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:10:25,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 209 [2023-11-29 00:10:25,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:10:25,790 INFO L124 PetriNetUnfolderBase]: 98/844 cut-off events. [2023-11-29 00:10:25,790 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-11-29 00:10:25,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1018 conditions, 844 events. 98/844 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5365 event pairs, 23 based on Foata normal form. 66/734 useless extension candidates. Maximal degree in co-relation 826. Up to 99 conditions per place. [2023-11-29 00:10:25,803 INFO L140 encePairwiseOnDemand]: 183/209 looper letters, 22 selfloop transitions, 11 changer transitions 1/192 dead transitions. [2023-11-29 00:10:25,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 192 transitions, 465 flow [2023-11-29 00:10:25,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:10:25,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:10:25,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 578 transitions. [2023-11-29 00:10:25,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9218500797448166 [2023-11-29 00:10:25,821 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 578 transitions. [2023-11-29 00:10:25,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 578 transitions. [2023-11-29 00:10:25,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:10:25,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 578 transitions. [2023-11-29 00:10:25,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 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:10:25,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:10:25,839 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:10:25,841 INFO L175 Difference]: Start difference. First operand has 188 places, 197 transitions, 403 flow. Second operand 3 states and 578 transitions. [2023-11-29 00:10:25,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 192 transitions, 465 flow [2023-11-29 00:10:25,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 192 transitions, 457 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 00:10:25,853 INFO L231 Difference]: Finished difference. Result has 181 places, 189 transitions, 454 flow [2023-11-29 00:10:25,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=181, PETRI_TRANSITIONS=189} [2023-11-29 00:10:25,859 INFO L281 CegarLoopForPetriNet]: 188 programPoint places, -7 predicate places. [2023-11-29 00:10:25,859 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 189 transitions, 454 flow [2023-11-29 00:10:25,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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:10:25,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:10:25,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] [2023-11-29 00:10:25,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:10:25,861 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-11-29 00:10:25,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:10:25,862 INFO L85 PathProgramCache]: Analyzing trace with hash 804345033, now seen corresponding path program 1 times [2023-11-29 00:10:25,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:10:25,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087295267] [2023-11-29 00:10:25,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:10:25,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:10:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:26,003 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:10:26,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:10:26,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087295267] [2023-11-29 00:10:26,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087295267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:10:26,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:10:26,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:10:26,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26446179] [2023-11-29 00:10:26,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:10:26,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:10:26,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:10:26,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:10:26,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:10:26,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 209 [2023-11-29 00:10:26,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 189 transitions, 454 flow. Second operand has 4 states, 4 states have (on average 179.5) internal successors, (718), 4 states have internal predecessors, (718), 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:10:26,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:10:26,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 209 [2023-11-29 00:10:26,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:10:26,190 INFO L124 PetriNetUnfolderBase]: 73/715 cut-off events. [2023-11-29 00:10:26,190 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-11-29 00:10:26,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 715 events. 73/715 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4469 event pairs, 15 based on Foata normal form. 6/591 useless extension candidates. Maximal degree in co-relation 842. Up to 62 conditions per place. [2023-11-29 00:10:26,198 INFO L140 encePairwiseOnDemand]: 198/209 looper letters, 14 selfloop transitions, 7 changer transitions 0/192 dead transitions. [2023-11-29 00:10:26,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 192 transitions, 504 flow [2023-11-29 00:10:26,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:10:26,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:10:26,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 737 transitions. [2023-11-29 00:10:26,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.881578947368421 [2023-11-29 00:10:26,202 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 737 transitions. [2023-11-29 00:10:26,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 737 transitions. [2023-11-29 00:10:26,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:10:26,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 737 transitions. [2023-11-29 00:10:26,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.25) internal successors, (737), 4 states have internal predecessors, (737), 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:10:26,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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:10:26,210 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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:10:26,210 INFO L175 Difference]: Start difference. First operand has 181 places, 189 transitions, 454 flow. Second operand 4 states and 737 transitions. [2023-11-29 00:10:26,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 192 transitions, 504 flow [2023-11-29 00:10:26,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 192 transitions, 482 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:10:26,219 INFO L231 Difference]: Finished difference. Result has 183 places, 191 transitions, 474 flow [2023-11-29 00:10:26,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=474, PETRI_PLACES=183, PETRI_TRANSITIONS=191} [2023-11-29 00:10:26,221 INFO L281 CegarLoopForPetriNet]: 188 programPoint places, -5 predicate places. [2023-11-29 00:10:26,221 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 191 transitions, 474 flow [2023-11-29 00:10:26,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 179.5) internal successors, (718), 4 states have internal predecessors, (718), 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:10:26,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:10:26,222 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] [2023-11-29 00:10:26,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:10:26,223 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-11-29 00:10:26,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:10:26,223 INFO L85 PathProgramCache]: Analyzing trace with hash -770273536, now seen corresponding path program 1 times [2023-11-29 00:10:26,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:10:26,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779754071] [2023-11-29 00:10:26,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:10:26,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:10:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:26,270 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:10:26,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:10:26,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779754071] [2023-11-29 00:10:26,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779754071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:10:26,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:10:26,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:10:26,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63804131] [2023-11-29 00:10:26,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:10:26,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:10:26,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:10:26,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:10:26,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:10:26,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 209 [2023-11-29 00:10:26,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 191 transitions, 474 flow. Second operand has 3 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:10:26,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:10:26,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 209 [2023-11-29 00:10:26,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:10:26,459 INFO L124 PetriNetUnfolderBase]: 75/907 cut-off events. [2023-11-29 00:10:26,460 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-29 00:10:26,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 907 events. 75/907 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5991 event pairs, 16 based on Foata normal form. 0/751 useless extension candidates. Maximal degree in co-relation 937. Up to 75 conditions per place. [2023-11-29 00:10:26,469 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 12 selfloop transitions, 4 changer transitions 0/195 dead transitions. [2023-11-29 00:10:26,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 195 transitions, 516 flow [2023-11-29 00:10:26,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:10:26,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:10:26,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 572 transitions. [2023-11-29 00:10:26,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9122807017543859 [2023-11-29 00:10:26,472 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 572 transitions. [2023-11-29 00:10:26,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 572 transitions. [2023-11-29 00:10:26,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:10:26,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 572 transitions. [2023-11-29 00:10:26,475 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:10:26,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:10:26,479 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:10:26,479 INFO L175 Difference]: Start difference. First operand has 183 places, 191 transitions, 474 flow. Second operand 3 states and 572 transitions. [2023-11-29 00:10:26,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 195 transitions, 516 flow [2023-11-29 00:10:26,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 195 transitions, 514 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:10:26,487 INFO L231 Difference]: Finished difference. Result has 186 places, 194 transitions, 502 flow [2023-11-29 00:10:26,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=186, PETRI_TRANSITIONS=194} [2023-11-29 00:10:26,488 INFO L281 CegarLoopForPetriNet]: 188 programPoint places, -2 predicate places. [2023-11-29 00:10:26,489 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 194 transitions, 502 flow [2023-11-29 00:10:26,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:10:26,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:10:26,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, 1, 1] [2023-11-29 00:10:26,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:10:26,490 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-11-29 00:10:26,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:10:26,491 INFO L85 PathProgramCache]: Analyzing trace with hash 791937457, now seen corresponding path program 1 times [2023-11-29 00:10:26,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:10:26,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816212136] [2023-11-29 00:10:26,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:10:26,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:10:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:26,537 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:10:26,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:10:26,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816212136] [2023-11-29 00:10:26,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816212136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:10:26,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:10:26,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:10:26,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547981586] [2023-11-29 00:10:26,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:10:26,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:10:26,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:10:26,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:10:26,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:10:26,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 209 [2023-11-29 00:10:26,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 194 transitions, 502 flow. Second operand has 3 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:10:26,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:10:26,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 209 [2023-11-29 00:10:26,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:10:26,781 INFO L124 PetriNetUnfolderBase]: 135/1418 cut-off events. [2023-11-29 00:10:26,782 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2023-11-29 00:10:26,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1853 conditions, 1418 events. 135/1418 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 11545 event pairs, 18 based on Foata normal form. 0/1180 useless extension candidates. Maximal degree in co-relation 1746. Up to 119 conditions per place. [2023-11-29 00:10:26,796 INFO L140 encePairwiseOnDemand]: 202/209 looper letters, 12 selfloop transitions, 6 changer transitions 0/202 dead transitions. [2023-11-29 00:10:26,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 202 transitions, 557 flow [2023-11-29 00:10:26,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:10:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:10:26,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2023-11-29 00:10:26,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9250398724082934 [2023-11-29 00:10:26,800 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 580 transitions. [2023-11-29 00:10:26,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions. [2023-11-29 00:10:26,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:10:26,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions. [2023-11-29 00:10:26,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 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:10:26,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:10:26,806 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:10:26,806 INFO L175 Difference]: Start difference. First operand has 186 places, 194 transitions, 502 flow. Second operand 3 states and 580 transitions. [2023-11-29 00:10:26,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 202 transitions, 557 flow [2023-11-29 00:10:26,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 202 transitions, 549 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:10:26,812 INFO L231 Difference]: Finished difference. Result has 188 places, 200 transitions, 544 flow [2023-11-29 00:10:26,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=544, PETRI_PLACES=188, PETRI_TRANSITIONS=200} [2023-11-29 00:10:26,814 INFO L281 CegarLoopForPetriNet]: 188 programPoint places, 0 predicate places. [2023-11-29 00:10:26,814 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 200 transitions, 544 flow [2023-11-29 00:10:26,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:10:26,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:10:26,815 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, 1, 1, 1] [2023-11-29 00:10:26,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:10:26,815 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-11-29 00:10:26,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:10:26,816 INFO L85 PathProgramCache]: Analyzing trace with hash 884993472, now seen corresponding path program 1 times [2023-11-29 00:10:26,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:10:26,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706144038] [2023-11-29 00:10:26,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:10:26,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:10:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:26,859 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:10:26,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:10:26,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706144038] [2023-11-29 00:10:26,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706144038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:10:26,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:10:26,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:10:26,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593217410] [2023-11-29 00:10:26,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:10:26,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:10:26,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:10:26,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:10:26,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:10:26,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 209 [2023-11-29 00:10:26,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 200 transitions, 544 flow. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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:10:26,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:10:26,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 209 [2023-11-29 00:10:26,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:10:27,162 INFO L124 PetriNetUnfolderBase]: 182/1599 cut-off events. [2023-11-29 00:10:27,163 INFO L125 PetriNetUnfolderBase]: For 234/247 co-relation queries the response was YES. [2023-11-29 00:10:27,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2276 conditions, 1599 events. 182/1599 cut-off events. For 234/247 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 13383 event pairs, 29 based on Foata normal form. 0/1324 useless extension candidates. Maximal degree in co-relation 1306. Up to 139 conditions per place. [2023-11-29 00:10:27,178 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 16 selfloop transitions, 6 changer transitions 0/205 dead transitions. [2023-11-29 00:10:27,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 205 transitions, 605 flow [2023-11-29 00:10:27,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:10:27,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:10:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 572 transitions. [2023-11-29 00:10:27,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9122807017543859 [2023-11-29 00:10:27,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 572 transitions. [2023-11-29 00:10:27,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 572 transitions. [2023-11-29 00:10:27,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:10:27,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 572 transitions. [2023-11-29 00:10:27,184 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:10:27,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:10:27,187 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:10:27,187 INFO L175 Difference]: Start difference. First operand has 188 places, 200 transitions, 544 flow. Second operand 3 states and 572 transitions. [2023-11-29 00:10:27,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 205 transitions, 605 flow [2023-11-29 00:10:27,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 205 transitions, 591 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:10:27,194 INFO L231 Difference]: Finished difference. Result has 190 places, 204 transitions, 578 flow [2023-11-29 00:10:27,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=190, PETRI_TRANSITIONS=204} [2023-11-29 00:10:27,196 INFO L281 CegarLoopForPetriNet]: 188 programPoint places, 2 predicate places. [2023-11-29 00:10:27,196 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 204 transitions, 578 flow [2023-11-29 00:10:27,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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:10:27,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:10:27,197 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, 1, 1, 1, 1, 1] [2023-11-29 00:10:27,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:10:27,197 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-11-29 00:10:27,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:10:27,198 INFO L85 PathProgramCache]: Analyzing trace with hash 907322858, now seen corresponding path program 1 times [2023-11-29 00:10:27,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:10:27,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297208822] [2023-11-29 00:10:27,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:10:27,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:10:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:27,237 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:10:27,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:10:27,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297208822] [2023-11-29 00:10:27,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297208822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:10:27,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:10:27,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:10:27,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936713889] [2023-11-29 00:10:27,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:10:27,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:10:27,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:10:27,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:10:27,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:10:27,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 209 [2023-11-29 00:10:27,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 204 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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:10:27,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:10:27,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 209 [2023-11-29 00:10:27,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:10:27,563 INFO L124 PetriNetUnfolderBase]: 201/1869 cut-off events. [2023-11-29 00:10:27,564 INFO L125 PetriNetUnfolderBase]: For 119/122 co-relation queries the response was YES. [2023-11-29 00:10:27,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2620 conditions, 1869 events. 201/1869 cut-off events. For 119/122 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 16610 event pairs, 43 based on Foata normal form. 0/1546 useless extension candidates. Maximal degree in co-relation 1942. Up to 150 conditions per place. [2023-11-29 00:10:27,577 INFO L140 encePairwiseOnDemand]: 203/209 looper letters, 11 selfloop transitions, 5 changer transitions 0/209 dead transitions. [2023-11-29 00:10:27,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 209 transitions, 622 flow [2023-11-29 00:10:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:10:27,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:10:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 575 transitions. [2023-11-29 00:10:27,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9170653907496013 [2023-11-29 00:10:27,579 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 575 transitions. [2023-11-29 00:10:27,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 575 transitions. [2023-11-29 00:10:27,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:10:27,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 575 transitions. [2023-11-29 00:10:27,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:10:27,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:10:27,585 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:10:27,585 INFO L175 Difference]: Start difference. First operand has 190 places, 204 transitions, 578 flow. Second operand 3 states and 575 transitions. [2023-11-29 00:10:27,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 209 transitions, 622 flow [2023-11-29 00:10:27,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 209 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:10:27,591 INFO L231 Difference]: Finished difference. Result has 192 places, 208 transitions, 604 flow [2023-11-29 00:10:27,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=604, PETRI_PLACES=192, PETRI_TRANSITIONS=208} [2023-11-29 00:10:27,592 INFO L281 CegarLoopForPetriNet]: 188 programPoint places, 4 predicate places. [2023-11-29 00:10:27,592 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 208 transitions, 604 flow [2023-11-29 00:10:27,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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:10:27,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:10:27,593 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, 1, 1, 1, 1, 1, 1] [2023-11-29 00:10:27,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:10:27,594 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-11-29 00:10:27,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:10:27,594 INFO L85 PathProgramCache]: Analyzing trace with hash 59536522, now seen corresponding path program 1 times [2023-11-29 00:10:27,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:10:27,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127488262] [2023-11-29 00:10:27,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:10:27,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:10:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:27,959 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:10:27,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:10:27,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127488262] [2023-11-29 00:10:27,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127488262] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:10:27,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:10:27,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:10:27,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128838852] [2023-11-29 00:10:27,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:10:27,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:10:27,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:10:27,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:10:27,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:10:28,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 209 [2023-11-29 00:10:28,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 208 transitions, 604 flow. Second operand has 6 states, 6 states have (on average 185.5) internal successors, (1113), 6 states have internal predecessors, (1113), 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:10:28,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:10:28,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 209 [2023-11-29 00:10:28,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:10:28,267 INFO L124 PetriNetUnfolderBase]: 172/1655 cut-off events. [2023-11-29 00:10:28,268 INFO L125 PetriNetUnfolderBase]: For 112/206 co-relation queries the response was YES. [2023-11-29 00:10:28,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2334 conditions, 1655 events. 172/1655 cut-off events. For 112/206 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 14277 event pairs, 22 based on Foata normal form. 72/1451 useless extension candidates. Maximal degree in co-relation 2274. Up to 129 conditions per place. [2023-11-29 00:10:28,279 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 6 selfloop transitions, 4 changer transitions 0/207 dead transitions. [2023-11-29 00:10:28,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 207 transitions, 622 flow [2023-11-29 00:10:28,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:10:28,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:10:28,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1115 transitions. [2023-11-29 00:10:28,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8891547049441786 [2023-11-29 00:10:28,284 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1115 transitions. [2023-11-29 00:10:28,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1115 transitions. [2023-11-29 00:10:28,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:10:28,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1115 transitions. [2023-11-29 00:10:28,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 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:10:28,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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:10:28,290 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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:10:28,290 INFO L175 Difference]: Start difference. First operand has 192 places, 208 transitions, 604 flow. Second operand 6 states and 1115 transitions. [2023-11-29 00:10:28,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 207 transitions, 622 flow [2023-11-29 00:10:28,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 207 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:10:28,296 INFO L231 Difference]: Finished difference. Result has 194 places, 207 transitions, 600 flow [2023-11-29 00:10:28,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=600, PETRI_PLACES=194, PETRI_TRANSITIONS=207} [2023-11-29 00:10:28,297 INFO L281 CegarLoopForPetriNet]: 188 programPoint places, 6 predicate places. [2023-11-29 00:10:28,297 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 207 transitions, 600 flow [2023-11-29 00:10:28,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.5) internal successors, (1113), 6 states have internal predecessors, (1113), 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:10:28,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:10:28,298 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, 1, 1, 1, 1, 1, 1] [2023-11-29 00:10:28,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:10:28,298 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-11-29 00:10:28,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:10:28,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1963187411, now seen corresponding path program 1 times [2023-11-29 00:10:28,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:10:28,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748802378] [2023-11-29 00:10:28,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:10:28,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:10:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:28,332 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:10:28,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:10:28,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748802378] [2023-11-29 00:10:28,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748802378] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:10:28,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:10:28,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:10:28,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028353019] [2023-11-29 00:10:28,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:10:28,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:10:28,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:10:28,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:10:28,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:10:28,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 209 [2023-11-29 00:10:28,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 207 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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:10:28,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:10:28,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 209 [2023-11-29 00:10:28,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:10:28,473 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([501] L709-->L709-1: Formula: (= |v_#race~turn~0_1| 0) InVars {} OutVars{#race~turn~0=|v_#race~turn~0_1|} AuxVars[] AssignedVars[#race~turn~0][141], [Black: 224#true, 251#(= |#race~flag1~0| 0), 77#L725-4true, thr2Thread1of1ForFork1InUse, Black: 232#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~flag2~0|), 209#true, Black: 203#true, Black: 238#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet6#1|), Black: 211#(= ~turn~0 0), 175#L709-1true, 242#true, Black: 220#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), 121#L702-2true]) [2023-11-29 00:10:28,473 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2023-11-29 00:10:28,473 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 00:10:28,473 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 00:10:28,473 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 00:10:28,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([598] L702-1-->L702-2: Formula: (= |v_#race~turn~0_13| |v_thr1Thread1of1ForFork0_#t~nondet7#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|} OutVars{thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|, #race~turn~0=|v_#race~turn~0_13|} AuxVars[] AssignedVars[#race~turn~0][109], [Black: 224#true, 251#(= |#race~flag1~0| 0), 77#L725-4true, thr2Thread1of1ForFork1InUse, Black: 232#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~flag2~0|), 209#true, Black: 205#(= |#race~turn~0| 0), Black: 238#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet6#1|), Black: 211#(= ~turn~0 0), 175#L709-1true, 242#true, Black: 220#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), 121#L702-2true]) [2023-11-29 00:10:28,482 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2023-11-29 00:10:28,482 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 00:10:28,482 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 00:10:28,482 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 00:10:28,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([508] L709-2-->L709-4: Formula: (= v_~turn~0_4 1) InVars {~turn~0=v_~turn~0_4} OutVars{~turn~0=v_~turn~0_4} AuxVars[] AssignedVars[][134], [Black: 224#true, 251#(= |#race~flag1~0| 0), 77#L725-4true, thr2Thread1of1ForFork1InUse, Black: 232#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~flag2~0|), 209#true, Black: 203#true, Black: 238#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet6#1|), 17#L709-4true, 112#L702true, Black: 211#(= ~turn~0 0), 242#true, Black: 220#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|)]) [2023-11-29 00:10:28,491 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2023-11-29 00:10:28,491 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 00:10:28,491 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 00:10:28,491 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 00:10:28,492 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([598] L702-1-->L702-2: Formula: (= |v_#race~turn~0_13| |v_thr1Thread1of1ForFork0_#t~nondet7#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|} OutVars{thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|, #race~turn~0=|v_#race~turn~0_13|} AuxVars[] AssignedVars[#race~turn~0][109], [Black: 224#true, 251#(= |#race~flag1~0| 0), 77#L725-4true, thr2Thread1of1ForFork1InUse, Black: 232#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~flag2~0|), 209#true, Black: 205#(= |#race~turn~0| 0), Black: 238#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet6#1|), Black: 211#(= ~turn~0 0), 67#L709-2true, 242#true, 121#L702-2true, Black: 220#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|)]) [2023-11-29 00:10:28,492 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2023-11-29 00:10:28,492 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2023-11-29 00:10:28,492 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2023-11-29 00:10:28,492 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2023-11-29 00:10:28,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([616] L703-2-->L703-3: Formula: (= |v_#race~flag1~0_8| |v_thr1Thread1of1ForFork0_#t~nondet8#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet8#1=|v_thr1Thread1of1ForFork0_#t~nondet8#1_3|} OutVars{thr1Thread1of1ForFork0_#t~nondet8#1=|v_thr1Thread1of1ForFork0_#t~nondet8#1_3|, #race~flag1~0=|v_#race~flag1~0_8|} AuxVars[] AssignedVars[#race~flag1~0][154], [Black: 224#true, 77#L725-4true, thr2Thread1of1ForFork1InUse, Black: 232#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~flag2~0|), 87#L708-2true, 209#true, Black: 205#(= |#race~turn~0| 0), Black: 238#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet6#1|), Black: 211#(= ~turn~0 0), 242#true, 64#L703-3true, 249#true, Black: 220#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|)]) [2023-11-29 00:10:28,493 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-29 00:10:28,493 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 00:10:28,494 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 00:10:28,494 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 00:10:28,643 INFO L124 PetriNetUnfolderBase]: 328/2761 cut-off events. [2023-11-29 00:10:28,643 INFO L125 PetriNetUnfolderBase]: For 172/181 co-relation queries the response was YES. [2023-11-29 00:10:28,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3928 conditions, 2761 events. 328/2761 cut-off events. For 172/181 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 27417 event pairs, 42 based on Foata normal form. 2/2281 useless extension candidates. Maximal degree in co-relation 3806. Up to 221 conditions per place. [2023-11-29 00:10:28,663 INFO L140 encePairwiseOnDemand]: 203/209 looper letters, 11 selfloop transitions, 6 changer transitions 0/213 dead transitions. [2023-11-29 00:10:28,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 213 transitions, 651 flow [2023-11-29 00:10:28,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:10:28,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:10:28,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 578 transitions. [2023-11-29 00:10:28,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9218500797448166 [2023-11-29 00:10:28,666 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 578 transitions. [2023-11-29 00:10:28,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 578 transitions. [2023-11-29 00:10:28,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:10:28,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 578 transitions. [2023-11-29 00:10:28,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 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:10:28,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:10:28,670 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:10:28,670 INFO L175 Difference]: Start difference. First operand has 194 places, 207 transitions, 600 flow. Second operand 3 states and 578 transitions. [2023-11-29 00:10:28,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 213 transitions, 651 flow [2023-11-29 00:10:28,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 213 transitions, 644 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 00:10:28,675 INFO L231 Difference]: Finished difference. Result has 194 places, 212 transitions, 643 flow [2023-11-29 00:10:28,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=643, PETRI_PLACES=194, PETRI_TRANSITIONS=212} [2023-11-29 00:10:28,676 INFO L281 CegarLoopForPetriNet]: 188 programPoint places, 6 predicate places. [2023-11-29 00:10:28,676 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 212 transitions, 643 flow [2023-11-29 00:10:28,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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:10:28,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:10:28,677 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:10:28,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:10:28,677 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-11-29 00:10:28,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:10:28,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1826671768, now seen corresponding path program 1 times [2023-11-29 00:10:28,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:10:28,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941700139] [2023-11-29 00:10:28,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:10:28,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:10:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:28,705 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:10:28,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:10:28,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941700139] [2023-11-29 00:10:28,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941700139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:10:28,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:10:28,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:10:28,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283067793] [2023-11-29 00:10:28,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:10:28,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:10:28,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:10:28,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:10:28,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:10:28,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 209 [2023-11-29 00:10:28,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 212 transitions, 643 flow. Second operand has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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:10:28,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:10:28,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 209 [2023-11-29 00:10:28,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:10:28,860 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([501] L709-->L709-1: Formula: (= |v_#race~turn~0_1| 0) InVars {} OutVars{#race~turn~0=|v_#race~turn~0_1|} AuxVars[] AssignedVars[#race~turn~0][145], [Black: 224#true, 251#(= |#race~flag1~0| 0), 77#L725-4true, thr2Thread1of1ForFork1InUse, Black: 232#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~flag2~0|), 209#true, Black: 203#true, Black: 238#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet6#1|), 175#L709-1true, Black: 211#(= ~turn~0 0), 257#(= |#race~x~0| 0), Black: 249#true, Black: 220#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), 121#L702-2true]) [2023-11-29 00:10:28,861 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2023-11-29 00:10:28,861 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 00:10:28,861 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 00:10:28,861 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 00:10:28,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([598] L702-1-->L702-2: Formula: (= |v_#race~turn~0_13| |v_thr1Thread1of1ForFork0_#t~nondet7#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|} OutVars{thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|, #race~turn~0=|v_#race~turn~0_13|} AuxVars[] AssignedVars[#race~turn~0][109], [Black: 224#true, 251#(= |#race~flag1~0| 0), 77#L725-4true, thr2Thread1of1ForFork1InUse, Black: 232#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~flag2~0|), 209#true, Black: 205#(= |#race~turn~0| 0), Black: 238#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet6#1|), 175#L709-1true, Black: 211#(= ~turn~0 0), 257#(= |#race~x~0| 0), Black: 249#true, 121#L702-2true, Black: 220#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|)]) [2023-11-29 00:10:28,873 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2023-11-29 00:10:28,873 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 00:10:28,873 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 00:10:28,873 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 00:10:28,884 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([508] L709-2-->L709-4: Formula: (= v_~turn~0_4 1) InVars {~turn~0=v_~turn~0_4} OutVars{~turn~0=v_~turn~0_4} AuxVars[] AssignedVars[][148], [Black: 224#true, 251#(= |#race~flag1~0| 0), 77#L725-4true, thr2Thread1of1ForFork1InUse, Black: 232#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~flag2~0|), 209#true, Black: 203#true, Black: 238#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet6#1|), 17#L709-4true, 112#L702true, Black: 211#(= ~turn~0 0), 257#(= |#race~x~0| 0), Black: 249#true, Black: 220#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|)]) [2023-11-29 00:10:28,884 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2023-11-29 00:10:28,884 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 00:10:28,885 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 00:10:28,885 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 00:10:28,885 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([598] L702-1-->L702-2: Formula: (= |v_#race~turn~0_13| |v_thr1Thread1of1ForFork0_#t~nondet7#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|} OutVars{thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|, #race~turn~0=|v_#race~turn~0_13|} AuxVars[] AssignedVars[#race~turn~0][109], [Black: 224#true, 251#(= |#race~flag1~0| 0), 77#L725-4true, thr2Thread1of1ForFork1InUse, Black: 232#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~flag2~0|), 209#true, Black: 205#(= |#race~turn~0| 0), Black: 238#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet6#1|), 67#L709-2true, Black: 211#(= ~turn~0 0), 257#(= |#race~x~0| 0), Black: 249#true, Black: 220#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), 121#L702-2true]) [2023-11-29 00:10:28,885 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2023-11-29 00:10:28,885 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2023-11-29 00:10:28,885 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2023-11-29 00:10:28,885 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2023-11-29 00:10:28,887 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([616] L703-2-->L703-3: Formula: (= |v_#race~flag1~0_8| |v_thr1Thread1of1ForFork0_#t~nondet8#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet8#1=|v_thr1Thread1of1ForFork0_#t~nondet8#1_3|} OutVars{thr1Thread1of1ForFork0_#t~nondet8#1=|v_thr1Thread1of1ForFork0_#t~nondet8#1_3|, #race~flag1~0=|v_#race~flag1~0_8|} AuxVars[] AssignedVars[#race~flag1~0][155], [Black: 224#true, 77#L725-4true, thr2Thread1of1ForFork1InUse, Black: 232#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~flag2~0|), 87#L708-2true, 209#true, Black: 205#(= |#race~turn~0| 0), Black: 238#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet6#1|), Black: 211#(= ~turn~0 0), 257#(= |#race~x~0| 0), 249#true, 64#L703-3true, Black: 251#(= |#race~flag1~0| 0), Black: 220#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|)]) [2023-11-29 00:10:28,887 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-29 00:10:28,887 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 00:10:28,887 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 00:10:28,887 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 00:10:29,072 INFO L124 PetriNetUnfolderBase]: 374/3234 cut-off events. [2023-11-29 00:10:29,072 INFO L125 PetriNetUnfolderBase]: For 387/412 co-relation queries the response was YES. [2023-11-29 00:10:29,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4824 conditions, 3234 events. 374/3234 cut-off events. For 387/412 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 33848 event pairs, 56 based on Foata normal form. 1/2728 useless extension candidates. Maximal degree in co-relation 3950. Up to 221 conditions per place. [2023-11-29 00:10:29,095 INFO L140 encePairwiseOnDemand]: 201/209 looper letters, 14 selfloop transitions, 7 changer transitions 0/220 dead transitions. [2023-11-29 00:10:29,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 220 transitions, 710 flow [2023-11-29 00:10:29,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:10:29,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:10:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 579 transitions. [2023-11-29 00:10:29,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9234449760765551 [2023-11-29 00:10:29,098 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 579 transitions. [2023-11-29 00:10:29,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 579 transitions. [2023-11-29 00:10:29,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:10:29,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 579 transitions. [2023-11-29 00:10:29,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 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:10:29,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:10:29,103 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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:10:29,103 INFO L175 Difference]: Start difference. First operand has 194 places, 212 transitions, 643 flow. Second operand 3 states and 579 transitions. [2023-11-29 00:10:29,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 220 transitions, 710 flow [2023-11-29 00:10:29,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 220 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:10:29,109 INFO L231 Difference]: Finished difference. Result has 196 places, 218 transitions, 693 flow [2023-11-29 00:10:29,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=196, PETRI_TRANSITIONS=218} [2023-11-29 00:10:29,110 INFO L281 CegarLoopForPetriNet]: 188 programPoint places, 8 predicate places. [2023-11-29 00:10:29,111 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 218 transitions, 693 flow [2023-11-29 00:10:29,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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:10:29,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:10:29,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, 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:10:29,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:10:29,112 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-11-29 00:10:29,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:10:29,112 INFO L85 PathProgramCache]: Analyzing trace with hash 2074725363, now seen corresponding path program 1 times [2023-11-29 00:10:29,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:10:29,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982207091] [2023-11-29 00:10:29,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:10:29,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:10:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:10:29,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:10:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:10:29,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:10:29,157 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:10:29,158 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2023-11-29 00:10:29,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2023-11-29 00:10:29,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2023-11-29 00:10:29,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2023-11-29 00:10:29,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2023-11-29 00:10:29,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2023-11-29 00:10:29,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2023-11-29 00:10:29,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2023-11-29 00:10:29,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2023-11-29 00:10:29,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2023-11-29 00:10:29,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2023-11-29 00:10:29,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2023-11-29 00:10:29,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2023-11-29 00:10:29,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2023-11-29 00:10:29,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2023-11-29 00:10:29,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2023-11-29 00:10:29,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (29 of 46 remaining) [2023-11-29 00:10:29,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (28 of 46 remaining) [2023-11-29 00:10:29,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2023-11-29 00:10:29,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2023-11-29 00:10:29,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2023-11-29 00:10:29,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2023-11-29 00:10:29,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2023-11-29 00:10:29,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2023-11-29 00:10:29,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2023-11-29 00:10:29,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 46 remaining) [2023-11-29 00:10:29,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 46 remaining) [2023-11-29 00:10:29,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2023-11-29 00:10:29,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2023-11-29 00:10:29,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2023-11-29 00:10:29,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2023-11-29 00:10:29,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2023-11-29 00:10:29,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2023-11-29 00:10:29,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2023-11-29 00:10:29,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2023-11-29 00:10:29,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2023-11-29 00:10:29,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2023-11-29 00:10:29,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2023-11-29 00:10:29,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2023-11-29 00:10:29,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2023-11-29 00:10:29,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2023-11-29 00:10:29,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2023-11-29 00:10:29,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2023-11-29 00:10:29,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2023-11-29 00:10:29,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2023-11-29 00:10:29,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2023-11-29 00:10:29,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:10:29,169 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:10:29,175 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 00:10:29,175 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:10:29,207 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short15 could not be translated [2023-11-29 00:10:29,208 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short15 could not be translated [2023-11-29 00:10:29,208 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short15 could not be translated [2023-11-29 00:10:29,209 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre16 could not be translated [2023-11-29 00:10:29,210 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre18 could not be translated [2023-11-29 00:10:29,210 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-29 00:10:29,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:10:29 BasicIcfg [2023-11-29 00:10:29,217 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:10:29,218 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:10:29,218 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:10:29,218 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:10:29,218 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:24" (3/4) ... [2023-11-29 00:10:29,220 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 00:10:29,220 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:10:29,221 INFO L158 Benchmark]: Toolchain (without parser) took 5247.94ms. Allocated memory was 167.8MB in the beginning and 247.5MB in the end (delta: 79.7MB). Free memory was 125.4MB in the beginning and 122.6MB in the end (delta: 2.8MB). Peak memory consumption was 84.6MB. Max. memory is 16.1GB. [2023-11-29 00:10:29,221 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:10:29,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.87ms. Allocated memory is still 167.8MB. Free memory was 124.9MB in the beginning and 105.0MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 00:10:29,222 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.07ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 102.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:10:29,222 INFO L158 Benchmark]: Boogie Preprocessor took 36.35ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 100.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:10:29,223 INFO L158 Benchmark]: RCFGBuilder took 446.97ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 81.2MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 00:10:29,223 INFO L158 Benchmark]: TraceAbstraction took 4272.14ms. Allocated memory was 167.8MB in the beginning and 247.5MB in the end (delta: 79.7MB). Free memory was 80.6MB in the beginning and 122.6MB in the end (delta: -42.0MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2023-11-29 00:10:29,223 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 247.5MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:10:29,226 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.21ms. Allocated memory is still 167.8MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.87ms. Allocated memory is still 167.8MB. Free memory was 124.9MB in the beginning and 105.0MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.07ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 102.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.35ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 100.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 446.97ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 81.2MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4272.14ms. Allocated memory was 167.8MB in the beginning and 247.5MB in the end (delta: 79.7MB). Free memory was 80.6MB in the beginning and 122.6MB in the end (delta: -42.0MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 247.5MB. Free memory is still 122.6MB. 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~short15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet9 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: 693]: Data race detected [2023-11-29 00:10:29,247 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short15 could not be translated [2023-11-29 00:10:29,247 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short15 could not be translated [2023-11-29 00:10:29,247 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short15 could not be translated [2023-11-29 00:10:29,248 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre16 could not be translated [2023-11-29 00:10:29,249 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre18 could not be translated [2023-11-29 00:10:29,249 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-29 00:10:29,260 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short15 could not be translated [2023-11-29 00:10:29,260 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short15 could not be translated [2023-11-29 00:10:29,261 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short15 could not be translated [2023-11-29 00:10:29,261 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre16 could not be translated [2023-11-29 00:10:29,262 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre18 could not be translated [2023-11-29 00:10:29,263 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated Data race detected The following path leads to a data race: [L688] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L689] 0 int turn; VAL [flag1=0, flag2=0, turn=0] [L690] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L722] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, t1={5:0}, t2={3:0}, turn=0, x=0] [L723] EXPR 0 0<=turn VAL [flag1=0, flag2=0, t1={5:0}, t2={3:0}, turn=0, x=0] [L723] EXPR 0 0<=turn && turn<=1 VAL [flag1=0, flag2=0, t1={5:0}, t2={3:0}, turn=0, x=0] [L723] EXPR 0 turn<=1 VAL [flag1=0, flag2=0, t1={5:0}, t2={3:0}, turn=0, x=0] [L723] EXPR 0 0<=turn && turn<=1 VAL [flag1=0, flag2=0, t1={5:0}, t2={3:0}, turn=0, x=0] [L723] CALL 0 assume_abort_if_not(0<=turn && turn<=1) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, flag1=0, flag2=0, turn=0, x=0] [L723] RET 0 assume_abort_if_not(0<=turn && turn<=1) [L724] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [flag1=0, flag2=0, t1={5:0}, t2={3:0}, turn=0, x=0] [L692] 1 flag1 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L693] 1 flag2 >= 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L725] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [flag1=1, flag2=0, t1={5:0}, t2={3:0}, turn=0, x=0] [L707] 2 flag2 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=1, turn=0, x=0] [L693] 1 flag2 >= 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=1, turn=0, x=0] Now there is a data race on ~flag2~0 between C: flag2 = 1 [707] and C: flag2 >= 1 [693] - 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: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: 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 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: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - 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: 700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: 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: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 724]: 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: 725]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 320 locations, 46 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: 4.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 299 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 358 IncrementalHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 63 mSDtfsCounter, 358 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=693occurred in iteration=9, InterpolantAutomatonStates: 31, 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.7s InterpolantComputationTime, 405 NumberOfCodeBlocks, 405 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 346 ConstructedInterpolants, 0 QuantifiedInterpolants, 457 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:10:29,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_983fb3af-0e98-49f5-b4d5-fc890b610bbf/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