./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-4.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_beae0d42-50c8-4e69-80fd-93a727e0bd84/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beae0d42-50c8-4e69-80fd-93a727e0bd84/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_beae0d42-50c8-4e69-80fd-93a727e0bd84/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beae0d42-50c8-4e69-80fd-93a727e0bd84/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beae0d42-50c8-4e69-80fd-93a727e0bd84/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_beae0d42-50c8-4e69-80fd-93a727e0bd84/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 12fde76b4484c87975ec3c2c6c513458a595d4b258864aadbba7a9ba15d60c4e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:58:32,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:58:33,078 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beae0d42-50c8-4e69-80fd-93a727e0bd84/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-31 21:58:33,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:58:33,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:58:33,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:58:33,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:58:33,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:58:33,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:58:33,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:58:33,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:58:33,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:58:33,129 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:58:33,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:58:33,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:58:33,132 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:58:33,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:58:33,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:58:33,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:58:33,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:58:33,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:58:33,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:58:33,139 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-31 21:58:33,139 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:58:33,139 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 21:58:33,140 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:58:33,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:58:33,140 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:58:33,141 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:58:33,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:58:33,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:58:33,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:58:33,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:58:33,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:58:33,143 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:58:33,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:58:33,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:58:33,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:58:33,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:58:33,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:58:33,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:58:33,148 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_beae0d42-50c8-4e69-80fd-93a727e0bd84/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_beae0d42-50c8-4e69-80fd-93a727e0bd84/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 -> 12fde76b4484c87975ec3c2c6c513458a595d4b258864aadbba7a9ba15d60c4e [2024-10-31 21:58:33,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:58:33,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:58:33,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:58:33,554 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:58:33,555 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:58:33,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beae0d42-50c8-4e69-80fd-93a727e0bd84/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-4.i Unable to find full path for "g++" [2024-10-31 21:58:35,722 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:58:36,081 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:58:36,082 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beae0d42-50c8-4e69-80fd-93a727e0bd84/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-4.i [2024-10-31 21:58:36,115 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beae0d42-50c8-4e69-80fd-93a727e0bd84/bin/uautomizer-verify-4GaUIPS5ZU/data/23818ed67/cfa80f4600b4498ba5f7f0c2fc41b0a4/FLAG3a4080d32 [2024-10-31 21:58:36,305 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beae0d42-50c8-4e69-80fd-93a727e0bd84/bin/uautomizer-verify-4GaUIPS5ZU/data/23818ed67/cfa80f4600b4498ba5f7f0c2fc41b0a4 [2024-10-31 21:58:36,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:58:36,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:58:36,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:58:36,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:58:36,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:58:36,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:58:36" (1/1) ... [2024-10-31 21:58:36,344 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a8a0c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:36, skipping insertion in model container [2024-10-31 21:58:36,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:58:36" (1/1) ... [2024-10-31 21:58:36,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:58:37,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:58:37,198 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:58:37,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:58:37,358 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:58:37,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:37 WrapperNode [2024-10-31 21:58:37,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:58:37,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:58:37,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:58:37,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:58:37,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:37" (1/1) ... [2024-10-31 21:58:37,402 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:37" (1/1) ... [2024-10-31 21:58:37,448 INFO L138 Inliner]: procedures = 267, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 265 [2024-10-31 21:58:37,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:58:37,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:58:37,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:58:37,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:58:37,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:37" (1/1) ... [2024-10-31 21:58:37,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:37" (1/1) ... [2024-10-31 21:58:37,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:37" (1/1) ... [2024-10-31 21:58:37,483 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:37" (1/1) ... [2024-10-31 21:58:37,503 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:37" (1/1) ... [2024-10-31 21:58:37,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:37" (1/1) ... [2024-10-31 21:58:37,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:37" (1/1) ... [2024-10-31 21:58:37,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:37" (1/1) ... [2024-10-31 21:58:37,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:58:37,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:58:37,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:58:37,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:58:37,526 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:37" (1/1) ... [2024-10-31 21:58:37,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:58:37,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beae0d42-50c8-4e69-80fd-93a727e0bd84/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:58:37,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beae0d42-50c8-4e69-80fd-93a727e0bd84/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:58:37,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beae0d42-50c8-4e69-80fd-93a727e0bd84/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:58:37,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 21:58:37,636 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-31 21:58:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-31 21:58:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-31 21:58:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-31 21:58:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 21:58:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:58:37,638 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2024-10-31 21:58:37,638 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2024-10-31 21:58:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 21:58:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-31 21:58:37,639 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-31 21:58:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:58:37,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:58:37,643 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 21:58:37,904 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:58:37,907 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:58:38,619 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 21:58:38,619 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:58:38,701 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:58:38,701 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-31 21:58:38,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:58:38 BoogieIcfgContainer [2024-10-31 21:58:38,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:58:38,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:58:38,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:58:38,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:58:38,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:58:36" (1/3) ... [2024-10-31 21:58:38,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d4c3380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:58:38, skipping insertion in model container [2024-10-31 21:58:38,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:37" (2/3) ... [2024-10-31 21:58:38,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d4c3380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:58:38, skipping insertion in model container [2024-10-31 21:58:38,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:58:38" (3/3) ... [2024-10-31 21:58:38,721 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter-race-4.i [2024-10-31 21:58:38,750 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:58:38,750 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-10-31 21:58:38,751 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 21:58:38,934 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-31 21:58:38,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 446 places, 455 transitions, 924 flow [2024-10-31 21:58:39,280 INFO L124 PetriNetUnfolderBase]: 21/571 cut-off events. [2024-10-31 21:58:39,280 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-31 21:58:39,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 571 events. 21/571 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 898 event pairs, 0 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 367. Up to 6 conditions per place. [2024-10-31 21:58:39,291 INFO L82 GeneralOperation]: Start removeDead. Operand has 446 places, 455 transitions, 924 flow [2024-10-31 21:58:39,301 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 376 places, 381 transitions, 772 flow [2024-10-31 21:58:39,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:58:39,317 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;@64cf8c43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:58:39,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2024-10-31 21:58:39,339 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 21:58:39,340 INFO L124 PetriNetUnfolderBase]: 0/139 cut-off events. [2024-10-31 21:58:39,340 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 21:58:39,340 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:39,341 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:39,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:58:39,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:39,347 INFO L85 PathProgramCache]: Analyzing trace with hash -153309392, now seen corresponding path program 1 times [2024-10-31 21:58:39,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:39,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210227827] [2024-10-31 21:58:39,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:39,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,885 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 21:58:39,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:39,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210227827] [2024-10-31 21:58:39,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210227827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:39,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:39,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:39,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513063464] [2024-10-31 21:58:39,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:39,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:39,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:39,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:39,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:40,016 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 455 [2024-10-31 21:58:40,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 381 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 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 21:58:40,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:40,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 455 [2024-10-31 21:58:40,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:40,882 INFO L124 PetriNetUnfolderBase]: 325/2597 cut-off events. [2024-10-31 21:58:40,883 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-10-31 21:58:40,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3180 conditions, 2597 events. 325/2597 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 17690 event pairs, 260 based on Foata normal form. 62/2272 useless extension candidates. Maximal degree in co-relation 2956. Up to 554 conditions per place. [2024-10-31 21:58:40,914 INFO L140 encePairwiseOnDemand]: 445/455 looper letters, 26 selfloop transitions, 2 changer transitions 1/371 dead transitions. [2024-10-31 21:58:40,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 371 transitions, 808 flow [2024-10-31 21:58:40,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:40,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2024-10-31 21:58:40,939 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9274725274725275 [2024-10-31 21:58:40,945 INFO L175 Difference]: Start difference. First operand has 376 places, 381 transitions, 772 flow. Second operand 3 states and 1266 transitions. [2024-10-31 21:58:40,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 371 transitions, 808 flow [2024-10-31 21:58:40,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 371 transitions, 807 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 21:58:40,960 INFO L231 Difference]: Finished difference. Result has 373 places, 370 transitions, 753 flow [2024-10-31 21:58:40,965 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=753, PETRI_PLACES=373, PETRI_TRANSITIONS=370} [2024-10-31 21:58:40,970 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -3 predicate places. [2024-10-31 21:58:40,972 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 370 transitions, 753 flow [2024-10-31 21:58:40,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 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 21:58:40,974 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:40,974 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:40,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:58:40,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:58:40,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:40,976 INFO L85 PathProgramCache]: Analyzing trace with hash -821849185, now seen corresponding path program 1 times [2024-10-31 21:58:40,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:40,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251317443] [2024-10-31 21:58:40,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:40,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:41,238 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 21:58:41,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:41,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251317443] [2024-10-31 21:58:41,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251317443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:41,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:41,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:41,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921707505] [2024-10-31 21:58:41,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:41,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:41,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:41,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:41,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:41,311 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 455 [2024-10-31 21:58:41,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 370 transitions, 753 flow. Second operand has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 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 21:58:41,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:41,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 455 [2024-10-31 21:58:41,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:42,064 INFO L124 PetriNetUnfolderBase]: 405/2955 cut-off events. [2024-10-31 21:58:42,065 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-10-31 21:58:42,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3655 conditions, 2955 events. 405/2955 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 20696 event pairs, 305 based on Foata normal form. 0/2547 useless extension candidates. Maximal degree in co-relation 3506. Up to 667 conditions per place. [2024-10-31 21:58:42,127 INFO L140 encePairwiseOnDemand]: 447/455 looper letters, 29 selfloop transitions, 1 changer transitions 0/363 dead transitions. [2024-10-31 21:58:42,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 363 transitions, 799 flow [2024-10-31 21:58:42,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1237 transitions. [2024-10-31 21:58:42,131 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9062271062271062 [2024-10-31 21:58:42,131 INFO L175 Difference]: Start difference. First operand has 373 places, 370 transitions, 753 flow. Second operand 3 states and 1237 transitions. [2024-10-31 21:58:42,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 363 transitions, 799 flow [2024-10-31 21:58:42,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 363 transitions, 795 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:42,138 INFO L231 Difference]: Finished difference. Result has 365 places, 363 transitions, 737 flow [2024-10-31 21:58:42,139 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=737, PETRI_PLACES=365, PETRI_TRANSITIONS=363} [2024-10-31 21:58:42,140 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -11 predicate places. [2024-10-31 21:58:42,140 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 363 transitions, 737 flow [2024-10-31 21:58:42,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 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 21:58:42,141 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:42,142 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:42,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:58:42,142 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:58:42,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:42,143 INFO L85 PathProgramCache]: Analyzing trace with hash -366490836, now seen corresponding path program 1 times [2024-10-31 21:58:42,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:42,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837529617] [2024-10-31 21:58:42,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:42,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,255 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 21:58:42,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:42,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837529617] [2024-10-31 21:58:42,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837529617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:42,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:42,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:42,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288674726] [2024-10-31 21:58:42,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:42,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:42,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:42,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:42,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:42,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 455 [2024-10-31 21:58:42,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 363 transitions, 737 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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 21:58:42,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:42,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 455 [2024-10-31 21:58:42,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:42,946 INFO L124 PetriNetUnfolderBase]: 367/2602 cut-off events. [2024-10-31 21:58:42,946 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-31 21:58:42,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3252 conditions, 2602 events. 367/2602 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 18181 event pairs, 295 based on Foata normal form. 0/2251 useless extension candidates. Maximal degree in co-relation 3103. Up to 619 conditions per place. [2024-10-31 21:58:42,969 INFO L140 encePairwiseOnDemand]: 452/455 looper letters, 22 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2024-10-31 21:58:42,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 362 transitions, 783 flow [2024-10-31 21:58:42,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1267 transitions. [2024-10-31 21:58:42,973 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9282051282051282 [2024-10-31 21:58:42,973 INFO L175 Difference]: Start difference. First operand has 365 places, 363 transitions, 737 flow. Second operand 3 states and 1267 transitions. [2024-10-31 21:58:42,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 362 transitions, 783 flow [2024-10-31 21:58:42,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 362 transitions, 782 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 21:58:42,980 INFO L231 Difference]: Finished difference. Result has 365 places, 362 transitions, 738 flow [2024-10-31 21:58:42,981 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=365, PETRI_TRANSITIONS=362} [2024-10-31 21:58:42,983 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -11 predicate places. [2024-10-31 21:58:42,983 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 362 transitions, 738 flow [2024-10-31 21:58:42,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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 21:58:42,985 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:42,985 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:42,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:58:42,985 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:58:42,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:42,986 INFO L85 PathProgramCache]: Analyzing trace with hash 498201976, now seen corresponding path program 1 times [2024-10-31 21:58:42,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:42,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679869517] [2024-10-31 21:58:42,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:42,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:43,338 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 21:58:43,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:43,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679869517] [2024-10-31 21:58:43,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679869517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:43,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:43,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:43,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156326093] [2024-10-31 21:58:43,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:43,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:43,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:43,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:43,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:43,395 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 455 [2024-10-31 21:58:43,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 362 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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 21:58:43,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:43,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 455 [2024-10-31 21:58:43,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:44,365 INFO L124 PetriNetUnfolderBase]: 549/3753 cut-off events. [2024-10-31 21:58:44,366 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-10-31 21:58:44,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4654 conditions, 3753 events. 549/3753 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 28868 event pairs, 411 based on Foata normal form. 0/3222 useless extension candidates. Maximal degree in co-relation 4505. Up to 861 conditions per place. [2024-10-31 21:58:44,396 INFO L140 encePairwiseOnDemand]: 452/455 looper letters, 23 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2024-10-31 21:58:44,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 361 transitions, 786 flow [2024-10-31 21:58:44,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:44,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-10-31 21:58:44,400 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9245421245421246 [2024-10-31 21:58:44,400 INFO L175 Difference]: Start difference. First operand has 365 places, 362 transitions, 738 flow. Second operand 3 states and 1262 transitions. [2024-10-31 21:58:44,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 361 transitions, 786 flow [2024-10-31 21:58:44,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 361 transitions, 782 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:44,407 INFO L231 Difference]: Finished difference. Result has 364 places, 361 transitions, 736 flow [2024-10-31 21:58:44,408 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=364, PETRI_TRANSITIONS=361} [2024-10-31 21:58:44,409 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -12 predicate places. [2024-10-31 21:58:44,409 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 361 transitions, 736 flow [2024-10-31 21:58:44,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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 21:58:44,410 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:44,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:58:44,411 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:58:44,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:44,412 INFO L85 PathProgramCache]: Analyzing trace with hash 519340054, now seen corresponding path program 1 times [2024-10-31 21:58:44,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:44,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274056060] [2024-10-31 21:58:44,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:44,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:44,546 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 21:58:44,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:44,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274056060] [2024-10-31 21:58:44,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274056060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:44,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:44,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:44,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680568546] [2024-10-31 21:58:44,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:44,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:44,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:44,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:44,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:44,608 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 455 [2024-10-31 21:58:44,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 361 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 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 21:58:44,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:44,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 455 [2024-10-31 21:58:44,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:45,477 INFO L124 PetriNetUnfolderBase]: 717/3518 cut-off events. [2024-10-31 21:58:45,477 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-10-31 21:58:45,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4635 conditions, 3518 events. 717/3518 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 25899 event pairs, 505 based on Foata normal form. 0/2919 useless extension candidates. Maximal degree in co-relation 4486. Up to 1075 conditions per place. [2024-10-31 21:58:45,519 INFO L140 encePairwiseOnDemand]: 452/455 looper letters, 24 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-10-31 21:58:45,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 360 transitions, 786 flow [2024-10-31 21:58:45,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1260 transitions. [2024-10-31 21:58:45,524 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2024-10-31 21:58:45,524 INFO L175 Difference]: Start difference. First operand has 364 places, 361 transitions, 736 flow. Second operand 3 states and 1260 transitions. [2024-10-31 21:58:45,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 360 transitions, 786 flow [2024-10-31 21:58:45,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 360 transitions, 782 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:45,533 INFO L231 Difference]: Finished difference. Result has 363 places, 360 transitions, 734 flow [2024-10-31 21:58:45,534 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=363, PETRI_TRANSITIONS=360} [2024-10-31 21:58:45,534 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -13 predicate places. [2024-10-31 21:58:45,535 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 360 transitions, 734 flow [2024-10-31 21:58:45,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 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 21:58:45,540 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:45,540 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:45,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:58:45,541 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:58:45,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:45,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1149762192, now seen corresponding path program 1 times [2024-10-31 21:58:45,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:45,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358453130] [2024-10-31 21:58:45,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:45,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:45,674 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 21:58:45,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:45,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358453130] [2024-10-31 21:58:45,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358453130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:45,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:45,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:45,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226899858] [2024-10-31 21:58:45,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:45,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:45,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:45,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:45,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:45,728 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 455 [2024-10-31 21:58:45,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 360 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 404.0) internal successors, (1212), 3 states have internal predecessors, (1212), 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 21:58:45,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:45,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 455 [2024-10-31 21:58:45,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:46,565 INFO L124 PetriNetUnfolderBase]: 1098/4016 cut-off events. [2024-10-31 21:58:46,565 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-10-31 21:58:46,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5712 conditions, 4016 events. 1098/4016 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 29233 event pairs, 732 based on Foata normal form. 0/3507 useless extension candidates. Maximal degree in co-relation 5564. Up to 1631 conditions per place. [2024-10-31 21:58:46,611 INFO L140 encePairwiseOnDemand]: 447/455 looper letters, 34 selfloop transitions, 3 changer transitions 0/366 dead transitions. [2024-10-31 21:58:46,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 366 transitions, 825 flow [2024-10-31 21:58:46,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:46,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1251 transitions. [2024-10-31 21:58:46,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9164835164835164 [2024-10-31 21:58:46,616 INFO L175 Difference]: Start difference. First operand has 363 places, 360 transitions, 734 flow. Second operand 3 states and 1251 transitions. [2024-10-31 21:58:46,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 366 transitions, 825 flow [2024-10-31 21:58:46,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 366 transitions, 821 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:46,626 INFO L231 Difference]: Finished difference. Result has 359 places, 358 transitions, 741 flow [2024-10-31 21:58:46,627 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=741, PETRI_PLACES=359, PETRI_TRANSITIONS=358} [2024-10-31 21:58:46,628 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -17 predicate places. [2024-10-31 21:58:46,629 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 358 transitions, 741 flow [2024-10-31 21:58:46,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 404.0) internal successors, (1212), 3 states have internal predecessors, (1212), 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 21:58:46,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:46,633 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:46,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 21:58:46,633 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:58:46,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:46,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2070659324, now seen corresponding path program 1 times [2024-10-31 21:58:46,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:46,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217000399] [2024-10-31 21:58:46,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:46,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:46,770 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 21:58:46,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:46,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217000399] [2024-10-31 21:58:46,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217000399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:46,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:46,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:46,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457316316] [2024-10-31 21:58:46,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:46,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:46,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:46,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:46,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:46,801 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 455 [2024-10-31 21:58:46,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 358 transitions, 741 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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 21:58:46,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:46,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 455 [2024-10-31 21:58:46,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:47,622 INFO L124 PetriNetUnfolderBase]: 526/3294 cut-off events. [2024-10-31 21:58:47,622 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-10-31 21:58:47,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4236 conditions, 3294 events. 526/3294 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 25029 event pairs, 366 based on Foata normal form. 0/2925 useless extension candidates. Maximal degree in co-relation 4088. Up to 856 conditions per place. [2024-10-31 21:58:47,651 INFO L140 encePairwiseOnDemand]: 449/455 looper letters, 28 selfloop transitions, 3 changer transitions 0/364 dead transitions. [2024-10-31 21:58:47,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 364 transitions, 815 flow [2024-10-31 21:58:47,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:47,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:47,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2024-10-31 21:58:47,655 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9304029304029304 [2024-10-31 21:58:47,655 INFO L175 Difference]: Start difference. First operand has 359 places, 358 transitions, 741 flow. Second operand 3 states and 1270 transitions. [2024-10-31 21:58:47,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 364 transitions, 815 flow [2024-10-31 21:58:47,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 364 transitions, 815 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 21:58:47,661 INFO L231 Difference]: Finished difference. Result has 359 places, 358 transitions, 756 flow [2024-10-31 21:58:47,662 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=359, PETRI_TRANSITIONS=358} [2024-10-31 21:58:47,663 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -17 predicate places. [2024-10-31 21:58:47,663 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 358 transitions, 756 flow [2024-10-31 21:58:47,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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 21:58:47,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:47,665 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:47,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 21:58:47,665 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:58:47,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:47,666 INFO L85 PathProgramCache]: Analyzing trace with hash -384115929, now seen corresponding path program 1 times [2024-10-31 21:58:47,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:47,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452848359] [2024-10-31 21:58:47,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:47,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:47,765 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 21:58:47,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:47,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452848359] [2024-10-31 21:58:47,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452848359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:47,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:47,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:47,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272107111] [2024-10-31 21:58:47,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:47,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:47,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:47,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:47,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:47,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 455 [2024-10-31 21:58:47,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 358 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 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 21:58:47,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:47,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 455 [2024-10-31 21:58:47,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:49,325 INFO L124 PetriNetUnfolderBase]: 1096/5921 cut-off events. [2024-10-31 21:58:49,325 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-10-31 21:58:49,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7900 conditions, 5921 events. 1096/5921 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 49864 event pairs, 396 based on Foata normal form. 0/5132 useless extension candidates. Maximal degree in co-relation 7751. Up to 909 conditions per place. [2024-10-31 21:58:49,369 INFO L140 encePairwiseOnDemand]: 444/455 looper letters, 40 selfloop transitions, 8 changer transitions 0/380 dead transitions. [2024-10-31 21:58:49,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 380 transitions, 902 flow [2024-10-31 21:58:49,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:49,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:49,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1281 transitions. [2024-10-31 21:58:49,373 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384615384615385 [2024-10-31 21:58:49,373 INFO L175 Difference]: Start difference. First operand has 359 places, 358 transitions, 756 flow. Second operand 3 states and 1281 transitions. [2024-10-31 21:58:49,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 380 transitions, 902 flow [2024-10-31 21:58:49,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 380 transitions, 902 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 21:58:49,380 INFO L231 Difference]: Finished difference. Result has 363 places, 366 transitions, 826 flow [2024-10-31 21:58:49,381 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=363, PETRI_TRANSITIONS=366} [2024-10-31 21:58:49,382 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -13 predicate places. [2024-10-31 21:58:49,382 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 366 transitions, 826 flow [2024-10-31 21:58:49,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 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 21:58:49,383 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:49,384 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:49,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 21:58:49,384 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting cleanerErr2ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:58:49,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:49,385 INFO L85 PathProgramCache]: Analyzing trace with hash 688664836, now seen corresponding path program 1 times [2024-10-31 21:58:49,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:49,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730724597] [2024-10-31 21:58:49,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:49,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:49,480 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 21:58:49,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:49,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730724597] [2024-10-31 21:58:49,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730724597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:49,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:49,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:49,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59125433] [2024-10-31 21:58:49,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:49,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:49,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:49,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:49,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:49,516 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 455 [2024-10-31 21:58:49,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 366 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 407.6666666666667) internal successors, (1223), 3 states have internal predecessors, (1223), 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 21:58:49,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:49,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 455 [2024-10-31 21:58:49,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:51,813 INFO L124 PetriNetUnfolderBase]: 1962/10164 cut-off events. [2024-10-31 21:58:51,813 INFO L125 PetriNetUnfolderBase]: For 304/350 co-relation queries the response was YES. [2024-10-31 21:58:51,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14105 conditions, 10164 events. 1962/10164 cut-off events. For 304/350 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 97422 event pairs, 1129 based on Foata normal form. 0/9133 useless extension candidates. Maximal degree in co-relation 13954. Up to 2652 conditions per place. [2024-10-31 21:58:51,922 INFO L140 encePairwiseOnDemand]: 448/455 looper letters, 33 selfloop transitions, 3 changer transitions 0/374 dead transitions. [2024-10-31 21:58:51,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 374 transitions, 917 flow [2024-10-31 21:58:51,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:51,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:51,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1258 transitions. [2024-10-31 21:58:51,926 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9216117216117216 [2024-10-31 21:58:51,926 INFO L175 Difference]: Start difference. First operand has 363 places, 366 transitions, 826 flow. Second operand 3 states and 1258 transitions. [2024-10-31 21:58:51,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 374 transitions, 917 flow [2024-10-31 21:58:51,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 374 transitions, 901 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:51,941 INFO L231 Difference]: Finished difference. Result has 360 places, 365 transitions, 823 flow [2024-10-31 21:58:51,942 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=823, PETRI_PLACES=360, PETRI_TRANSITIONS=365} [2024-10-31 21:58:51,944 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -16 predicate places. [2024-10-31 21:58:51,944 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 365 transitions, 823 flow [2024-10-31 21:58:51,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.6666666666667) internal successors, (1223), 3 states have internal predecessors, (1223), 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 21:58:51,945 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:51,945 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:51,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 21:58:51,946 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:58:51,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:51,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1043734094, now seen corresponding path program 1 times [2024-10-31 21:58:51,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:51,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601513943] [2024-10-31 21:58:51,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:51,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:52,261 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 21:58:52,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:52,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601513943] [2024-10-31 21:58:52,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601513943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:52,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:52,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:52,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889153403] [2024-10-31 21:58:52,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:52,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:52,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:52,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:52,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:52,392 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 455 [2024-10-31 21:58:52,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 365 transitions, 823 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 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 21:58:52,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:52,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 455 [2024-10-31 21:58:52,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:55,005 INFO L124 PetriNetUnfolderBase]: 3184/14759 cut-off events. [2024-10-31 21:58:55,005 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2024-10-31 21:58:55,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21328 conditions, 14759 events. 3184/14759 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 149332 event pairs, 1587 based on Foata normal form. 0/13234 useless extension candidates. Maximal degree in co-relation 21176. Up to 3612 conditions per place. [2024-10-31 21:58:55,127 INFO L140 encePairwiseOnDemand]: 445/455 looper letters, 41 selfloop transitions, 9 changer transitions 0/386 dead transitions. [2024-10-31 21:58:55,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 386 transitions, 971 flow [2024-10-31 21:58:55,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:55,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1281 transitions. [2024-10-31 21:58:55,131 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384615384615385 [2024-10-31 21:58:55,131 INFO L175 Difference]: Start difference. First operand has 360 places, 365 transitions, 823 flow. Second operand 3 states and 1281 transitions. [2024-10-31 21:58:55,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 386 transitions, 971 flow [2024-10-31 21:58:55,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 386 transitions, 971 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 21:58:55,140 INFO L231 Difference]: Finished difference. Result has 364 places, 373 transitions, 893 flow [2024-10-31 21:58:55,141 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=893, PETRI_PLACES=364, PETRI_TRANSITIONS=373} [2024-10-31 21:58:55,141 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -12 predicate places. [2024-10-31 21:58:55,142 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 373 transitions, 893 flow [2024-10-31 21:58:55,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 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 21:58:55,143 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:55,143 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:55,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 21:58:55,143 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:58:55,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:55,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1326457556, now seen corresponding path program 1 times [2024-10-31 21:58:55,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:55,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270293234] [2024-10-31 21:58:55,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:55,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:55,375 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 21:58:55,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:55,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270293234] [2024-10-31 21:58:55,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270293234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:55,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:55,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:58:55,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361362260] [2024-10-31 21:58:55,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:55,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:58:55,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:55,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:58:55,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:58:55,497 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 455 [2024-10-31 21:58:55,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 373 transitions, 893 flow. Second operand has 5 states, 5 states have (on average 414.8) internal successors, (2074), 5 states have internal predecessors, (2074), 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 21:58:55,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:55,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 455 [2024-10-31 21:58:55,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:57,576 INFO L124 PetriNetUnfolderBase]: 1866/10516 cut-off events. [2024-10-31 21:58:57,576 INFO L125 PetriNetUnfolderBase]: For 406/423 co-relation queries the response was YES. [2024-10-31 21:58:57,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15379 conditions, 10516 events. 1866/10516 cut-off events. For 406/423 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 105074 event pairs, 1263 based on Foata normal form. 4/9451 useless extension candidates. Maximal degree in co-relation 15223. Up to 2179 conditions per place. [2024-10-31 21:58:57,668 INFO L140 encePairwiseOnDemand]: 446/455 looper letters, 34 selfloop transitions, 8 changer transitions 0/387 dead transitions. [2024-10-31 21:58:57,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 387 transitions, 1004 flow [2024-10-31 21:58:57,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:58:57,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 21:58:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2521 transitions. [2024-10-31 21:58:57,682 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9234432234432235 [2024-10-31 21:58:57,682 INFO L175 Difference]: Start difference. First operand has 364 places, 373 transitions, 893 flow. Second operand 6 states and 2521 transitions. [2024-10-31 21:58:57,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 387 transitions, 1004 flow [2024-10-31 21:58:57,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 387 transitions, 986 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:57,708 INFO L231 Difference]: Finished difference. Result has 371 places, 377 transitions, 920 flow [2024-10-31 21:58:57,709 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=920, PETRI_PLACES=371, PETRI_TRANSITIONS=377} [2024-10-31 21:58:57,713 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -5 predicate places. [2024-10-31 21:58:57,713 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 377 transitions, 920 flow [2024-10-31 21:58:57,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 414.8) internal successors, (2074), 5 states have internal predecessors, (2074), 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 21:58:57,716 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:57,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:57,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 21:58:57,718 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:58:57,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:57,722 INFO L85 PathProgramCache]: Analyzing trace with hash -979779122, now seen corresponding path program 1 times [2024-10-31 21:58:57,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:57,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467412650] [2024-10-31 21:58:57,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:57,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:57,994 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 21:58:57,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:57,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467412650] [2024-10-31 21:58:57,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467412650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:57,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:57,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:57,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758220541] [2024-10-31 21:58:57,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:57,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:57,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:57,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:57,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:58,106 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 455 [2024-10-31 21:58:58,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 377 transitions, 920 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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 21:58:58,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:58,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 455 [2024-10-31 21:58:58,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:01,396 INFO L124 PetriNetUnfolderBase]: 2785/13860 cut-off events. [2024-10-31 21:59:01,397 INFO L125 PetriNetUnfolderBase]: For 1048/1094 co-relation queries the response was YES. [2024-10-31 21:59:01,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21127 conditions, 13860 events. 2785/13860 cut-off events. For 1048/1094 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 141852 event pairs, 1492 based on Foata normal form. 0/12466 useless extension candidates. Maximal degree in co-relation 20966. Up to 3378 conditions per place. [2024-10-31 21:59:01,502 INFO L140 encePairwiseOnDemand]: 450/455 looper letters, 38 selfloop transitions, 6 changer transitions 0/389 dead transitions. [2024-10-31 21:59:01,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 389 transitions, 1043 flow [2024-10-31 21:59:01,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:01,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1276 transitions. [2024-10-31 21:59:01,507 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9347985347985348 [2024-10-31 21:59:01,507 INFO L175 Difference]: Start difference. First operand has 371 places, 377 transitions, 920 flow. Second operand 3 states and 1276 transitions. [2024-10-31 21:59:01,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 389 transitions, 1043 flow [2024-10-31 21:59:01,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 389 transitions, 1039 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 21:59:01,522 INFO L231 Difference]: Finished difference. Result has 374 places, 382 transitions, 970 flow [2024-10-31 21:59:01,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=970, PETRI_PLACES=374, PETRI_TRANSITIONS=382} [2024-10-31 21:59:01,524 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -2 predicate places. [2024-10-31 21:59:01,524 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 382 transitions, 970 flow [2024-10-31 21:59:01,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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 21:59:01,525 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:01,526 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:59:01,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 21:59:01,526 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:59:01,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:01,527 INFO L85 PathProgramCache]: Analyzing trace with hash 796722750, now seen corresponding path program 1 times [2024-10-31 21:59:01,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:01,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494701214] [2024-10-31 21:59:01,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:01,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:01,801 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 21:59:01,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:01,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494701214] [2024-10-31 21:59:01,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494701214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:01,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:01,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:59:01,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538458184] [2024-10-31 21:59:01,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:01,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:59:01,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:01,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:59:01,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:59:01,970 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 455 [2024-10-31 21:59:01,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 382 transitions, 970 flow. Second operand has 5 states, 5 states have (on average 415.0) internal successors, (2075), 5 states have internal predecessors, (2075), 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 21:59:01,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:01,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 455 [2024-10-31 21:59:01,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:04,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([957] L1030-2-->L1030-5: Formula: (and (= |v_threadThread1of1ForFork0_#t~ret5_1| 0) (= |v_#pthreadsMutex_119| (store |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22 (store (select |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22) (+ v_~datas_mutex~0.offset_22 (* v_threadThread1of1ForFork0_~i~0_13 24)) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} OutVars{threadThread1of1ForFork0_#t~ret5=|v_threadThread1of1ForFork0_#t~ret5_1|, #pthreadsMutex=|v_#pthreadsMutex_119|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork0_#t~ret5][343], [Black: 477#true, 170#ULTIMATE.startFINALtrue, Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 428#L1045-4true, 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), 447#true, 218#L1030-5true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 489#(<= ~threads_total~0 0), Black: 492#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), 497#true, Black: 490#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 464#true, 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 445#true, Black: 468#true, Black: 472#true, 502#true]) [2024-10-31 21:59:04,736 INFO L294 olderBase$Statistics]: this new event has 378 ancestors and is cut-off event [2024-10-31 21:59:04,736 INFO L297 olderBase$Statistics]: existing Event has 378 ancestors and is cut-off event [2024-10-31 21:59:04,736 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2024-10-31 21:59:04,736 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2024-10-31 21:59:04,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([907] L1035-6-->L1035-7: Formula: (= v_cleanerThread1of1ForFork1_~i~1_31 (+ |v_cleanerThread1of1ForFork1_#t~post15_3| 1)) InVars {cleanerThread1of1ForFork1_#t~post15=|v_cleanerThread1of1ForFork1_#t~post15_3|} OutVars{cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_31, cleanerThread1of1ForFork1_#t~post15=|v_cleanerThread1of1ForFork1_#t~post15_3|} AuxVars[] AssignedVars[cleanerThread1of1ForFork1_~i~1][327], [Black: 477#true, 170#ULTIMATE.startFINALtrue, Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 470#(= |#race~tids~0| 0), 73#L1035-7true, 479#(= |#race~datas~0| 0), 447#true, 454#(= |#race~threads_total~0| 0), 239#L1029-5true, Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 489#(<= ~threads_total~0 0), Black: 492#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), 497#true, Black: 490#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 464#true, 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), Black: 468#true, 445#true, Black: 472#true, 502#true]) [2024-10-31 21:59:04,791 INFO L294 olderBase$Statistics]: this new event has 376 ancestors and is cut-off event [2024-10-31 21:59:04,792 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2024-10-31 21:59:04,792 INFO L297 olderBase$Statistics]: existing Event has 376 ancestors and is cut-off event [2024-10-31 21:59:04,792 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2024-10-31 21:59:05,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([907] L1035-6-->L1035-7: Formula: (= v_cleanerThread1of1ForFork1_~i~1_31 (+ |v_cleanerThread1of1ForFork1_#t~post15_3| 1)) InVars {cleanerThread1of1ForFork1_#t~post15=|v_cleanerThread1of1ForFork1_#t~post15_3|} OutVars{cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_31, cleanerThread1of1ForFork1_#t~post15=|v_cleanerThread1of1ForFork1_#t~post15_3|} AuxVars[] AssignedVars[cleanerThread1of1ForFork1_~i~1][327], [Black: 477#true, 170#ULTIMATE.startFINALtrue, Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 73#L1035-7true, 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), 447#true, 454#(= |#race~threads_total~0| 0), 239#L1029-5true, Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 489#(<= ~threads_total~0 0), Black: 492#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 490#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), 497#true, 466#(= |#race~datas_mutex~0| 0), Black: 464#true, Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 445#true, Black: 468#true, Black: 474#(= |#race~threads_alive~0| 0), 502#true]) [2024-10-31 21:59:05,061 INFO L294 olderBase$Statistics]: this new event has 397 ancestors and is cut-off event [2024-10-31 21:59:05,061 INFO L297 olderBase$Statistics]: existing Event has 376 ancestors and is cut-off event [2024-10-31 21:59:05,061 INFO L297 olderBase$Statistics]: existing Event has 376 ancestors and is cut-off event [2024-10-31 21:59:05,061 INFO L297 olderBase$Statistics]: existing Event has 376 ancestors and is cut-off event [2024-10-31 21:59:05,080 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([957] L1030-2-->L1030-5: Formula: (and (= |v_threadThread1of1ForFork0_#t~ret5_1| 0) (= |v_#pthreadsMutex_119| (store |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22 (store (select |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22) (+ v_~datas_mutex~0.offset_22 (* v_threadThread1of1ForFork0_~i~0_13 24)) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} OutVars{threadThread1of1ForFork0_#t~ret5=|v_threadThread1of1ForFork0_#t~ret5_1|, #pthreadsMutex=|v_#pthreadsMutex_119|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork0_#t~ret5][343], [Black: 477#true, 170#ULTIMATE.startFINALtrue, Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 428#L1045-4true, 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), 447#true, 454#(= |#race~threads_total~0| 0), 218#L1030-5true, Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 489#(<= ~threads_total~0 0), Black: 492#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 490#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), 497#true, 466#(= |#race~datas_mutex~0| 0), Black: 464#true, Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 445#true, Black: 468#true, Black: 474#(= |#race~threads_alive~0| 0), 502#true]) [2024-10-31 21:59:05,080 INFO L294 olderBase$Statistics]: this new event has 399 ancestors and is cut-off event [2024-10-31 21:59:05,080 INFO L297 olderBase$Statistics]: existing Event has 378 ancestors and is cut-off event [2024-10-31 21:59:05,080 INFO L297 olderBase$Statistics]: existing Event has 378 ancestors and is cut-off event [2024-10-31 21:59:05,081 INFO L297 olderBase$Statistics]: existing Event has 378 ancestors and is cut-off event [2024-10-31 21:59:05,204 INFO L124 PetriNetUnfolderBase]: 3015/15139 cut-off events. [2024-10-31 21:59:05,204 INFO L125 PetriNetUnfolderBase]: For 1373/1465 co-relation queries the response was YES. [2024-10-31 21:59:05,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23206 conditions, 15139 events. 3015/15139 cut-off events. For 1373/1465 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 156968 event pairs, 1725 based on Foata normal form. 7/13591 useless extension candidates. Maximal degree in co-relation 23043. Up to 3626 conditions per place. [2024-10-31 21:59:05,374 INFO L140 encePairwiseOnDemand]: 446/455 looper letters, 25 selfloop transitions, 4 changer transitions 17/394 dead transitions. [2024-10-31 21:59:05,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 394 transitions, 1081 flow [2024-10-31 21:59:05,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:59:05,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 21:59:05,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2522 transitions. [2024-10-31 21:59:05,384 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2024-10-31 21:59:05,384 INFO L175 Difference]: Start difference. First operand has 374 places, 382 transitions, 970 flow. Second operand 6 states and 2522 transitions. [2024-10-31 21:59:05,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 394 transitions, 1081 flow [2024-10-31 21:59:05,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 394 transitions, 1069 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:59:05,402 INFO L231 Difference]: Finished difference. Result has 379 places, 377 transitions, 945 flow [2024-10-31 21:59:05,403 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=953, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=945, PETRI_PLACES=379, PETRI_TRANSITIONS=377} [2024-10-31 21:59:05,404 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, 3 predicate places. [2024-10-31 21:59:05,404 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 377 transitions, 945 flow [2024-10-31 21:59:05,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 415.0) internal successors, (2075), 5 states have internal predecessors, (2075), 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 21:59:05,405 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:05,406 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:59:05,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 21:59:05,406 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:59:05,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:05,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1599916473, now seen corresponding path program 1 times [2024-10-31 21:59:05,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:05,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836039079] [2024-10-31 21:59:05,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:05,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat