./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72dd99eb-410a-4afe-ba07-77bbab6a02af/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72dd99eb-410a-4afe-ba07-77bbab6a02af/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72dd99eb-410a-4afe-ba07-77bbab6a02af/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72dd99eb-410a-4afe-ba07-77bbab6a02af/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72dd99eb-410a-4afe-ba07-77bbab6a02af/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72dd99eb-410a-4afe-ba07-77bbab6a02af/bin/uautomizer-verify-4GaUIPS5ZU --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 827df23f2f2d5cc81b0f2d655a6c774471e4114629b1caec5ad3ca146d0279c2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:07:46,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:07:46,284 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72dd99eb-410a-4afe-ba07-77bbab6a02af/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-31 22:07:46,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:07:46,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:07:46,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:07:46,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:07:46,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:07:46,328 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:07:46,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:07:46,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:07:46,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:07:46,331 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:07:46,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:07:46,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:07:46,333 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:07:46,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:07:46,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:07:46,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:07:46,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:07:46,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:07:46,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:07:46,341 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-31 22:07:46,341 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:07:46,341 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:07:46,342 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:07:46,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:07:46,342 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:07:46,342 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:07:46,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:07:46,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:07:46,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:07:46,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:07:46,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:07:46,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:07:46,345 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:07:46,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:07:46,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:07:46,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:07:46,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:07:46,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:07:46,348 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_72dd99eb-410a-4afe-ba07-77bbab6a02af/bin/uautomizer-verify-4GaUIPS5ZU/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_72dd99eb-410a-4afe-ba07-77bbab6a02af/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 827df23f2f2d5cc81b0f2d655a6c774471e4114629b1caec5ad3ca146d0279c2 [2024-10-31 22:07:46,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:07:46,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:07:46,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:07:46,689 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:07:46,690 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:07:46,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72dd99eb-410a-4afe-ba07-77bbab6a02af/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-3.i Unable to find full path for "g++" [2024-10-31 22:07:48,924 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:07:49,338 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:07:49,339 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72dd99eb-410a-4afe-ba07-77bbab6a02af/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-3.i [2024-10-31 22:07:49,363 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72dd99eb-410a-4afe-ba07-77bbab6a02af/bin/uautomizer-verify-4GaUIPS5ZU/data/4861b7afe/dfd09a68502c4e11aca390697ee4c178/FLAGf84c9f7df [2024-10-31 22:07:49,512 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72dd99eb-410a-4afe-ba07-77bbab6a02af/bin/uautomizer-verify-4GaUIPS5ZU/data/4861b7afe/dfd09a68502c4e11aca390697ee4c178 [2024-10-31 22:07:49,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:07:49,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:07:49,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:07:49,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:07:49,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:07:49,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:07:49" (1/1) ... [2024-10-31 22:07:49,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c5e9ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:49, skipping insertion in model container [2024-10-31 22:07:49,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:07:49" (1/1) ... [2024-10-31 22:07:49,594 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:07:50,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:07:50,338 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:07:50,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:07:50,484 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:07:50,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:50 WrapperNode [2024-10-31 22:07:50,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:07:50,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:07:50,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:07:50,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:07:50,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:50" (1/1) ... [2024-10-31 22:07:50,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:50" (1/1) ... [2024-10-31 22:07:50,544 INFO L138 Inliner]: procedures = 265, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2024-10-31 22:07:50,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:07:50,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:07:50,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:07:50,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:07:50,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:50" (1/1) ... [2024-10-31 22:07:50,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:50" (1/1) ... [2024-10-31 22:07:50,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:50" (1/1) ... [2024-10-31 22:07:50,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:50" (1/1) ... [2024-10-31 22:07:50,570 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:50" (1/1) ... [2024-10-31 22:07:50,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:50" (1/1) ... [2024-10-31 22:07:50,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:50" (1/1) ... [2024-10-31 22:07:50,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:50" (1/1) ... [2024-10-31 22:07:50,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:07:50,580 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:07:50,581 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:07:50,581 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:07:50,582 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:50" (1/1) ... [2024-10-31 22:07:50,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:07:50,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72dd99eb-410a-4afe-ba07-77bbab6a02af/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:07:50,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72dd99eb-410a-4afe-ba07-77bbab6a02af/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:07:50,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72dd99eb-410a-4afe-ba07-77bbab6a02af/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:07:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 22:07:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-31 22:07:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-31 22:07:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-31 22:07:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-31 22:07:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 22:07:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:07:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 22:07:50,645 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-31 22:07:50,645 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-31 22:07:50,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:07:50,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:07:50,647 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:07:50,788 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:07:50,790 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:07:51,007 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:07:51,008 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:07:51,039 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:07:51,040 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-31 22:07:51,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:07:51 BoogieIcfgContainer [2024-10-31 22:07:51,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:07:51,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:07:51,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:07:51,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:07:51,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:07:49" (1/3) ... [2024-10-31 22:07:51,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd58a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:07:51, skipping insertion in model container [2024-10-31 22:07:51,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:50" (2/3) ... [2024-10-31 22:07:51,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd58a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:07:51, skipping insertion in model container [2024-10-31 22:07:51,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:07:51" (3/3) ... [2024-10-31 22:07:51,055 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic-race-3.i [2024-10-31 22:07:51,072 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:07:51,072 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-10-31 22:07:51,072 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:07:51,146 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-31 22:07:51,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 123 transitions, 260 flow [2024-10-31 22:07:51,362 INFO L124 PetriNetUnfolderBase]: 9/234 cut-off events. [2024-10-31 22:07:51,363 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-31 22:07:51,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 234 events. 9/234 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 597 event pairs, 0 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2024-10-31 22:07:51,371 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 123 transitions, 260 flow [2024-10-31 22:07:51,377 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 122 transitions, 257 flow [2024-10-31 22:07:51,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:07:51,396 INFO L333 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, 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;@60e05bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:07:51,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-10-31 22:07:51,419 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:07:51,419 INFO L124 PetriNetUnfolderBase]: 2/47 cut-off events. [2024-10-31 22:07:51,420 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:07:51,420 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:51,422 INFO L204 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] [2024-10-31 22:07:51,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-31 22:07:51,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:51,429 INFO L85 PathProgramCache]: Analyzing trace with hash -53368588, now seen corresponding path program 1 times [2024-10-31 22:07:51,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:51,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146706876] [2024-10-31 22:07:51,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:51,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:52,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:07:52,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:52,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146706876] [2024-10-31 22:07:52,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146706876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:52,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:52,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:07:52,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595377170] [2024-10-31 22:07:52,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:52,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:07:52,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:52,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:07:52,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:07:53,055 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 123 [2024-10-31 22:07:53,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 122 transitions, 257 flow. Second operand has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 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) [2024-10-31 22:07:53,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:53,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 123 [2024-10-31 22:07:53,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:53,452 INFO L124 PetriNetUnfolderBase]: 122/715 cut-off events. [2024-10-31 22:07:53,452 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-10-31 22:07:53,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 715 events. 122/715 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4243 event pairs, 46 based on Foata normal form. 19/653 useless extension candidates. Maximal degree in co-relation 734. Up to 244 conditions per place. [2024-10-31 22:07:53,463 INFO L140 encePairwiseOnDemand]: 114/123 looper letters, 32 selfloop transitions, 5 changer transitions 1/126 dead transitions. [2024-10-31 22:07:53,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 126 transitions, 339 flow [2024-10-31 22:07:53,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:07:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:07:53,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 581 transitions. [2024-10-31 22:07:53,485 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7872628726287263 [2024-10-31 22:07:53,489 INFO L175 Difference]: Start difference. First operand has 123 places, 122 transitions, 257 flow. Second operand 6 states and 581 transitions. [2024-10-31 22:07:53,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 126 transitions, 339 flow [2024-10-31 22:07:53,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 126 transitions, 335 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:07:53,503 INFO L231 Difference]: Finished difference. Result has 125 places, 117 transitions, 253 flow [2024-10-31 22:07:53,506 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=253, PETRI_PLACES=125, PETRI_TRANSITIONS=117} [2024-10-31 22:07:53,512 INFO L277 CegarLoopForPetriNet]: 123 programPoint places, 2 predicate places. [2024-10-31 22:07:53,512 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 117 transitions, 253 flow [2024-10-31 22:07:53,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 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) [2024-10-31 22:07:53,513 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:53,513 INFO L204 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] [2024-10-31 22:07:53,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:07:53,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-31 22:07:53,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:53,515 INFO L85 PathProgramCache]: Analyzing trace with hash -162930326, now seen corresponding path program 1 times [2024-10-31 22:07:53,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:53,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141647201] [2024-10-31 22:07:53,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:53,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:07:53,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:53,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141647201] [2024-10-31 22:07:53,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141647201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:53,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:53,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:07:53,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90607715] [2024-10-31 22:07:53,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:53,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:07:53,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:53,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:07:53,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:07:54,115 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 123 [2024-10-31 22:07:54,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 117 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 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) [2024-10-31 22:07:54,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:54,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 123 [2024-10-31 22:07:54,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:54,345 INFO L124 PetriNetUnfolderBase]: 128/772 cut-off events. [2024-10-31 22:07:54,346 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-10-31 22:07:54,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 772 events. 128/772 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4664 event pairs, 58 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 828. Up to 234 conditions per place. [2024-10-31 22:07:54,352 INFO L140 encePairwiseOnDemand]: 117/123 looper letters, 31 selfloop transitions, 5 changer transitions 0/126 dead transitions. [2024-10-31 22:07:54,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 126 transitions, 343 flow [2024-10-31 22:07:54,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:07:54,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:07:54,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 595 transitions. [2024-10-31 22:07:54,355 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8062330623306233 [2024-10-31 22:07:54,356 INFO L175 Difference]: Start difference. First operand has 125 places, 117 transitions, 253 flow. Second operand 6 states and 595 transitions. [2024-10-31 22:07:54,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 126 transitions, 343 flow [2024-10-31 22:07:54,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 126 transitions, 333 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-31 22:07:54,363 INFO L231 Difference]: Finished difference. Result has 123 places, 116 transitions, 251 flow [2024-10-31 22:07:54,363 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=251, PETRI_PLACES=123, PETRI_TRANSITIONS=116} [2024-10-31 22:07:54,364 INFO L277 CegarLoopForPetriNet]: 123 programPoint places, 0 predicate places. [2024-10-31 22:07:54,364 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 116 transitions, 251 flow [2024-10-31 22:07:54,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 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) [2024-10-31 22:07:54,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:54,365 INFO L204 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] [2024-10-31 22:07:54,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:07:54,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-31 22:07:54,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:54,366 INFO L85 PathProgramCache]: Analyzing trace with hash 2070072888, now seen corresponding path program 1 times [2024-10-31 22:07:54,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:54,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154503410] [2024-10-31 22:07:54,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:54,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:07:54,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:54,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154503410] [2024-10-31 22:07:54,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154503410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:54,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:54,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:07:54,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730862281] [2024-10-31 22:07:54,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:54,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:54,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:54,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:54,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:54,436 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 123 [2024-10-31 22:07:54,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 116 transitions, 251 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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) [2024-10-31 22:07:54,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:54,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 123 [2024-10-31 22:07:54,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:54,568 INFO L124 PetriNetUnfolderBase]: 117/684 cut-off events. [2024-10-31 22:07:54,568 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-10-31 22:07:54,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 684 events. 117/684 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4109 event pairs, 74 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 714. Up to 190 conditions per place. [2024-10-31 22:07:54,574 INFO L140 encePairwiseOnDemand]: 117/123 looper letters, 18 selfloop transitions, 5 changer transitions 0/124 dead transitions. [2024-10-31 22:07:54,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 124 transitions, 315 flow [2024-10-31 22:07:54,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:07:54,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:07:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2024-10-31 22:07:54,577 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9186991869918699 [2024-10-31 22:07:54,577 INFO L175 Difference]: Start difference. First operand has 123 places, 116 transitions, 251 flow. Second operand 3 states and 339 transitions. [2024-10-31 22:07:54,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 124 transitions, 315 flow [2024-10-31 22:07:54,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 124 transitions, 305 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-31 22:07:54,582 INFO L231 Difference]: Finished difference. Result has 122 places, 120 transitions, 279 flow [2024-10-31 22:07:54,583 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=122, PETRI_TRANSITIONS=120} [2024-10-31 22:07:54,584 INFO L277 CegarLoopForPetriNet]: 123 programPoint places, -1 predicate places. [2024-10-31 22:07:54,584 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 120 transitions, 279 flow [2024-10-31 22:07:54,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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) [2024-10-31 22:07:54,585 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:54,585 INFO L204 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] [2024-10-31 22:07:54,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:07:54,585 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-31 22:07:54,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:54,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1837119117, now seen corresponding path program 1 times [2024-10-31 22:07:54,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:54,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823248093] [2024-10-31 22:07:54,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:54,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:07:54,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:54,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823248093] [2024-10-31 22:07:54,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823248093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:54,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:54,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:07:54,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272352139] [2024-10-31 22:07:54,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:54,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:54,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:54,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:54,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:54,649 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 123 [2024-10-31 22:07:54,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 120 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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) [2024-10-31 22:07:54,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:54,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 123 [2024-10-31 22:07:54,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:54,859 INFO L124 PetriNetUnfolderBase]: 177/994 cut-off events. [2024-10-31 22:07:54,860 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2024-10-31 22:07:54,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1591 conditions, 994 events. 177/994 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6686 event pairs, 57 based on Foata normal form. 0/909 useless extension candidates. Maximal degree in co-relation 1310. Up to 180 conditions per place. [2024-10-31 22:07:54,866 INFO L140 encePairwiseOnDemand]: 118/123 looper letters, 17 selfloop transitions, 6 changer transitions 0/128 dead transitions. [2024-10-31 22:07:54,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 128 transitions, 351 flow [2024-10-31 22:07:54,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:07:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:07:54,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2024-10-31 22:07:54,868 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.926829268292683 [2024-10-31 22:07:54,868 INFO L175 Difference]: Start difference. First operand has 122 places, 120 transitions, 279 flow. Second operand 3 states and 342 transitions. [2024-10-31 22:07:54,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 128 transitions, 351 flow [2024-10-31 22:07:54,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 128 transitions, 337 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:07:54,874 INFO L231 Difference]: Finished difference. Result has 124 places, 124 transitions, 317 flow [2024-10-31 22:07:54,874 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=124, PETRI_TRANSITIONS=124} [2024-10-31 22:07:54,875 INFO L277 CegarLoopForPetriNet]: 123 programPoint places, 1 predicate places. [2024-10-31 22:07:54,875 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 124 transitions, 317 flow [2024-10-31 22:07:54,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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) [2024-10-31 22:07:54,876 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:54,876 INFO L204 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] [2024-10-31 22:07:54,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:07:54,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-31 22:07:54,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:54,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1125759620, now seen corresponding path program 1 times [2024-10-31 22:07:54,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:54,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357630649] [2024-10-31 22:07:54,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:54,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:07:54,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:54,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357630649] [2024-10-31 22:07:54,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357630649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:54,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:54,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:07:54,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780876973] [2024-10-31 22:07:54,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:54,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:54,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:54,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:54,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:54,969 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 123 [2024-10-31 22:07:54,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 124 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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) [2024-10-31 22:07:54,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:54,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 123 [2024-10-31 22:07:54,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:55,254 INFO L124 PetriNetUnfolderBase]: 237/1385 cut-off events. [2024-10-31 22:07:55,255 INFO L125 PetriNetUnfolderBase]: For 830/845 co-relation queries the response was YES. [2024-10-31 22:07:55,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2522 conditions, 1385 events. 237/1385 cut-off events. For 830/845 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 10886 event pairs, 95 based on Foata normal form. 0/1269 useless extension candidates. Maximal degree in co-relation 2092. Up to 355 conditions per place. [2024-10-31 22:07:55,268 INFO L140 encePairwiseOnDemand]: 117/123 looper letters, 19 selfloop transitions, 10 changer transitions 0/133 dead transitions. [2024-10-31 22:07:55,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 133 transitions, 418 flow [2024-10-31 22:07:55,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:07:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:07:55,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2024-10-31 22:07:55,270 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9159891598915989 [2024-10-31 22:07:55,270 INFO L175 Difference]: Start difference. First operand has 124 places, 124 transitions, 317 flow. Second operand 3 states and 338 transitions. [2024-10-31 22:07:55,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 133 transitions, 418 flow [2024-10-31 22:07:55,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 133 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:07:55,278 INFO L231 Difference]: Finished difference. Result has 126 places, 130 transitions, 387 flow [2024-10-31 22:07:55,279 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=126, PETRI_TRANSITIONS=130} [2024-10-31 22:07:55,280 INFO L277 CegarLoopForPetriNet]: 123 programPoint places, 3 predicate places. [2024-10-31 22:07:55,280 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 130 transitions, 387 flow [2024-10-31 22:07:55,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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) [2024-10-31 22:07:55,281 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:55,281 INFO L204 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] [2024-10-31 22:07:55,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:07:55,282 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-31 22:07:55,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:55,282 INFO L85 PathProgramCache]: Analyzing trace with hash -576697241, now seen corresponding path program 1 times [2024-10-31 22:07:55,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:55,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587178547] [2024-10-31 22:07:55,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:55,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:07:55,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:55,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587178547] [2024-10-31 22:07:55,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587178547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:55,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:55,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:07:55,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701337476] [2024-10-31 22:07:55,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:55,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:07:55,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:55,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:07:55,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:07:55,543 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 123 [2024-10-31 22:07:55,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 130 transitions, 387 flow. Second operand has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 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) [2024-10-31 22:07:55,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:55,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 123 [2024-10-31 22:07:55,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:55,994 INFO L124 PetriNetUnfolderBase]: 307/1790 cut-off events. [2024-10-31 22:07:55,994 INFO L125 PetriNetUnfolderBase]: For 829/935 co-relation queries the response was YES. [2024-10-31 22:07:56,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3236 conditions, 1790 events. 307/1790 cut-off events. For 829/935 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 14687 event pairs, 136 based on Foata normal form. 5/1665 useless extension candidates. Maximal degree in co-relation 2659. Up to 383 conditions per place. [2024-10-31 22:07:56,006 INFO L140 encePairwiseOnDemand]: 115/123 looper letters, 23 selfloop transitions, 7 changer transitions 1/142 dead transitions. [2024-10-31 22:07:56,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 142 transitions, 474 flow [2024-10-31 22:07:56,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:07:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:07:56,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 638 transitions. [2024-10-31 22:07:56,009 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8644986449864499 [2024-10-31 22:07:56,009 INFO L175 Difference]: Start difference. First operand has 126 places, 130 transitions, 387 flow. Second operand 6 states and 638 transitions. [2024-10-31 22:07:56,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 142 transitions, 474 flow [2024-10-31 22:07:56,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 142 transitions, 454 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:07:56,015 INFO L231 Difference]: Finished difference. Result has 133 places, 135 transitions, 414 flow [2024-10-31 22:07:56,016 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=414, PETRI_PLACES=133, PETRI_TRANSITIONS=135} [2024-10-31 22:07:56,016 INFO L277 CegarLoopForPetriNet]: 123 programPoint places, 10 predicate places. [2024-10-31 22:07:56,017 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 135 transitions, 414 flow [2024-10-31 22:07:56,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 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) [2024-10-31 22:07:56,017 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:56,018 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:56,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:07:56,018 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-31 22:07:56,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:56,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1771298697, now seen corresponding path program 1 times [2024-10-31 22:07:56,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:56,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746498292] [2024-10-31 22:07:56,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:56,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:07:56,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:07:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:07:56,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:07:56,108 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:07:56,110 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-10-31 22:07:56,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-10-31 22:07:56,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-10-31 22:07:56,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-10-31 22:07:56,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-10-31 22:07:56,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2024-10-31 22:07:56,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-10-31 22:07:56,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-10-31 22:07:56,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-10-31 22:07:56,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:07:56,114 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:56,117 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-31 22:07:56,117 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-31 22:07:56,153 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-31 22:07:56,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 159 transitions, 350 flow [2024-10-31 22:07:56,218 INFO L124 PetriNetUnfolderBase]: 19/402 cut-off events. [2024-10-31 22:07:56,218 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-31 22:07:56,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 402 events. 19/402 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1318 event pairs, 1 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 425. Up to 16 conditions per place. [2024-10-31 22:07:56,220 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 159 transitions, 350 flow [2024-10-31 22:07:56,222 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 140 transitions, 302 flow [2024-10-31 22:07:56,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:07:56,225 INFO L333 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, 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;@60e05bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:07:56,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-31 22:07:56,230 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:07:56,230 INFO L124 PetriNetUnfolderBase]: 2/47 cut-off events. [2024-10-31 22:07:56,230 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:07:56,231 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:56,231 INFO L204 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] [2024-10-31 22:07:56,231 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-31 22:07:56,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:56,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1507522676, now seen corresponding path program 1 times [2024-10-31 22:07:56,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:56,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700123114] [2024-10-31 22:07:56,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:56,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:56,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:07:56,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:56,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700123114] [2024-10-31 22:07:56,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700123114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:56,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:56,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:07:56,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982952909] [2024-10-31 22:07:56,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:56,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:07:56,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:56,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:07:56,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:07:56,761 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 159 [2024-10-31 22:07:56,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 140 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 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) [2024-10-31 22:07:56,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:56,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 159 [2024-10-31 22:07:56,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:57,421 INFO L124 PetriNetUnfolderBase]: 783/3047 cut-off events. [2024-10-31 22:07:57,421 INFO L125 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2024-10-31 22:07:57,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4494 conditions, 3047 events. 783/3047 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 26063 event pairs, 211 based on Foata normal form. 73/2808 useless extension candidates. Maximal degree in co-relation 1300. Up to 1205 conditions per place. [2024-10-31 22:07:57,448 INFO L140 encePairwiseOnDemand]: 150/159 looper letters, 44 selfloop transitions, 5 changer transitions 1/152 dead transitions. [2024-10-31 22:07:57,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 152 transitions, 424 flow [2024-10-31 22:07:57,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:07:57,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:07:57,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 761 transitions. [2024-10-31 22:07:57,451 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7976939203354297 [2024-10-31 22:07:57,451 INFO L175 Difference]: Start difference. First operand has 142 places, 140 transitions, 302 flow. Second operand 6 states and 761 transitions. [2024-10-31 22:07:57,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 152 transitions, 424 flow [2024-10-31 22:07:57,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 152 transitions, 420 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:07:57,455 INFO L231 Difference]: Finished difference. Result has 144 places, 135 transitions, 298 flow [2024-10-31 22:07:57,455 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=144, PETRI_TRANSITIONS=135} [2024-10-31 22:07:57,456 INFO L277 CegarLoopForPetriNet]: 142 programPoint places, 2 predicate places. [2024-10-31 22:07:57,456 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 135 transitions, 298 flow [2024-10-31 22:07:57,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 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) [2024-10-31 22:07:57,457 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:57,457 INFO L204 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] [2024-10-31 22:07:57,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:07:57,458 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-31 22:07:57,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:57,458 INFO L85 PathProgramCache]: Analyzing trace with hash 980058744, now seen corresponding path program 1 times [2024-10-31 22:07:57,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:57,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834286655] [2024-10-31 22:07:57,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:57,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:57,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:07:57,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:57,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834286655] [2024-10-31 22:07:57,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834286655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:57,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:57,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:07:57,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967432103] [2024-10-31 22:07:57,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:57,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:07:57,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:57,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:07:57,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:07:57,979 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 159 [2024-10-31 22:07:57,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 135 transitions, 298 flow. Second operand has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 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) [2024-10-31 22:07:57,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:57,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 159 [2024-10-31 22:07:57,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:58,706 INFO L124 PetriNetUnfolderBase]: 809/3936 cut-off events. [2024-10-31 22:07:58,707 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2024-10-31 22:07:58,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5435 conditions, 3936 events. 809/3936 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 35271 event pairs, 556 based on Foata normal form. 0/3582 useless extension candidates. Maximal degree in co-relation 4150. Up to 1169 conditions per place. [2024-10-31 22:07:58,734 INFO L140 encePairwiseOnDemand]: 153/159 looper letters, 43 selfloop transitions, 5 changer transitions 0/152 dead transitions. [2024-10-31 22:07:58,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 152 transitions, 428 flow [2024-10-31 22:07:58,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:07:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:07:58,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 775 transitions. [2024-10-31 22:07:58,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8123689727463312 [2024-10-31 22:07:58,737 INFO L175 Difference]: Start difference. First operand has 144 places, 135 transitions, 298 flow. Second operand 6 states and 775 transitions. [2024-10-31 22:07:58,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 152 transitions, 428 flow [2024-10-31 22:07:58,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 152 transitions, 418 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-31 22:07:58,740 INFO L231 Difference]: Finished difference. Result has 142 places, 134 transitions, 296 flow [2024-10-31 22:07:58,741 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=142, PETRI_TRANSITIONS=134} [2024-10-31 22:07:58,741 INFO L277 CegarLoopForPetriNet]: 142 programPoint places, 0 predicate places. [2024-10-31 22:07:58,742 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 134 transitions, 296 flow [2024-10-31 22:07:58,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 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) [2024-10-31 22:07:58,742 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:58,742 INFO L204 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] [2024-10-31 22:07:58,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:07:58,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-31 22:07:58,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:58,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1283641960, now seen corresponding path program 1 times [2024-10-31 22:07:58,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:58,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621792651] [2024-10-31 22:07:58,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:58,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:07:58,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:58,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621792651] [2024-10-31 22:07:58,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621792651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:58,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:58,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:07:58,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392099052] [2024-10-31 22:07:58,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:58,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:58,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:58,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:58,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:58,821 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 159 [2024-10-31 22:07:58,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 134 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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) [2024-10-31 22:07:58,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:58,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 159 [2024-10-31 22:07:58,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:59,497 INFO L124 PetriNetUnfolderBase]: 1075/3990 cut-off events. [2024-10-31 22:07:59,497 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2024-10-31 22:07:59,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5849 conditions, 3990 events. 1075/3990 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 36957 event pairs, 695 based on Foata normal form. 0/3550 useless extension candidates. Maximal degree in co-relation 4558. Up to 1401 conditions per place. [2024-10-31 22:07:59,588 INFO L140 encePairwiseOnDemand]: 152/159 looper letters, 27 selfloop transitions, 6 changer transitions 0/147 dead transitions. [2024-10-31 22:07:59,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 147 transitions, 398 flow [2024-10-31 22:07:59,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:07:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:07:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2024-10-31 22:07:59,591 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8951781970649895 [2024-10-31 22:07:59,591 INFO L175 Difference]: Start difference. First operand has 142 places, 134 transitions, 296 flow. Second operand 3 states and 427 transitions. [2024-10-31 22:07:59,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 147 transitions, 398 flow [2024-10-31 22:07:59,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 147 transitions, 388 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-31 22:07:59,596 INFO L231 Difference]: Finished difference. Result has 141 places, 139 transitions, 332 flow [2024-10-31 22:07:59,596 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=141, PETRI_TRANSITIONS=139} [2024-10-31 22:07:59,597 INFO L277 CegarLoopForPetriNet]: 142 programPoint places, -1 predicate places. [2024-10-31 22:07:59,597 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 139 transitions, 332 flow [2024-10-31 22:07:59,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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) [2024-10-31 22:07:59,598 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:59,598 INFO L204 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] [2024-10-31 22:07:59,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:07:59,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-31 22:07:59,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:59,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1378419385, now seen corresponding path program 1 times [2024-10-31 22:07:59,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:59,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068991460] [2024-10-31 22:07:59,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:59,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:59,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:07:59,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:59,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068991460] [2024-10-31 22:07:59,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068991460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:59,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:59,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:07:59,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27957566] [2024-10-31 22:07:59,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:59,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:59,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:59,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:59,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:59,682 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 159 [2024-10-31 22:07:59,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 139 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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) [2024-10-31 22:07:59,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:59,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 159 [2024-10-31 22:07:59,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:08:00,793 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L1038-1-->L1039: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][124], [120#L1024-3true, 177#true, 182#true, 161#true, 90#L1023-6true, 162#true, Black: 179#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), 7#L1039true]) [2024-10-31 22:08:00,794 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-10-31 22:08:00,794 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-31 22:08:00,794 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-31 22:08:00,794 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-31 22:08:00,795 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L1038-1-->L1039: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][124], [177#true, 182#true, 161#true, 90#L1023-6true, 162#true, Black: 179#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), 79#L1024true, 7#L1039true]) [2024-10-31 22:08:00,795 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-10-31 22:08:00,795 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-31 22:08:00,795 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-10-31 22:08:00,795 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-10-31 22:08:00,795 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L1038-1-->L1039: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][143], [182#true, 177#true, 161#true, 90#L1023-6true, 162#true, Black: 179#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), 7#L1039true, 48#L1023-6true]) [2024-10-31 22:08:00,795 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2024-10-31 22:08:00,796 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 22:08:00,796 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 22:08:00,796 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-31 22:08:00,895 INFO L124 PetriNetUnfolderBase]: 1719/6346 cut-off events. [2024-10-31 22:08:00,896 INFO L125 PetriNetUnfolderBase]: For 2028/2225 co-relation queries the response was YES. [2024-10-31 22:08:00,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10851 conditions, 6346 events. 1719/6346 cut-off events. For 2028/2225 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 64238 event pairs, 918 based on Foata normal form. 5/5616 useless extension candidates. Maximal degree in co-relation 8197. Up to 2119 conditions per place. [2024-10-31 22:08:00,955 INFO L140 encePairwiseOnDemand]: 152/159 looper letters, 27 selfloop transitions, 9 changer transitions 0/152 dead transitions. [2024-10-31 22:08:00,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 152 transitions, 452 flow [2024-10-31 22:08:00,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:08:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2024-10-31 22:08:00,963 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8909853249475891 [2024-10-31 22:08:00,964 INFO L175 Difference]: Start difference. First operand has 141 places, 139 transitions, 332 flow. Second operand 3 states and 425 transitions. [2024-10-31 22:08:00,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 152 transitions, 452 flow [2024-10-31 22:08:00,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 152 transitions, 434 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:08:00,980 INFO L231 Difference]: Finished difference. Result has 143 places, 146 transitions, 396 flow [2024-10-31 22:08:00,981 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=143, PETRI_TRANSITIONS=146} [2024-10-31 22:08:00,983 INFO L277 CegarLoopForPetriNet]: 142 programPoint places, 1 predicate places. [2024-10-31 22:08:00,984 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 146 transitions, 396 flow [2024-10-31 22:08:00,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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) [2024-10-31 22:08:00,985 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:08:00,986 INFO L204 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] [2024-10-31 22:08:00,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:08:00,986 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-31 22:08:00,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:00,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1421246144, now seen corresponding path program 1 times [2024-10-31 22:08:00,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:00,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117977579] [2024-10-31 22:08:00,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:00,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:01,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:08:01,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:01,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117977579] [2024-10-31 22:08:01,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117977579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:01,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:01,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:08:01,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876949301] [2024-10-31 22:08:01,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:01,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:01,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:01,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:01,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:01,089 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 159 [2024-10-31 22:08:01,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 146 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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) [2024-10-31 22:08:01,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:08:01,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 159 [2024-10-31 22:08:01,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:08:02,455 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L1038-1-->L1039: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][148], [182#true, 189#(= |#race~data~0| 0), 161#true, Black: 179#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), 90#L1023-6true, 162#true, 7#L1039true, Black: 184#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 48#L1023-6true]) [2024-10-31 22:08:02,455 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2024-10-31 22:08:02,455 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 22:08:02,456 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-31 22:08:02,456 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 22:08:02,528 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L1038-1-->L1039: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][85], [182#true, 189#(= |#race~data~0| 0), 161#true, Black: 179#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), 162#true, 123#L1024true, 7#L1039true, Black: 184#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 48#L1023-6true]) [2024-10-31 22:08:02,529 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-10-31 22:08:02,529 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-31 22:08:02,529 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-10-31 22:08:02,529 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-10-31 22:08:02,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L1038-1-->L1039: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][85], [182#true, 189#(= |#race~data~0| 0), 161#true, Black: 179#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), 162#true, 137#L1024-3true, 7#L1039true, Black: 184#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 48#L1023-6true]) [2024-10-31 22:08:02,552 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-10-31 22:08:02,552 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-31 22:08:02,552 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-31 22:08:02,552 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-31 22:08:02,738 INFO L124 PetriNetUnfolderBase]: 2793/9528 cut-off events. [2024-10-31 22:08:02,739 INFO L125 PetriNetUnfolderBase]: For 5610/5709 co-relation queries the response was YES. [2024-10-31 22:08:02,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18474 conditions, 9528 events. 2793/9528 cut-off events. For 5610/5709 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 101368 event pairs, 958 based on Foata normal form. 3/8421 useless extension candidates. Maximal degree in co-relation 14677. Up to 2383 conditions per place. [2024-10-31 22:08:02,826 INFO L140 encePairwiseOnDemand]: 153/159 looper letters, 28 selfloop transitions, 13 changer transitions 0/161 dead transitions. [2024-10-31 22:08:02,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 161 transitions, 550 flow [2024-10-31 22:08:02,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:02,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:08:02,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2024-10-31 22:08:02,828 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8972746331236897 [2024-10-31 22:08:02,828 INFO L175 Difference]: Start difference. First operand has 143 places, 146 transitions, 396 flow. Second operand 3 states and 428 transitions. [2024-10-31 22:08:02,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 161 transitions, 550 flow [2024-10-31 22:08:02,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 161 transitions, 522 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:08:02,849 INFO L231 Difference]: Finished difference. Result has 145 places, 155 transitions, 500 flow [2024-10-31 22:08:02,850 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=145, PETRI_TRANSITIONS=155} [2024-10-31 22:08:02,850 INFO L277 CegarLoopForPetriNet]: 142 programPoint places, 3 predicate places. [2024-10-31 22:08:02,850 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 155 transitions, 500 flow [2024-10-31 22:08:02,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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) [2024-10-31 22:08:02,851 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:08:02,851 INFO L204 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] [2024-10-31 22:08:02,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:08:02,852 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-31 22:08:02,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:02,852 INFO L85 PathProgramCache]: Analyzing trace with hash -318835660, now seen corresponding path program 1 times [2024-10-31 22:08:02,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:02,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194180794] [2024-10-31 22:08:02,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:02,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:02,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:08:02,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:02,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194180794] [2024-10-31 22:08:02,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194180794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:02,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:02,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:08:02,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423524814] [2024-10-31 22:08:02,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:02,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:08:02,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:02,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:08:02,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:08:03,118 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 159 [2024-10-31 22:08:03,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 155 transitions, 500 flow. Second operand has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 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) [2024-10-31 22:08:03,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:08:03,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 159 [2024-10-31 22:08:03,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:08:04,693 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L1038-1-->L1039: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][154], [189#(= |#race~data~0| 0), 161#true, 90#L1023-6true, 162#true, Black: 179#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), 192#true, 7#L1039true, Black: 184#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 48#L1023-6true, Black: 187#true]) [2024-10-31 22:08:04,694 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2024-10-31 22:08:04,694 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 22:08:04,694 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 22:08:04,694 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-31 22:08:04,945 INFO L124 PetriNetUnfolderBase]: 2904/11526 cut-off events. [2024-10-31 22:08:04,946 INFO L125 PetriNetUnfolderBase]: For 6038/7126 co-relation queries the response was YES. [2024-10-31 22:08:04,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21451 conditions, 11526 events. 2904/11526 cut-off events. For 6038/7126 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 132697 event pairs, 1140 based on Foata normal form. 38/10174 useless extension candidates. Maximal degree in co-relation 12154. Up to 2813 conditions per place. [2024-10-31 22:08:05,047 INFO L140 encePairwiseOnDemand]: 151/159 looper letters, 28 selfloop transitions, 7 changer transitions 1/168 dead transitions. [2024-10-31 22:08:05,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 168 transitions, 599 flow [2024-10-31 22:08:05,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:08:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:08:05,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 811 transitions. [2024-10-31 22:08:05,050 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.850104821802935 [2024-10-31 22:08:05,050 INFO L175 Difference]: Start difference. First operand has 145 places, 155 transitions, 500 flow. Second operand 6 states and 811 transitions. [2024-10-31 22:08:05,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 168 transitions, 599 flow [2024-10-31 22:08:05,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 168 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:08:05,081 INFO L231 Difference]: Finished difference. Result has 152 places, 161 transitions, 525 flow [2024-10-31 22:08:05,082 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=525, PETRI_PLACES=152, PETRI_TRANSITIONS=161} [2024-10-31 22:08:05,083 INFO L277 CegarLoopForPetriNet]: 142 programPoint places, 10 predicate places. [2024-10-31 22:08:05,083 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 161 transitions, 525 flow [2024-10-31 22:08:05,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 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) [2024-10-31 22:08:05,084 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:08:05,084 INFO L204 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, 1, 1, 1, 1, 1] [2024-10-31 22:08:05,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:08:05,085 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-31 22:08:05,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:05,085 INFO L85 PathProgramCache]: Analyzing trace with hash -814473392, now seen corresponding path program 1 times [2024-10-31 22:08:05,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:05,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789298921] [2024-10-31 22:08:05,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:05,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:08:05,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:05,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789298921] [2024-10-31 22:08:05,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789298921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:05,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:05,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:08:05,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703586052] [2024-10-31 22:08:05,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:05,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:08:05,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:05,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:08:05,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:08:05,324 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 159 [2024-10-31 22:08:05,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 161 transitions, 525 flow. Second operand has 6 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 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) [2024-10-31 22:08:05,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:08:05,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 159 [2024-10-31 22:08:05,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:08:06,194 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([437] L1023-4-->L1023-5: Formula: (= |v_threadThread2of2ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_3|} OutVars{threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][161], [60#L1023-5true, 161#true, Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 195#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 137#L1024-3true, 192#true, Black: 198#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 196#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 124#L1039-1true, Black: 179#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 184#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 48#L1023-6true, 163#true, Black: 189#(= |#race~data~0| 0)]) [2024-10-31 22:08:06,194 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2024-10-31 22:08:06,194 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-10-31 22:08:06,194 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-10-31 22:08:06,194 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-10-31 22:08:06,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L1038-1-->L1039: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][113], [161#true, 162#true, Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 195#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 79#L1024true, 192#true, Black: 198#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 196#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 90#L1023-6true, Black: 179#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), 7#L1039true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 184#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), Black: 187#true]) [2024-10-31 22:08:06,268 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-10-31 22:08:06,268 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-31 22:08:06,269 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-10-31 22:08:06,269 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-10-31 22:08:06,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L1038-1-->L1039: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][144], [161#true, 162#true, Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 195#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 192#true, Black: 198#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 196#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 90#L1023-6true, Black: 179#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), 7#L1039true, Black: 184#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 48#L1023-6true, Black: 187#true]) [2024-10-31 22:08:06,380 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2024-10-31 22:08:06,380 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 22:08:06,380 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-31 22:08:06,380 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 22:08:06,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L1038-1-->L1039: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][107], [161#true, 162#true, Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 195#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 192#true, Black: 198#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 196#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 179#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), 123#L1024true, 7#L1039true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 184#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 48#L1023-6true, Black: 187#true]) [2024-10-31 22:08:06,381 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-10-31 22:08:06,381 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-10-31 22:08:06,381 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-10-31 22:08:06,381 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-31 22:08:06,412 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L1023-4-->L1023-5: Formula: (= |v_#race~data~0_4| |v_threadThread1of2ForFork1_#t~nondet5_3|) InVars {threadThread1of2ForFork1_#t~nondet5=|v_threadThread1of2ForFork1_#t~nondet5_3|} OutVars{threadThread1of2ForFork1_#t~nondet5=|v_threadThread1of2ForFork1_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][145], [161#true, 162#true, Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 195#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 192#true, Black: 198#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 196#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 155#L1023-5true, 124#L1039-1true, 90#L1023-6true, Black: 179#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), Black: 182#true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 189#(= |#race~data~0| 0)]) [2024-10-31 22:08:06,412 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2024-10-31 22:08:06,412 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 22:08:06,413 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 22:08:06,413 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-31 22:08:06,451 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L1023-4-->L1023-5: Formula: (= |v_#race~data~0_4| |v_threadThread1of2ForFork1_#t~nondet5_3|) InVars {threadThread1of2ForFork1_#t~nondet5=|v_threadThread1of2ForFork1_#t~nondet5_3|} OutVars{threadThread1of2ForFork1_#t~nondet5=|v_threadThread1of2ForFork1_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][109], [161#true, 162#true, Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 195#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 192#true, Black: 198#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 196#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 155#L1023-5true, 124#L1039-1true, Black: 179#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), 123#L1024true, Black: 182#true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 189#(= |#race~data~0| 0)]) [2024-10-31 22:08:06,451 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-10-31 22:08:06,451 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-31 22:08:06,451 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-10-31 22:08:06,451 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-10-31 22:08:06,690 INFO L124 PetriNetUnfolderBase]: 1960/7725 cut-off events. [2024-10-31 22:08:06,690 INFO L125 PetriNetUnfolderBase]: For 3489/4098 co-relation queries the response was YES. [2024-10-31 22:08:06,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14748 conditions, 7725 events. 1960/7725 cut-off events. For 3489/4098 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 81875 event pairs, 310 based on Foata normal form. 7/6713 useless extension candidates. Maximal degree in co-relation 10066. Up to 1233 conditions per place. [2024-10-31 22:08:06,751 INFO L140 encePairwiseOnDemand]: 152/159 looper letters, 28 selfloop transitions, 6 changer transitions 0/164 dead transitions. [2024-10-31 22:08:06,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 164 transitions, 580 flow [2024-10-31 22:08:06,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:08:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:08:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 791 transitions. [2024-10-31 22:08:06,754 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8291404612159329 [2024-10-31 22:08:06,754 INFO L175 Difference]: Start difference. First operand has 152 places, 161 transitions, 525 flow. Second operand 6 states and 791 transitions. [2024-10-31 22:08:06,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 164 transitions, 580 flow [2024-10-31 22:08:06,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 164 transitions, 568 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-31 22:08:06,769 INFO L231 Difference]: Finished difference. Result has 150 places, 156 transitions, 496 flow [2024-10-31 22:08:06,769 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=496, PETRI_PLACES=150, PETRI_TRANSITIONS=156} [2024-10-31 22:08:06,770 INFO L277 CegarLoopForPetriNet]: 142 programPoint places, 8 predicate places. [2024-10-31 22:08:06,770 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 156 transitions, 496 flow [2024-10-31 22:08:06,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 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) [2024-10-31 22:08:06,771 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:08:06,771 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:06,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:08:06,771 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-31 22:08:06,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:06,772 INFO L85 PathProgramCache]: Analyzing trace with hash 152436633, now seen corresponding path program 1 times [2024-10-31 22:08:06,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:06,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296914142] [2024-10-31 22:08:06,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:06,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-31 22:08:06,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:06,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296914142] [2024-10-31 22:08:06,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296914142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:06,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:06,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:08:06,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609169159] [2024-10-31 22:08:06,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:06,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:06,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:06,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:06,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:06,858 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 159 [2024-10-31 22:08:06,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 156 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:08:06,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:08:06,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 159 [2024-10-31 22:08:06,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:08:08,742 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L1038-1-->L1039: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][146], [211#true, 161#true, Black: 179#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), 90#L1023-6true, 162#true, Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), 7#L1039true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 184#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 48#L1023-6true, Black: 187#true]) [2024-10-31 22:08:08,742 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2024-10-31 22:08:08,743 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-31 22:08:08,743 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 22:08:08,743 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 22:08:08,744 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([368] L1038-1-->L1039: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][146], [211#true, 161#true, 162#true, Black: 179#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), 90#L1023-6true, Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), 7#L1039true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 184#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 48#L1023-6true, Black: 187#true]) [2024-10-31 22:08:08,744 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2024-10-31 22:08:08,744 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-31 22:08:08,744 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 22:08:08,745 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-31 22:08:08,745 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 22:08:08,745 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L1038-1-->L1039: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][103], [211#true, 161#true, 162#true, Black: 179#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), 90#L1023-6true, Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), 41#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 7#L1039true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 184#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), Black: 187#true]) [2024-10-31 22:08:08,745 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2024-10-31 22:08:08,745 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-31 22:08:08,745 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 22:08:08,746 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-31 22:08:08,815 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L1038-1-->L1039: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][104], [211#true, 161#true, 162#true, Black: 179#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), 123#L1024true, 7#L1039true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 184#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 48#L1023-6true, Black: 187#true]) [2024-10-31 22:08:08,815 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-10-31 22:08:08,815 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-10-31 22:08:08,815 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-10-31 22:08:08,815 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-31 22:08:08,824 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L1038-1-->L1039: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][103], [211#true, 161#true, 162#true, Black: 179#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), 90#L1023-6true, Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), 79#L1024true, 7#L1039true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 184#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), Black: 187#true]) [2024-10-31 22:08:08,824 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-10-31 22:08:08,825 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-10-31 22:08:08,825 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-10-31 22:08:08,825 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-31 22:08:08,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L1038-1-->L1039: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][104], [211#true, 161#true, 162#true, Black: 179#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), 137#L1024-3true, 7#L1039true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 184#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 48#L1023-6true, Black: 187#true]) [2024-10-31 22:08:08,841 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-10-31 22:08:08,842 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-31 22:08:08,843 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-31 22:08:08,844 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-31 22:08:08,854 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L1038-1-->L1039: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][103], [211#true, 120#L1024-3true, 161#true, 90#L1023-6true, 162#true, Black: 179#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), 7#L1039true, 207#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 184#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), Black: 187#true]) [2024-10-31 22:08:08,855 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-10-31 22:08:08,855 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-31 22:08:08,855 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-31 22:08:08,855 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-31 22:08:09,217 INFO L124 PetriNetUnfolderBase]: 4177/14175 cut-off events. [2024-10-31 22:08:09,218 INFO L125 PetriNetUnfolderBase]: For 14468/14729 co-relation queries the response was YES. [2024-10-31 22:08:09,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31128 conditions, 14175 events. 4177/14175 cut-off events. For 14468/14729 co-relation queries the response was YES. Maximal size of possible extension queue 732. Compared 166721 event pairs, 1498 based on Foata normal form. 3/12417 useless extension candidates. Maximal degree in co-relation 29684. Up to 4674 conditions per place. [2024-10-31 22:08:09,327 INFO L140 encePairwiseOnDemand]: 152/159 looper letters, 35 selfloop transitions, 22 changer transitions 0/177 dead transitions. [2024-10-31 22:08:09,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 177 transitions, 729 flow [2024-10-31 22:08:09,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:09,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:08:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2024-10-31 22:08:09,330 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8930817610062893 [2024-10-31 22:08:09,330 INFO L175 Difference]: Start difference. First operand has 150 places, 156 transitions, 496 flow. Second operand 3 states and 426 transitions. [2024-10-31 22:08:09,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 177 transitions, 729 flow [2024-10-31 22:08:09,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 177 transitions, 717 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-31 22:08:09,405 INFO L231 Difference]: Finished difference. Result has 149 places, 170 transitions, 702 flow [2024-10-31 22:08:09,408 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=702, PETRI_PLACES=149, PETRI_TRANSITIONS=170} [2024-10-31 22:08:09,409 INFO L277 CegarLoopForPetriNet]: 142 programPoint places, 7 predicate places. [2024-10-31 22:08:09,409 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 170 transitions, 702 flow [2024-10-31 22:08:09,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:08:09,410 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:08:09,410 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:09,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:08:09,411 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-31 22:08:09,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:09,411 INFO L85 PathProgramCache]: Analyzing trace with hash 867388162, now seen corresponding path program 1 times [2024-10-31 22:08:09,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:09,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081660688] [2024-10-31 22:08:09,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:09,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:09,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:08:09,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:09,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081660688] [2024-10-31 22:08:09,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081660688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:09,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:09,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:08:09,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691418620] [2024-10-31 22:08:09,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:09,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:08:09,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:09,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:08:09,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:08:10,011 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 159 [2024-10-31 22:08:10,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 170 transitions, 702 flow. Second operand has 6 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 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) [2024-10-31 22:08:10,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:08:10,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 159 [2024-10-31 22:08:10,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:08:12,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L1038-1-->L1039: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][161], [211#true, 161#true, 162#true, 90#L1023-6true, Black: 179#(= |threadThread1of2ForFork0_#t~nondet5| |#race~data~0|), Black: 194#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 213#(= |threadThread2of2ForFork0_#t~nondet5| |#race~data~0|), 7#L1039true, Black: 184#(= |threadThread1of2ForFork1_#t~nondet5| |#race~data~0|), 48#L1023-6true, 216#true, Black: 187#true]) [2024-10-31 22:08:12,771 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2024-10-31 22:08:12,771 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-31 22:08:12,771 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 22:08:12,771 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-10-31 22:08:12,976 INFO L124 PetriNetUnfolderBase]: 5526/17647 cut-off events. [2024-10-31 22:08:12,976 INFO L125 PetriNetUnfolderBase]: For 17439/19490 co-relation queries the response was YES. [2024-10-31 22:08:13,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39247 conditions, 17647 events. 5526/17647 cut-off events. For 17439/19490 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 209234 event pairs, 1800 based on Foata normal form. 43/15847 useless extension candidates. Maximal degree in co-relation 34885. Up to 3139 conditions per place. [2024-10-31 22:08:13,108 INFO L140 encePairwiseOnDemand]: 153/159 looper letters, 50 selfloop transitions, 5 changer transitions 0/193 dead transitions. [2024-10-31 22:08:13,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 193 transitions, 858 flow [2024-10-31 22:08:13,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:08:13,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:08:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 776 transitions. [2024-10-31 22:08:13,111 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8134171907756813 [2024-10-31 22:08:13,111 INFO L175 Difference]: Start difference. First operand has 149 places, 170 transitions, 702 flow. Second operand 6 states and 776 transitions. [2024-10-31 22:08:13,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 193 transitions, 858 flow [2024-10-31 22:08:13,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 193 transitions, 814 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:08:13,175 INFO L231 Difference]: Finished difference. Result has 151 places, 169 transitions, 666 flow [2024-10-31 22:08:13,176 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=666, PETRI_PLACES=151, PETRI_TRANSITIONS=169} [2024-10-31 22:08:13,176 INFO L277 CegarLoopForPetriNet]: 142 programPoint places, 9 predicate places. [2024-10-31 22:08:13,176 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 169 transitions, 666 flow [2024-10-31 22:08:13,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 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) [2024-10-31 22:08:13,177 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:08:13,177 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:13,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 22:08:13,178 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-31 22:08:13,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:13,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1409069112, now seen corresponding path program 1 times [2024-10-31 22:08:13,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:13,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011459605] [2024-10-31 22:08:13,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:13,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:08:13,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:08:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:08:13,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:08:13,244 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:08:13,245 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-10-31 22:08:13,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-10-31 22:08:13,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-10-31 22:08:13,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-10-31 22:08:13,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-10-31 22:08:13,247 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2024-10-31 22:08:13,247 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-10-31 22:08:13,247 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-10-31 22:08:13,247 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-10-31 22:08:13,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-10-31 22:08:13,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-10-31 22:08:13,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 22:08:13,248 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:13,249 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-31 22:08:13,249 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-31 22:08:13,304 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-10-31 22:08:13,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 195 transitions, 444 flow [2024-10-31 22:08:13,404 INFO L124 PetriNetUnfolderBase]: 41/674 cut-off events. [2024-10-31 22:08:13,404 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-10-31 22:08:13,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 674 events. 41/674 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2669 event pairs, 6 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 723. Up to 32 conditions per place. [2024-10-31 22:08:13,408 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 195 transitions, 444 flow [2024-10-31 22:08:13,414 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 158 transitions, 349 flow [2024-10-31 22:08:13,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:08:13,417 INFO L333 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, 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;@60e05bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:08:13,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-10-31 22:08:13,421 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:08:13,421 INFO L124 PetriNetUnfolderBase]: 2/47 cut-off events. [2024-10-31 22:08:13,421 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:08:13,421 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:08:13,421 INFO L204 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] [2024-10-31 22:08:13,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-31 22:08:13,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:13,422 INFO L85 PathProgramCache]: Analyzing trace with hash -830834444, now seen corresponding path program 1 times [2024-10-31 22:08:13,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:13,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969989612] [2024-10-31 22:08:13,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:13,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:08:13,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:13,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969989612] [2024-10-31 22:08:13,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969989612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:13,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:13,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:08:13,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360713601] [2024-10-31 22:08:13,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:13,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:08:13,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:13,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:08:13,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:08:14,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 195 [2024-10-31 22:08:14,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 158 transitions, 349 flow. Second operand has 6 states, 6 states have (on average 147.5) internal successors, (885), 6 states have internal predecessors, (885), 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) [2024-10-31 22:08:14,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:08:14,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 195 [2024-10-31 22:08:14,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:08:16,637 INFO L124 PetriNetUnfolderBase]: 4132/12519 cut-off events. [2024-10-31 22:08:16,637 INFO L125 PetriNetUnfolderBase]: For 883/883 co-relation queries the response was YES. [2024-10-31 22:08:16,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19162 conditions, 12519 events. 4132/12519 cut-off events. For 883/883 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 130805 event pairs, 928 based on Foata normal form. 283/11626 useless extension candidates. Maximal degree in co-relation 4497. Up to 5634 conditions per place. [2024-10-31 22:08:16,703 INFO L140 encePairwiseOnDemand]: 186/195 looper letters, 56 selfloop transitions, 5 changer transitions 1/178 dead transitions. [2024-10-31 22:08:16,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 178 transitions, 511 flow [2024-10-31 22:08:16,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:08:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:08:16,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 941 transitions. [2024-10-31 22:08:16,706 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8042735042735043 [2024-10-31 22:08:16,707 INFO L175 Difference]: Start difference. First operand has 161 places, 158 transitions, 349 flow. Second operand 6 states and 941 transitions. [2024-10-31 22:08:16,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 178 transitions, 511 flow [2024-10-31 22:08:16,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 178 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:08:16,712 INFO L231 Difference]: Finished difference. Result has 163 places, 153 transitions, 345 flow [2024-10-31 22:08:16,712 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=345, PETRI_PLACES=163, PETRI_TRANSITIONS=153} [2024-10-31 22:08:16,713 INFO L277 CegarLoopForPetriNet]: 161 programPoint places, 2 predicate places. [2024-10-31 22:08:16,713 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 153 transitions, 345 flow [2024-10-31 22:08:16,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.5) internal successors, (885), 6 states have internal predecessors, (885), 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) [2024-10-31 22:08:16,713 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:08:16,714 INFO L204 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] [2024-10-31 22:08:16,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-31 22:08:16,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-31 22:08:16,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:16,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1505432234, now seen corresponding path program 1 times [2024-10-31 22:08:16,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:16,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276482182] [2024-10-31 22:08:16,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:16,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat