./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdec3ede-28e3-4ade-9202-ed1aba239ec4/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdec3ede-28e3-4ade-9202-ed1aba239ec4/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdec3ede-28e3-4ade-9202-ed1aba239ec4/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdec3ede-28e3-4ade-9202-ed1aba239ec4/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdec3ede-28e3-4ade-9202-ed1aba239ec4/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdec3ede-28e3-4ade-9202-ed1aba239ec4/bin/uautomizer-verify-LYvppIcaGC --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 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 02:07:41,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 02:07:41,484 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdec3ede-28e3-4ade-9202-ed1aba239ec4/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-24 02:07:41,494 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 02:07:41,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 02:07:41,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 02:07:41,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 02:07:41,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 02:07:41,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 02:07:41,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 02:07:41,525 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 02:07:41,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 02:07:41,525 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 02:07:41,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 02:07:41,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 02:07:41,526 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 02:07:41,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 02:07:41,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 02:07:41,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 02:07:41,526 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 02:07:41,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 02:07:41,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 02:07:41,527 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-24 02:07:41,527 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-24 02:07:41,527 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 02:07:41,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 02:07:41,527 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 02:07:41,527 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 02:07:41,527 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 02:07:41,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 02:07:41,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 02:07:41,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 02:07:41,528 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 02:07:41,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 02:07:41,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 02:07:41,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 02:07:41,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 02:07:41,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 02:07:41,529 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 02:07:41,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 02:07:41,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 02:07:41,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 02:07:41,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 02:07:41,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 02:07:41,530 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 02:07:41,530 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 02:07:41,530 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_fdec3ede-28e3-4ade-9202-ed1aba239ec4/bin/uautomizer-verify-LYvppIcaGC 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 -> 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 [2024-11-24 02:07:41,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 02:07:41,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 02:07:41,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 02:07:41,907 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 02:07:41,908 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 02:07:41,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdec3ede-28e3-4ade-9202-ed1aba239ec4/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2024-11-24 02:07:45,512 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdec3ede-28e3-4ade-9202-ed1aba239ec4/bin/uautomizer-verify-LYvppIcaGC/data/8e83700e0/50c29e55b987414e9583c5edee6343ef/FLAG67b0247e9 [2024-11-24 02:07:45,930 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 02:07:45,931 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdec3ede-28e3-4ade-9202-ed1aba239ec4/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2024-11-24 02:07:45,947 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdec3ede-28e3-4ade-9202-ed1aba239ec4/bin/uautomizer-verify-LYvppIcaGC/data/8e83700e0/50c29e55b987414e9583c5edee6343ef/FLAG67b0247e9 [2024-11-24 02:07:45,966 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdec3ede-28e3-4ade-9202-ed1aba239ec4/bin/uautomizer-verify-LYvppIcaGC/data/8e83700e0/50c29e55b987414e9583c5edee6343ef [2024-11-24 02:07:45,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 02:07:45,971 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 02:07:45,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 02:07:45,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 02:07:45,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 02:07:45,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 02:07:45" (1/1) ... [2024-11-24 02:07:45,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a2f4821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:07:45, skipping insertion in model container [2024-11-24 02:07:45,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 02:07:45" (1/1) ... [2024-11-24 02:07:46,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 02:07:46,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 02:07:46,585 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 02:07:46,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 02:07:46,690 INFO L204 MainTranslator]: Completed translation [2024-11-24 02:07:46,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:07:46 WrapperNode [2024-11-24 02:07:46,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 02:07:46,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 02:07:46,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 02:07:46,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 02:07:46,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:07:46" (1/1) ... [2024-11-24 02:07:46,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:07:46" (1/1) ... [2024-11-24 02:07:46,744 INFO L138 Inliner]: procedures = 164, calls = 17, calls flagged for inlining = 4, calls inlined = 5, statements flattened = 86 [2024-11-24 02:07:46,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 02:07:46,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 02:07:46,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 02:07:46,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 02:07:46,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:07:46" (1/1) ... [2024-11-24 02:07:46,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:07:46" (1/1) ... [2024-11-24 02:07:46,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:07:46" (1/1) ... [2024-11-24 02:07:46,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:07:46" (1/1) ... [2024-11-24 02:07:46,765 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:07:46" (1/1) ... [2024-11-24 02:07:46,766 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:07:46" (1/1) ... [2024-11-24 02:07:46,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:07:46" (1/1) ... [2024-11-24 02:07:46,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:07:46" (1/1) ... [2024-11-24 02:07:46,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:07:46" (1/1) ... [2024-11-24 02:07:46,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 02:07:46,776 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 02:07:46,780 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 02:07:46,780 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 02:07:46,782 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:07:46" (1/1) ... [2024-11-24 02:07:46,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 02:07:46,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdec3ede-28e3-4ade-9202-ed1aba239ec4/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:07:46,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdec3ede-28e3-4ade-9202-ed1aba239ec4/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 02:07:46,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdec3ede-28e3-4ade-9202-ed1aba239ec4/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 02:07:46,871 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-24 02:07:46,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-24 02:07:46,872 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-24 02:07:46,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 02:07:46,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-24 02:07:46,872 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-24 02:07:46,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 02:07:46,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 02:07:46,874 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-24 02:07:47,063 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 02:07:47,066 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 02:07:47,352 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-24 02:07:47,352 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 02:07:47,381 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 02:07:47,381 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-24 02:07:47,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:07:47 BoogieIcfgContainer [2024-11-24 02:07:47,381 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 02:07:47,384 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 02:07:47,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 02:07:47,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 02:07:47,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 02:07:45" (1/3) ... [2024-11-24 02:07:47,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f52f7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 02:07:47, skipping insertion in model container [2024-11-24 02:07:47,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:07:46" (2/3) ... [2024-11-24 02:07:47,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f52f7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 02:07:47, skipping insertion in model container [2024-11-24 02:07:47,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:07:47" (3/3) ... [2024-11-24 02:07:47,394 INFO L128 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-pthread.i [2024-11-24 02:07:47,413 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 02:07:47,415 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 48_ticket_lock_low_contention_vs-pthread.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2024-11-24 02:07:47,416 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-24 02:07:47,506 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-24 02:07:47,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 99 transitions, 202 flow [2024-11-24 02:07:47,689 INFO L124 PetriNetUnfolderBase]: 8/149 cut-off events. [2024-11-24 02:07:47,692 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 02:07:47,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 149 events. 8/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 355 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. [2024-11-24 02:07:47,700 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 99 transitions, 202 flow [2024-11-24 02:07:47,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 99 transitions, 202 flow [2024-11-24 02:07:47,714 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 02:07:47,729 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;@2302856f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 02:07:47,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-24 02:07:47,748 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-24 02:07:47,748 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2024-11-24 02:07:47,748 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 02:07:47,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:07:47,749 INFO L206 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] [2024-11-24 02:07:47,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-24 02:07:47,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:47,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1383098230, now seen corresponding path program 1 times [2024-11-24 02:07:47,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:47,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026881898] [2024-11-24 02:07:47,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:47,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:48,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:07:48,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026881898] [2024-11-24 02:07:48,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026881898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:07:48,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:07:48,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:07:48,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644347827] [2024-11-24 02:07:48,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:07:48,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 02:07:48,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:07:48,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 02:07:48,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 02:07:48,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 99 [2024-11-24 02:07:48,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 99 transitions, 202 flow. Second operand has 2 states, 2 states have (on average 88.0) internal successors, (176), 2 states have internal predecessors, (176), 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-11-24 02:07:48,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:07:48,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 99 [2024-11-24 02:07:48,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:07:48,288 INFO L124 PetriNetUnfolderBase]: 4/189 cut-off events. [2024-11-24 02:07:48,288 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-24 02:07:48,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 189 events. 4/189 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 552 event pairs, 4 based on Foata normal form. 16/181 useless extension candidates. Maximal degree in co-relation 137. Up to 16 conditions per place. [2024-11-24 02:07:48,293 INFO L140 encePairwiseOnDemand]: 94/99 looper letters, 5 selfloop transitions, 0 changer transitions 0/90 dead transitions. [2024-11-24 02:07:48,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 90 transitions, 194 flow [2024-11-24 02:07:48,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 02:07:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-24 02:07:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2024-11-24 02:07:48,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9292929292929293 [2024-11-24 02:07:48,317 INFO L175 Difference]: Start difference. First operand has 97 places, 99 transitions, 202 flow. Second operand 2 states and 184 transitions. [2024-11-24 02:07:48,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 90 transitions, 194 flow [2024-11-24 02:07:48,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 90 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-24 02:07:48,333 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 184 flow [2024-11-24 02:07:48,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=184, PETRI_PLACES=94, PETRI_TRANSITIONS=90} [2024-11-24 02:07:48,343 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, -3 predicate places. [2024-11-24 02:07:48,343 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 184 flow [2024-11-24 02:07:48,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.0) internal successors, (176), 2 states have internal predecessors, (176), 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-11-24 02:07:48,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:07:48,346 INFO L206 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] [2024-11-24 02:07:48,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 02:07:48,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-24 02:07:48,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:48,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1979788872, now seen corresponding path program 1 times [2024-11-24 02:07:48,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:48,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198061579] [2024-11-24 02:07:48,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:48,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:48,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:07:48,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198061579] [2024-11-24 02:07:48,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198061579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:07:48,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:07:48,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:07:48,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078690167] [2024-11-24 02:07:48,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:07:48,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:07:48,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:07:48,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:07:48,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:07:48,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 99 [2024-11-24 02:07:48,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-11-24 02:07:48,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:07:48,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 99 [2024-11-24 02:07:48,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:07:48,749 INFO L124 PetriNetUnfolderBase]: 59/448 cut-off events. [2024-11-24 02:07:48,749 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-24 02:07:48,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 448 events. 59/448 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2372 event pairs, 41 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 597. Up to 126 conditions per place. [2024-11-24 02:07:48,755 INFO L140 encePairwiseOnDemand]: 92/99 looper letters, 18 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2024-11-24 02:07:48,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 97 transitions, 246 flow [2024-11-24 02:07:48,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:07:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:07:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2024-11-24 02:07:48,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8417508417508418 [2024-11-24 02:07:48,762 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 184 flow. Second operand 3 states and 250 transitions. [2024-11-24 02:07:48,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 97 transitions, 246 flow [2024-11-24 02:07:48,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-24 02:07:48,768 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 230 flow [2024-11-24 02:07:48,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2024-11-24 02:07:48,771 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 1 predicate places. [2024-11-24 02:07:48,772 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 230 flow [2024-11-24 02:07:48,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-11-24 02:07:48,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:07:48,773 INFO L206 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] [2024-11-24 02:07:48,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 02:07:48,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-24 02:07:48,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:48,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1835186691, now seen corresponding path program 1 times [2024-11-24 02:07:48,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:48,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077047581] [2024-11-24 02:07:48,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:48,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:48,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:07:48,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077047581] [2024-11-24 02:07:48,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077047581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:07:48,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:07:48,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:07:48,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826702996] [2024-11-24 02:07:48,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:07:48,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:07:48,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:07:48,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:07:48,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:07:48,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 99 [2024-11-24 02:07:48,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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-11-24 02:07:48,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:07:48,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 99 [2024-11-24 02:07:48,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:07:49,088 INFO L124 PetriNetUnfolderBase]: 64/427 cut-off events. [2024-11-24 02:07:49,088 INFO L125 PetriNetUnfolderBase]: For 46/48 co-relation queries the response was YES. [2024-11-24 02:07:49,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 427 events. 64/427 cut-off events. For 46/48 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2342 event pairs, 32 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 667. Up to 119 conditions per place. [2024-11-24 02:07:49,093 INFO L140 encePairwiseOnDemand]: 92/99 looper letters, 18 selfloop transitions, 7 changer transitions 0/102 dead transitions. [2024-11-24 02:07:49,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 102 transitions, 298 flow [2024-11-24 02:07:49,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:07:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:07:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2024-11-24 02:07:49,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8552188552188552 [2024-11-24 02:07:49,148 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 230 flow. Second operand 3 states and 254 transitions. [2024-11-24 02:07:49,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 102 transitions, 298 flow [2024-11-24 02:07:49,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 102 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:07:49,159 INFO L231 Difference]: Finished difference. Result has 100 places, 100 transitions, 270 flow [2024-11-24 02:07:49,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=100, PETRI_TRANSITIONS=100} [2024-11-24 02:07:49,161 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 3 predicate places. [2024-11-24 02:07:49,161 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 100 transitions, 270 flow [2024-11-24 02:07:49,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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-11-24 02:07:49,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:07:49,161 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:07:49,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 02:07:49,162 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-24 02:07:49,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:49,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2036636934, now seen corresponding path program 1 times [2024-11-24 02:07:49,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:49,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668267677] [2024-11-24 02:07:49,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:49,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 02:07:49,217 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 02:07:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 02:07:49,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 02:07:49,274 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 02:07:49,276 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-11-24 02:07:49,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-11-24 02:07:49,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-11-24 02:07:49,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-11-24 02:07:49,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-11-24 02:07:49,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-11-24 02:07:49,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-11-24 02:07:49,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-11-24 02:07:49,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-11-24 02:07:49,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-11-24 02:07:49,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 02:07:49,283 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-24 02:07:49,292 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-24 02:07:49,293 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-24 02:07:49,359 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-24 02:07:49,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 130 transitions, 270 flow [2024-11-24 02:07:49,414 INFO L124 PetriNetUnfolderBase]: 13/230 cut-off events. [2024-11-24 02:07:49,414 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-24 02:07:49,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 230 events. 13/230 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 771 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 150. Up to 6 conditions per place. [2024-11-24 02:07:49,418 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 130 transitions, 270 flow [2024-11-24 02:07:49,420 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 130 transitions, 270 flow [2024-11-24 02:07:49,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 02:07:49,423 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;@2302856f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 02:07:49,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-24 02:07:49,438 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-24 02:07:49,439 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2024-11-24 02:07:49,439 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 02:07:49,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:07:49,439 INFO L206 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] [2024-11-24 02:07:49,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-24 02:07:49,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:49,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1523227382, now seen corresponding path program 1 times [2024-11-24 02:07:49,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:49,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418044770] [2024-11-24 02:07:49,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:49,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:49,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:07:49,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418044770] [2024-11-24 02:07:49,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418044770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:07:49,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:07:49,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:07:49,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604064748] [2024-11-24 02:07:49,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:07:49,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 02:07:49,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:07:49,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 02:07:49,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 02:07:49,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 130 [2024-11-24 02:07:49,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 130 transitions, 270 flow. Second operand has 2 states, 2 states have (on average 113.0) internal successors, (226), 2 states have internal predecessors, (226), 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-11-24 02:07:49,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:07:49,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 130 [2024-11-24 02:07:49,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:07:49,663 INFO L124 PetriNetUnfolderBase]: 34/566 cut-off events. [2024-11-24 02:07:49,664 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-24 02:07:49,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 566 events. 34/566 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3257 event pairs, 34 based on Foata normal form. 67/546 useless extension candidates. Maximal degree in co-relation 429. Up to 73 conditions per place. [2024-11-24 02:07:49,676 INFO L140 encePairwiseOnDemand]: 123/130 looper letters, 8 selfloop transitions, 0 changer transitions 0/117 dead transitions. [2024-11-24 02:07:49,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 117 transitions, 260 flow [2024-11-24 02:07:49,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 02:07:49,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-24 02:07:49,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 239 transitions. [2024-11-24 02:07:49,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9192307692307692 [2024-11-24 02:07:49,679 INFO L175 Difference]: Start difference. First operand has 128 places, 130 transitions, 270 flow. Second operand 2 states and 239 transitions. [2024-11-24 02:07:49,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 117 transitions, 260 flow [2024-11-24 02:07:49,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 117 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-24 02:07:49,686 INFO L231 Difference]: Finished difference. Result has 123 places, 117 transitions, 244 flow [2024-11-24 02:07:49,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=244, PETRI_PLACES=123, PETRI_TRANSITIONS=117} [2024-11-24 02:07:49,687 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, -5 predicate places. [2024-11-24 02:07:49,688 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 117 transitions, 244 flow [2024-11-24 02:07:49,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 113.0) internal successors, (226), 2 states have internal predecessors, (226), 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-11-24 02:07:49,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:07:49,688 INFO L206 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] [2024-11-24 02:07:49,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 02:07:49,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-24 02:07:49,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:49,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1859273482, now seen corresponding path program 1 times [2024-11-24 02:07:49,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:49,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650843592] [2024-11-24 02:07:49,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:49,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:49,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:07:49,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650843592] [2024-11-24 02:07:49,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650843592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:07:49,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:07:49,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:07:49,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830210054] [2024-11-24 02:07:49,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:07:49,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:07:49,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:07:49,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:07:49,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:07:49,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2024-11-24 02:07:49,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 117 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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-11-24 02:07:49,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:07:49,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2024-11-24 02:07:49,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:07:50,554 INFO L124 PetriNetUnfolderBase]: 845/3283 cut-off events. [2024-11-24 02:07:50,556 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-24 02:07:50,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4733 conditions, 3283 events. 845/3283 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 29790 event pairs, 632 based on Foata normal form. 0/2783 useless extension candidates. Maximal degree in co-relation 4728. Up to 1252 conditions per place. [2024-11-24 02:07:50,586 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 26 selfloop transitions, 9 changer transitions 0/129 dead transitions. [2024-11-24 02:07:50,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 129 transitions, 338 flow [2024-11-24 02:07:50,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:07:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:07:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2024-11-24 02:07:50,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8384615384615385 [2024-11-24 02:07:50,589 INFO L175 Difference]: Start difference. First operand has 123 places, 117 transitions, 244 flow. Second operand 3 states and 327 transitions. [2024-11-24 02:07:50,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 129 transitions, 338 flow [2024-11-24 02:07:50,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 129 transitions, 338 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-24 02:07:50,596 INFO L231 Difference]: Finished difference. Result has 127 places, 125 transitions, 314 flow [2024-11-24 02:07:50,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=127, PETRI_TRANSITIONS=125} [2024-11-24 02:07:50,600 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, -1 predicate places. [2024-11-24 02:07:50,600 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 125 transitions, 314 flow [2024-11-24 02:07:50,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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-11-24 02:07:50,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:07:50,601 INFO L206 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] [2024-11-24 02:07:50,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 02:07:50,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-24 02:07:50,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:50,605 INFO L85 PathProgramCache]: Analyzing trace with hash 586722563, now seen corresponding path program 1 times [2024-11-24 02:07:50,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:50,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932439192] [2024-11-24 02:07:50,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:50,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:50,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:07:50,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932439192] [2024-11-24 02:07:50,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932439192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:07:50,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:07:50,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:07:50,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753812035] [2024-11-24 02:07:50,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:07:50,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:07:50,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:07:50,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:07:50,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:07:50,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2024-11-24 02:07:50,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 125 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-11-24 02:07:50,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:07:50,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2024-11-24 02:07:50,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:07:51,519 INFO L124 PetriNetUnfolderBase]: 1088/3830 cut-off events. [2024-11-24 02:07:51,520 INFO L125 PetriNetUnfolderBase]: For 861/1014 co-relation queries the response was YES. [2024-11-24 02:07:51,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6732 conditions, 3830 events. 1088/3830 cut-off events. For 861/1014 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 36105 event pairs, 560 based on Foata normal form. 3/3223 useless extension candidates. Maximal degree in co-relation 6725. Up to 1421 conditions per place. [2024-11-24 02:07:51,594 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 30 selfloop transitions, 13 changer transitions 0/141 dead transitions. [2024-11-24 02:07:51,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 141 transitions, 459 flow [2024-11-24 02:07:51,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:07:51,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:07:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2024-11-24 02:07:51,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8512820512820513 [2024-11-24 02:07:51,597 INFO L175 Difference]: Start difference. First operand has 127 places, 125 transitions, 314 flow. Second operand 3 states and 332 transitions. [2024-11-24 02:07:51,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 141 transitions, 459 flow [2024-11-24 02:07:51,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 141 transitions, 433 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:07:51,609 INFO L231 Difference]: Finished difference. Result has 129 places, 136 transitions, 408 flow [2024-11-24 02:07:51,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=129, PETRI_TRANSITIONS=136} [2024-11-24 02:07:51,610 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 1 predicate places. [2024-11-24 02:07:51,610 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 136 transitions, 408 flow [2024-11-24 02:07:51,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-11-24 02:07:51,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:07:51,611 INFO L206 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] [2024-11-24 02:07:51,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 02:07:51,611 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-24 02:07:51,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:51,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1718394208, now seen corresponding path program 1 times [2024-11-24 02:07:51,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:51,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095991438] [2024-11-24 02:07:51,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:51,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:51,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:07:51,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095991438] [2024-11-24 02:07:51,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095991438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:07:51,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:07:51,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:07:51,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556703629] [2024-11-24 02:07:51,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:07:51,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:07:51,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:07:51,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:07:51,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:07:51,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2024-11-24 02:07:51,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 136 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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-11-24 02:07:51,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:07:51,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2024-11-24 02:07:51,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:07:53,061 INFO L124 PetriNetUnfolderBase]: 2061/6890 cut-off events. [2024-11-24 02:07:53,062 INFO L125 PetriNetUnfolderBase]: For 3809/3989 co-relation queries the response was YES. [2024-11-24 02:07:53,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13659 conditions, 6890 events. 2061/6890 cut-off events. For 3809/3989 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 72076 event pairs, 630 based on Foata normal form. 7/5762 useless extension candidates. Maximal degree in co-relation 13651. Up to 1788 conditions per place. [2024-11-24 02:07:53,134 INFO L140 encePairwiseOnDemand]: 115/130 looper letters, 44 selfloop transitions, 26 changer transitions 0/168 dead transitions. [2024-11-24 02:07:53,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 168 transitions, 707 flow [2024-11-24 02:07:53,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:07:53,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:07:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2024-11-24 02:07:53,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615384615384616 [2024-11-24 02:07:53,137 INFO L175 Difference]: Start difference. First operand has 129 places, 136 transitions, 408 flow. Second operand 3 states and 336 transitions. [2024-11-24 02:07:53,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 168 transitions, 707 flow [2024-11-24 02:07:53,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 168 transitions, 663 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:07:53,156 INFO L231 Difference]: Finished difference. Result has 131 places, 161 transitions, 664 flow [2024-11-24 02:07:53,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=131, PETRI_TRANSITIONS=161} [2024-11-24 02:07:53,157 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 3 predicate places. [2024-11-24 02:07:53,158 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 161 transitions, 664 flow [2024-11-24 02:07:53,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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-11-24 02:07:53,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:07:53,158 INFO L206 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] [2024-11-24 02:07:53,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 02:07:53,159 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-24 02:07:53,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:53,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1577313666, now seen corresponding path program 1 times [2024-11-24 02:07:53,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:53,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137441226] [2024-11-24 02:07:53,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:53,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:53,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:07:53,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137441226] [2024-11-24 02:07:53,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137441226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:07:53,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:07:53,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:07:53,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416798348] [2024-11-24 02:07:53,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:07:53,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:07:53,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:07:53,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:07:53,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:07:53,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2024-11-24 02:07:53,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 161 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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-11-24 02:07:53,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:07:53,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2024-11-24 02:07:53,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:07:54,876 INFO L124 PetriNetUnfolderBase]: 2966/9755 cut-off events. [2024-11-24 02:07:54,877 INFO L125 PetriNetUnfolderBase]: For 15047/15536 co-relation queries the response was YES. [2024-11-24 02:07:54,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23389 conditions, 9755 events. 2966/9755 cut-off events. For 15047/15536 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 106154 event pairs, 1072 based on Foata normal form. 41/8329 useless extension candidates. Maximal degree in co-relation 23380. Up to 3627 conditions per place. [2024-11-24 02:07:55,045 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 60 selfloop transitions, 22 changer transitions 0/183 dead transitions. [2024-11-24 02:07:55,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 183 transitions, 976 flow [2024-11-24 02:07:55,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:07:55,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:07:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2024-11-24 02:07:55,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8384615384615385 [2024-11-24 02:07:55,051 INFO L175 Difference]: Start difference. First operand has 131 places, 161 transitions, 664 flow. Second operand 3 states and 327 transitions. [2024-11-24 02:07:55,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 183 transitions, 976 flow [2024-11-24 02:07:55,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 183 transitions, 908 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:07:55,071 INFO L231 Difference]: Finished difference. Result has 133 places, 179 transitions, 862 flow [2024-11-24 02:07:55,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=133, PETRI_TRANSITIONS=179} [2024-11-24 02:07:55,073 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 5 predicate places. [2024-11-24 02:07:55,074 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 179 transitions, 862 flow [2024-11-24 02:07:55,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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-11-24 02:07:55,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:07:55,075 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:07:55,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 02:07:55,076 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-24 02:07:55,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:55,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1349495971, now seen corresponding path program 1 times [2024-11-24 02:07:55,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:55,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641302265] [2024-11-24 02:07:55,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:55,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:55,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:07:55,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641302265] [2024-11-24 02:07:55,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641302265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:07:55,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:07:55,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:07:55,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282202607] [2024-11-24 02:07:55,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:07:55,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:07:55,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:07:55,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:07:55,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:07:55,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2024-11-24 02:07:55,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 179 transitions, 862 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-11-24 02:07:55,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:07:55,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2024-11-24 02:07:55,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:07:57,115 INFO L124 PetriNetUnfolderBase]: 3528/10620 cut-off events. [2024-11-24 02:07:57,115 INFO L125 PetriNetUnfolderBase]: For 19378/19830 co-relation queries the response was YES. [2024-11-24 02:07:57,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27729 conditions, 10620 events. 3528/10620 cut-off events. For 19378/19830 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 115217 event pairs, 992 based on Foata normal form. 26/8854 useless extension candidates. Maximal degree in co-relation 27719. Up to 3989 conditions per place. [2024-11-24 02:07:57,221 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 68 selfloop transitions, 36 changer transitions 0/209 dead transitions. [2024-11-24 02:07:57,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 209 transitions, 1284 flow [2024-11-24 02:07:57,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:07:57,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:07:57,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2024-11-24 02:07:57,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8487179487179487 [2024-11-24 02:07:57,224 INFO L175 Difference]: Start difference. First operand has 133 places, 179 transitions, 862 flow. Second operand 3 states and 331 transitions. [2024-11-24 02:07:57,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 209 transitions, 1284 flow [2024-11-24 02:07:57,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 209 transitions, 1184 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-11-24 02:07:57,292 INFO L231 Difference]: Finished difference. Result has 135 places, 205 transitions, 1166 flow [2024-11-24 02:07:57,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1166, PETRI_PLACES=135, PETRI_TRANSITIONS=205} [2024-11-24 02:07:57,293 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 7 predicate places. [2024-11-24 02:07:57,294 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 205 transitions, 1166 flow [2024-11-24 02:07:57,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-11-24 02:07:57,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:07:57,294 INFO L206 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] [2024-11-24 02:07:57,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 02:07:57,294 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-24 02:07:57,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:57,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1605232236, now seen corresponding path program 1 times [2024-11-24 02:07:57,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:57,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874752674] [2024-11-24 02:07:57,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:57,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:57,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:57,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:07:57,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874752674] [2024-11-24 02:07:57,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874752674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:07:57,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:07:57,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:07:57,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208240649] [2024-11-24 02:07:57,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:07:57,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:07:57,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:07:57,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:07:57,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:07:57,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2024-11-24 02:07:57,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 205 transitions, 1166 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-11-24 02:07:57,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:07:57,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2024-11-24 02:07:57,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:07:59,345 INFO L124 PetriNetUnfolderBase]: 4489/13143 cut-off events. [2024-11-24 02:07:59,346 INFO L125 PetriNetUnfolderBase]: For 33482/34081 co-relation queries the response was YES. [2024-11-24 02:07:59,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37383 conditions, 13143 events. 4489/13143 cut-off events. For 33482/34081 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 145132 event pairs, 1134 based on Foata normal form. 23/11018 useless extension candidates. Maximal degree in co-relation 37372. Up to 4859 conditions per place. [2024-11-24 02:07:59,423 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 91 selfloop transitions, 38 changer transitions 0/236 dead transitions. [2024-11-24 02:07:59,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 236 transitions, 1685 flow [2024-11-24 02:07:59,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:07:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:07:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2024-11-24 02:07:59,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8512820512820513 [2024-11-24 02:07:59,425 INFO L175 Difference]: Start difference. First operand has 135 places, 205 transitions, 1166 flow. Second operand 3 states and 332 transitions. [2024-11-24 02:07:59,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 236 transitions, 1685 flow [2024-11-24 02:07:59,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 236 transitions, 1597 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:07:59,459 INFO L231 Difference]: Finished difference. Result has 137 places, 231 transitions, 1530 flow [2024-11-24 02:07:59,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1530, PETRI_PLACES=137, PETRI_TRANSITIONS=231} [2024-11-24 02:07:59,463 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 9 predicate places. [2024-11-24 02:07:59,463 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 231 transitions, 1530 flow [2024-11-24 02:07:59,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-11-24 02:07:59,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:07:59,464 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:07:59,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-24 02:07:59,464 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-24 02:07:59,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:59,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1977551488, now seen corresponding path program 1 times [2024-11-24 02:07:59,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:59,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125188829] [2024-11-24 02:07:59,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:59,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 02:07:59,496 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 02:07:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 02:07:59,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 02:07:59,523 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 02:07:59,523 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2024-11-24 02:07:59,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2024-11-24 02:07:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2024-11-24 02:07:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2024-11-24 02:07:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2024-11-24 02:07:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2024-11-24 02:07:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2024-11-24 02:07:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2024-11-24 02:07:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2024-11-24 02:07:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2024-11-24 02:07:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2024-11-24 02:07:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2024-11-24 02:07:59,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2024-11-24 02:07:59,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-24 02:07:59,525 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:07:59,525 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-24 02:07:59,525 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-24 02:07:59,571 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-24 02:07:59,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 161 transitions, 340 flow [2024-11-24 02:07:59,625 INFO L124 PetriNetUnfolderBase]: 18/311 cut-off events. [2024-11-24 02:07:59,626 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-24 02:07:59,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 311 events. 18/311 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1208 event pairs, 0 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 234. Up to 8 conditions per place. [2024-11-24 02:07:59,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 161 transitions, 340 flow [2024-11-24 02:07:59,631 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 161 transitions, 340 flow [2024-11-24 02:07:59,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 02:07:59,635 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;@2302856f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 02:07:59,636 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-24 02:07:59,639 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-24 02:07:59,639 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2024-11-24 02:07:59,639 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 02:07:59,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:07:59,640 INFO L206 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] [2024-11-24 02:07:59,640 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-24 02:07:59,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:59,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1342743370, now seen corresponding path program 1 times [2024-11-24 02:07:59,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:59,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355002430] [2024-11-24 02:07:59,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:59,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:59,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:59,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:07:59,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355002430] [2024-11-24 02:07:59,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355002430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:07:59,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:07:59,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:07:59,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006210404] [2024-11-24 02:07:59,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:07:59,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 02:07:59,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:07:59,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 02:07:59,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 02:07:59,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 161 [2024-11-24 02:07:59,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 161 transitions, 340 flow. Second operand has 2 states, 2 states have (on average 138.0) internal successors, (276), 2 states have internal predecessors, (276), 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-11-24 02:07:59,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:07:59,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 161 [2024-11-24 02:07:59,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:07:59,938 INFO L124 PetriNetUnfolderBase]: 178/1732 cut-off events. [2024-11-24 02:07:59,939 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-11-24 02:07:59,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2081 conditions, 1732 events. 178/1732 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 14498 event pairs, 178 based on Foata normal form. 260/1709 useless extension candidates. Maximal degree in co-relation 1375. Up to 298 conditions per place. [2024-11-24 02:07:59,953 INFO L140 encePairwiseOnDemand]: 152/161 looper letters, 11 selfloop transitions, 0 changer transitions 0/144 dead transitions. [2024-11-24 02:07:59,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 144 transitions, 328 flow [2024-11-24 02:07:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 02:07:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-24 02:07:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 294 transitions. [2024-11-24 02:07:59,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9130434782608695 [2024-11-24 02:07:59,955 INFO L175 Difference]: Start difference. First operand has 159 places, 161 transitions, 340 flow. Second operand 2 states and 294 transitions. [2024-11-24 02:07:59,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 144 transitions, 328 flow [2024-11-24 02:07:59,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 144 transitions, 326 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-11-24 02:07:59,957 INFO L231 Difference]: Finished difference. Result has 152 places, 144 transitions, 304 flow [2024-11-24 02:07:59,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=304, PETRI_PLACES=152, PETRI_TRANSITIONS=144} [2024-11-24 02:07:59,959 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, -7 predicate places. [2024-11-24 02:07:59,960 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 144 transitions, 304 flow [2024-11-24 02:07:59,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 138.0) internal successors, (276), 2 states have internal predecessors, (276), 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-11-24 02:07:59,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:07:59,960 INFO L206 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] [2024-11-24 02:07:59,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-24 02:07:59,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-24 02:07:59,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:59,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1379637707, now seen corresponding path program 1 times [2024-11-24 02:07:59,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:59,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973822442] [2024-11-24 02:07:59,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:59,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:59,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:08:00,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:08:00,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973822442] [2024-11-24 02:08:00,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973822442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:08:00,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:08:00,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:08:00,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108508764] [2024-11-24 02:08:00,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:08:00,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:08:00,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:08:00,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:08:00,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:08:00,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 161 [2024-11-24 02:08:00,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 144 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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-11-24 02:08:00,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:08:00,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 161 [2024-11-24 02:08:00,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:08:02,868 INFO L124 PetriNetUnfolderBase]: 8153/23044 cut-off events. [2024-11-24 02:08:02,868 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2024-11-24 02:08:02,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34911 conditions, 23044 events. 8153/23044 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 266242 event pairs, 6332 based on Foata normal form. 0/19799 useless extension candidates. Maximal degree in co-relation 34905. Up to 10488 conditions per place. [2024-11-24 02:08:03,044 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 34 selfloop transitions, 12 changer transitions 0/161 dead transitions. [2024-11-24 02:08:03,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 161 transitions, 430 flow [2024-11-24 02:08:03,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:08:03,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:08:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2024-11-24 02:08:03,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8364389233954451 [2024-11-24 02:08:03,206 INFO L175 Difference]: Start difference. First operand has 152 places, 144 transitions, 304 flow. Second operand 3 states and 404 transitions. [2024-11-24 02:08:03,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 161 transitions, 430 flow [2024-11-24 02:08:03,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 161 transitions, 430 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-24 02:08:03,210 INFO L231 Difference]: Finished difference. Result has 156 places, 155 transitions, 398 flow [2024-11-24 02:08:03,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=156, PETRI_TRANSITIONS=155} [2024-11-24 02:08:03,213 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, -3 predicate places. [2024-11-24 02:08:03,214 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 155 transitions, 398 flow [2024-11-24 02:08:03,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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-11-24 02:08:03,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:08:03,214 INFO L206 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] [2024-11-24 02:08:03,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-24 02:08:03,215 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-24 02:08:03,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:08:03,215 INFO L85 PathProgramCache]: Analyzing trace with hash -652381915, now seen corresponding path program 1 times [2024-11-24 02:08:03,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:08:03,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015990161] [2024-11-24 02:08:03,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:08:03,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:08:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:08:03,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:08:03,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:08:03,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015990161] [2024-11-24 02:08:03,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015990161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:08:03,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:08:03,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:08:03,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467890927] [2024-11-24 02:08:03,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:08:03,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:08:03,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:08:03,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:08:03,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:08:03,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2024-11-24 02:08:03,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 155 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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-11-24 02:08:03,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:08:03,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2024-11-24 02:08:03,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:08:06,690 INFO L124 PetriNetUnfolderBase]: 11247/29861 cut-off events. [2024-11-24 02:08:06,691 INFO L125 PetriNetUnfolderBase]: For 7872/9087 co-relation queries the response was YES. [2024-11-24 02:08:06,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56111 conditions, 29861 events. 11247/29861 cut-off events. For 7872/9087 co-relation queries the response was YES. Maximal size of possible extension queue 1033. Compared 351460 event pairs, 6418 based on Foata normal form. 28/25419 useless extension candidates. Maximal degree in co-relation 56103. Up to 13140 conditions per place. [2024-11-24 02:08:06,855 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 42 selfloop transitions, 19 changer transitions 0/180 dead transitions. [2024-11-24 02:08:06,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 180 transitions, 620 flow [2024-11-24 02:08:06,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:08:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:08:06,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2024-11-24 02:08:06,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8488612836438924 [2024-11-24 02:08:06,858 INFO L175 Difference]: Start difference. First operand has 156 places, 155 transitions, 398 flow. Second operand 3 states and 410 transitions. [2024-11-24 02:08:06,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 180 transitions, 620 flow [2024-11-24 02:08:06,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 180 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:08:06,931 INFO L231 Difference]: Finished difference. Result has 158 places, 172 transitions, 546 flow [2024-11-24 02:08:06,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=158, PETRI_TRANSITIONS=172} [2024-11-24 02:08:06,932 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, -1 predicate places. [2024-11-24 02:08:06,934 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 172 transitions, 546 flow [2024-11-24 02:08:06,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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-11-24 02:08:06,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:08:06,934 INFO L206 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] [2024-11-24 02:08:06,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-24 02:08:06,935 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-24 02:08:06,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:08:06,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2049592448, now seen corresponding path program 1 times [2024-11-24 02:08:06,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:08:06,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440644433] [2024-11-24 02:08:06,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:08:06,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:08:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:08:06,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:08:06,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:08:06,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440644433] [2024-11-24 02:08:06,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440644433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:08:06,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:08:06,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:08:06,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057751031] [2024-11-24 02:08:06,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:08:06,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:08:06,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:08:06,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:08:06,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:08:07,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 161 [2024-11-24 02:08:07,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 172 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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-11-24 02:08:07,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:08:07,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 161 [2024-11-24 02:08:07,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:08:11,820 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][151], [25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 162#true, 16#L693-6true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 160#true, 70#L693-7true, 169#true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 176#(= |#race~c~0| 0), 158#true]) [2024-11-24 02:08:11,820 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-24 02:08:11,821 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:11,821 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:11,821 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:12,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][214], [25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 106#L693-4true, 156#true, 162#true, 160#true, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 169#true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 55#L693-14true]) [2024-11-24 02:08:12,124 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-24 02:08:12,124 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:12,124 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:12,124 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:12,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][198], [25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 106#L693-4true, 156#true, 162#true, 160#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 169#true, 91#L693-14true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true]) [2024-11-24 02:08:12,146 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-24 02:08:12,146 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:12,146 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:12,146 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:12,899 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][123], [25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 147#L693-5true, 156#true, 162#true, 160#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 169#true, 91#L693-14true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true]) [2024-11-24 02:08:12,900 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-24 02:08:12,900 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:12,900 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:12,900 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:12,902 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][174], [25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 147#L693-5true, 156#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 160#true, 70#L693-7true, 169#true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 55#L693-14true, 158#true]) [2024-11-24 02:08:12,902 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-24 02:08:12,902 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:12,902 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:12,902 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:15,910 INFO L124 PetriNetUnfolderBase]: 31793/78596 cut-off events. [2024-11-24 02:08:15,910 INFO L125 PetriNetUnfolderBase]: For 55456/57152 co-relation queries the response was YES. [2024-11-24 02:08:16,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170883 conditions, 78596 events. 31793/78596 cut-off events. For 55456/57152 co-relation queries the response was YES. Maximal size of possible extension queue 2895. Compared 1028865 event pairs, 10563 based on Foata normal form. 71/64794 useless extension candidates. Maximal degree in co-relation 170874. Up to 24669 conditions per place. [2024-11-24 02:08:16,395 INFO L140 encePairwiseOnDemand]: 141/161 looper letters, 65 selfloop transitions, 40 changer transitions 0/222 dead transitions. [2024-11-24 02:08:16,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 222 transitions, 1028 flow [2024-11-24 02:08:16,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:08:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:08:16,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2024-11-24 02:08:16,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8530020703933747 [2024-11-24 02:08:16,396 INFO L175 Difference]: Start difference. First operand has 158 places, 172 transitions, 546 flow. Second operand 3 states and 412 transitions. [2024-11-24 02:08:16,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 222 transitions, 1028 flow [2024-11-24 02:08:16,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 222 transitions, 956 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:08:16,645 INFO L231 Difference]: Finished difference. Result has 160 places, 212 transitions, 964 flow [2024-11-24 02:08:16,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=964, PETRI_PLACES=160, PETRI_TRANSITIONS=212} [2024-11-24 02:08:16,646 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 1 predicate places. [2024-11-24 02:08:16,646 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 212 transitions, 964 flow [2024-11-24 02:08:16,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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-11-24 02:08:16,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:08:16,647 INFO L206 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] [2024-11-24 02:08:16,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-24 02:08:16,647 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-24 02:08:16,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:08:16,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1117522883, now seen corresponding path program 1 times [2024-11-24 02:08:16,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:08:16,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954356243] [2024-11-24 02:08:16,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:08:16,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:08:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:08:16,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:08:16,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:08:16,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954356243] [2024-11-24 02:08:16,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954356243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:08:16,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:08:16,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:08:16,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797625271] [2024-11-24 02:08:16,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:08:16,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:08:16,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:08:16,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:08:16,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:08:17,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 161 [2024-11-24 02:08:17,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 212 transitions, 964 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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-11-24 02:08:17,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:08:17,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 161 [2024-11-24 02:08:17,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:08:20,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][144], [162#true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 86#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 115#L693-7true, Black: 174#true, 179#true, 156#true, 160#true, 176#(= |#race~c~0| 0)]) [2024-11-24 02:08:20,570 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2024-11-24 02:08:20,570 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-24 02:08:20,570 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-24 02:08:20,570 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-24 02:08:20,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][145], [162#true, 16#L693-6true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 107#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 179#true, 156#true, 160#true, 176#(= |#race~c~0| 0)]) [2024-11-24 02:08:20,585 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2024-11-24 02:08:20,585 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-24 02:08:20,585 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-24 02:08:20,585 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-24 02:08:20,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][193], [162#true, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-3true, 174#true, 158#true, 115#L693-7true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, 160#true]) [2024-11-24 02:08:20,677 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-24 02:08:20,677 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:20,677 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:20,677 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:20,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][216], [162#true, 107#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-3true, 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 179#true, 156#true, 160#true]) [2024-11-24 02:08:20,686 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-24 02:08:20,686 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:20,686 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:20,686 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:20,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][163], [162#true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 115#L693-7true, 156#true, 179#true, 90#L693-4true, 160#true]) [2024-11-24 02:08:20,901 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-24 02:08:20,901 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:20,902 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:20,902 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:20,930 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][197], [162#true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 107#L693-7true, 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 179#true, 156#true, 160#true]) [2024-11-24 02:08:20,930 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-24 02:08:20,930 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:20,930 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:20,930 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:20,986 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][157], [162#true, 88#L692-3true, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 179#true, 156#true, 39#L693-14true, 160#true]) [2024-11-24 02:08:20,986 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-24 02:08:20,986 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:20,986 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:20,986 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:21,455 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][70], [162#true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 147#L693-5true, 156#true, 179#true, 39#L693-14true, 160#true]) [2024-11-24 02:08:21,455 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2024-11-24 02:08:21,455 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-24 02:08:21,456 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-24 02:08:21,456 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-24 02:08:21,768 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][116], [162#true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 115#L693-7true, 179#true, 156#true, 160#true]) [2024-11-24 02:08:21,769 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2024-11-24 02:08:21,769 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-24 02:08:21,769 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-24 02:08:21,769 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-24 02:08:21,811 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][116], [162#true, 88#L692-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 107#L693-7true, 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 147#L693-5true, 179#true, 156#true, 160#true]) [2024-11-24 02:08:21,811 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2024-11-24 02:08:21,811 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-24 02:08:21,811 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-24 02:08:21,811 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-24 02:08:22,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][159], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 118#L693-3true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 57#L693-5true, 115#L693-7true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 160#true]) [2024-11-24 02:08:22,196 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is not cut-off event [2024-11-24 02:08:22,196 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-11-24 02:08:22,197 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-11-24 02:08:22,197 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-11-24 02:08:22,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][159], [162#true, 70#L693-7true, 107#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-3true, 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 147#L693-5true, 179#true, 156#true, 160#true]) [2024-11-24 02:08:22,220 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is not cut-off event [2024-11-24 02:08:22,220 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-11-24 02:08:22,220 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-11-24 02:08:22,220 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-11-24 02:08:22,975 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][145], [162#true, 16#L693-6true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, 160#true, 176#(= |#race~c~0| 0)]) [2024-11-24 02:08:22,975 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-24 02:08:22,975 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:22,975 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:22,975 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:23,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][144], [162#true, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 86#L693-6true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 158#true, Black: 174#true, 179#true, 156#true, 160#true, 176#(= |#race~c~0| 0)]) [2024-11-24 02:08:23,003 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-24 02:08:23,003 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:23,003 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:23,003 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:23,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][200], [162#true, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 90#L693-4true, 160#true, 55#L693-14true]) [2024-11-24 02:08:23,354 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-24 02:08:23,354 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:23,354 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:23,354 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:23,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][221], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 106#L693-4true, 179#true, 156#true, 160#true, 55#L693-14true]) [2024-11-24 02:08:23,354 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-24 02:08:23,354 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:23,354 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:23,354 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:23,373 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][163], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, 160#true]) [2024-11-24 02:08:23,373 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-24 02:08:23,373 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:23,373 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:23,373 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:23,383 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][197], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, 160#true]) [2024-11-24 02:08:23,383 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-24 02:08:23,383 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:23,383 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:23,383 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:24,394 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][116], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 147#L693-5true, 156#true, 179#true, 160#true]) [2024-11-24 02:08:24,394 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-24 02:08:24,394 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:24,394 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:24,394 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:24,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][172], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 147#L693-5true, 179#true, 156#true, 160#true, 55#L693-14true]) [2024-11-24 02:08:24,396 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-24 02:08:24,396 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:24,396 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:24,396 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:24,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][116], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, 108#L693-7true, 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 160#true]) [2024-11-24 02:08:24,421 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-24 02:08:24,421 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:24,421 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:24,421 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:24,423 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][172], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 174#true, 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 160#true, 55#L693-14true]) [2024-11-24 02:08:24,423 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-24 02:08:24,423 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:24,423 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:24,423 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:27,858 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][163], [18#L694-3true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, 160#true]) [2024-11-24 02:08:27,859 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-11-24 02:08:27,859 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-24 02:08:27,859 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-24 02:08:27,859 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-24 02:08:27,860 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][200], [18#L694-3true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, 160#true, 55#L693-14true]) [2024-11-24 02:08:27,861 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-11-24 02:08:27,861 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-24 02:08:27,861 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-24 02:08:27,861 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-24 02:08:28,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][172], [18#L694-3true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, 160#true, 55#L693-14true]) [2024-11-24 02:08:28,584 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-11-24 02:08:28,584 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-24 02:08:28,584 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-24 02:08:28,584 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-24 02:08:28,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][116], [18#L694-3true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, 160#true]) [2024-11-24 02:08:28,585 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-11-24 02:08:28,585 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-24 02:08:28,585 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-24 02:08:28,585 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-24 02:08:29,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][163], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, 28#L701-3true, 160#true]) [2024-11-24 02:08:29,179 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-11-24 02:08:29,179 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-24 02:08:29,179 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-24 02:08:29,179 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-24 02:08:29,181 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][200], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, 28#L701-3true, 160#true, 55#L693-14true]) [2024-11-24 02:08:29,181 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-11-24 02:08:29,181 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-24 02:08:29,181 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-24 02:08:29,181 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-24 02:08:29,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][116], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, 160#true, 28#L701-3true]) [2024-11-24 02:08:29,350 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-11-24 02:08:29,350 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-24 02:08:29,350 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-24 02:08:29,351 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-24 02:08:29,358 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][172], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, 28#L701-3true, 160#true, 55#L693-14true]) [2024-11-24 02:08:29,358 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-11-24 02:08:29,358 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-24 02:08:29,358 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-24 02:08:29,358 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-24 02:08:30,531 INFO L124 PetriNetUnfolderBase]: 45373/113850 cut-off events. [2024-11-24 02:08:30,532 INFO L125 PetriNetUnfolderBase]: For 212666/218669 co-relation queries the response was YES. [2024-11-24 02:08:30,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305572 conditions, 113850 events. 45373/113850 cut-off events. For 212666/218669 co-relation queries the response was YES. Maximal size of possible extension queue 3851. Compared 1550772 event pairs, 17101 based on Foata normal form. 381/95004 useless extension candidates. Maximal degree in co-relation 305562. Up to 49200 conditions per place. [2024-11-24 02:08:31,298 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 91 selfloop transitions, 36 changer transitions 0/250 dead transitions. [2024-11-24 02:08:31,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 250 transitions, 1496 flow [2024-11-24 02:08:31,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:08:31,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:08:31,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2024-11-24 02:08:31,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8364389233954451 [2024-11-24 02:08:31,300 INFO L175 Difference]: Start difference. First operand has 160 places, 212 transitions, 964 flow. Second operand 3 states and 404 transitions. [2024-11-24 02:08:31,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 250 transitions, 1496 flow [2024-11-24 02:08:31,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 250 transitions, 1386 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:08:31,418 INFO L231 Difference]: Finished difference. Result has 162 places, 244 transitions, 1330 flow [2024-11-24 02:08:31,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1330, PETRI_PLACES=162, PETRI_TRANSITIONS=244} [2024-11-24 02:08:31,419 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 3 predicate places. [2024-11-24 02:08:31,420 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 244 transitions, 1330 flow [2024-11-24 02:08:31,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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-11-24 02:08:31,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:08:31,421 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:08:31,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-24 02:08:31,421 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-24 02:08:31,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:08:31,422 INFO L85 PathProgramCache]: Analyzing trace with hash -918908451, now seen corresponding path program 1 times [2024-11-24 02:08:31,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:08:31,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211674144] [2024-11-24 02:08:31,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:08:31,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:08:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:08:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:08:31,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:08:31,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211674144] [2024-11-24 02:08:31,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211674144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:08:31,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:08:31,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:08:31,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971843147] [2024-11-24 02:08:31,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:08:31,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:08:31,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:08:31,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:08:31,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:08:31,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2024-11-24 02:08:31,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 244 transitions, 1330 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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-11-24 02:08:31,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:08:31,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2024-11-24 02:08:31,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:08:37,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][297], [162#true, 16#L693-6true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true]) [2024-11-24 02:08:37,079 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-24 02:08:37,079 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:37,079 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:37,079 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:37,093 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][295], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 86#L693-6true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 106#L693-4true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true]) [2024-11-24 02:08:37,093 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-24 02:08:37,093 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:37,093 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:37,093 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:37,098 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][294], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 106#L693-4true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-24 02:08:37,098 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-24 02:08:37,099 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:37,099 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:37,099 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-24 02:08:37,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][300], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true, 55#L693-14true]) [2024-11-24 02:08:37,246 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2024-11-24 02:08:37,246 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-24 02:08:37,246 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-24 02:08:37,246 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-24 02:08:38,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][281], [8#L693-5true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 55#L693-14true]) [2024-11-24 02:08:38,493 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-24 02:08:38,493 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:38,493 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:38,493 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:38,518 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][253], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 147#L693-5true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true, 55#L693-14true]) [2024-11-24 02:08:38,518 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-24 02:08:38,519 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:38,519 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:38,519 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:38,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][282], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true, 55#L693-14true]) [2024-11-24 02:08:38,526 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-24 02:08:38,526 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:38,526 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:38,526 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:39,213 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][151], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 86#L693-6true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 115#L693-7true, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-24 02:08:39,213 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-24 02:08:39,213 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:39,213 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:39,213 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:39,243 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][152], [162#true, 16#L693-6true, 107#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-24 02:08:39,243 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-24 02:08:39,243 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:39,243 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:39,244 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:39,782 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][155], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 115#L693-7true, Black: 174#true, 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-24 02:08:39,782 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-24 02:08:39,783 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:39,783 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:39,783 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:39,815 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][220], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 115#L693-7true, 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true, 55#L693-14true]) [2024-11-24 02:08:39,815 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-24 02:08:39,815 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:39,815 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:39,815 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:39,882 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][155], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 107#L693-7true, 151#L693-6true, 108#L693-7true, 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-24 02:08:39,882 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-24 02:08:39,882 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:39,882 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:39,882 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-24 02:08:39,891 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][220], [162#true, 107#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true, 55#L693-14true]) [2024-11-24 02:08:39,891 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-24 02:08:39,891 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:39,891 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:39,891 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:40,341 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][219], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 115#L693-7true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 55#L693-14true]) [2024-11-24 02:08:40,341 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-24 02:08:40,341 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:40,341 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:40,341 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:40,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][214], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 52#L693-14true, 158#true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), Black: 179#true, 160#true, 103#L693-4true, 184#true]) [2024-11-24 02:08:40,428 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-24 02:08:40,428 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:40,428 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:40,428 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:40,521 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][173], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 39#L693-14true, 160#true, 103#L693-4true, 184#true]) [2024-11-24 02:08:40,521 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-24 02:08:40,521 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:40,521 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:40,521 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:40,569 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][166], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 52#L693-14true, 158#true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 90#L693-4true, Black: 179#true, 160#true, 184#true]) [2024-11-24 02:08:40,569 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-24 02:08:40,569 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:40,569 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:40,569 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-24 02:08:41,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][68], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 52#L693-14true, 158#true, 57#L693-5true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), Black: 179#true, 160#true, 184#true]) [2024-11-24 02:08:41,487 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-24 02:08:41,487 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:41,487 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:41,488 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:41,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][183], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 57#L693-5true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 115#L693-7true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 55#L693-14true]) [2024-11-24 02:08:41,493 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-24 02:08:41,493 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:41,493 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:41,493 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:41,531 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][70], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 147#L693-5true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 39#L693-14true, 160#true, 184#true]) [2024-11-24 02:08:41,531 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-24 02:08:41,531 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:41,531 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:41,531 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:41,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][183], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 107#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 147#L693-5true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 55#L693-14true]) [2024-11-24 02:08:41,537 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-24 02:08:41,537 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:41,537 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:41,537 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:42,120 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][68], [8#L693-5true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 52#L693-14true, 158#true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), Black: 179#true, 160#true, 184#true]) [2024-11-24 02:08:42,120 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-24 02:08:42,120 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:42,121 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:42,121 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:42,149 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][183], [8#L693-5true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 115#L693-7true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 55#L693-14true]) [2024-11-24 02:08:42,149 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-24 02:08:42,149 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:42,149 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:42,150 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:42,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][70], [8#L693-5true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-7true, 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 39#L693-14true, 160#true, 184#true]) [2024-11-24 02:08:42,182 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-24 02:08:42,182 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:42,182 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:42,182 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:42,195 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][183], [8#L693-5true, 162#true, 107#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 55#L693-14true]) [2024-11-24 02:08:42,195 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-24 02:08:42,195 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:42,195 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:42,195 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-24 02:08:42,437 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][313], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 86#L693-6true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 140#L693-15true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true]) [2024-11-24 02:08:42,437 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-24 02:08:42,437 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-24 02:08:42,437 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-24 02:08:42,438 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-24 02:08:42,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][147], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 118#L693-3true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 96#L694true, 160#true, 184#true]) [2024-11-24 02:08:42,493 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is not cut-off event [2024-11-24 02:08:42,494 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2024-11-24 02:08:42,494 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2024-11-24 02:08:42,494 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2024-11-24 02:08:42,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][311], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 140#L693-15true, 156#true, 179#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-24 02:08:42,500 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-24 02:08:42,500 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-24 02:08:42,500 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-24 02:08:42,500 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-24 02:08:42,691 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][314], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 140#L693-15true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true, 55#L693-14true]) [2024-11-24 02:08:42,691 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2024-11-24 02:08:42,691 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2024-11-24 02:08:42,691 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2024-11-24 02:08:42,691 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2024-11-24 02:08:42,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][147], [18#L694-3true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 118#L693-3true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-24 02:08:42,941 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is not cut-off event [2024-11-24 02:08:42,941 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2024-11-24 02:08:42,941 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2024-11-24 02:08:42,941 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2024-11-24 02:08:42,954 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][129], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 87#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 174#true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-24 02:08:42,954 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-24 02:08:42,954 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-24 02:08:42,954 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-24 02:08:42,954 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-24 02:08:43,139 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][128], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 86#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 87#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true]) [2024-11-24 02:08:43,139 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2024-11-24 02:08:43,139 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-24 02:08:43,139 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-24 02:08:43,139 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-24 02:08:43,405 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][307], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 140#L693-15true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 103#L693-4true, 184#true, 55#L693-14true]) [2024-11-24 02:08:43,406 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2024-11-24 02:08:43,406 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-24 02:08:43,406 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-24 02:08:43,406 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-24 02:08:43,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][253], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 96#L694true, 160#true, 103#L693-4true, 184#true, 55#L693-14true]) [2024-11-24 02:08:43,525 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2024-11-24 02:08:43,525 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-24 02:08:43,525 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-24 02:08:43,525 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-24 02:08:43,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][306], [8#L693-5true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 140#L693-15true, 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 55#L693-14true]) [2024-11-24 02:08:43,543 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2024-11-24 02:08:43,543 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-24 02:08:43,543 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-24 02:08:43,543 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-24 02:08:46,195 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][174], [18#L694-3true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 91#L693-14true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-24 02:08:46,195 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-11-24 02:08:46,195 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-24 02:08:46,195 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-24 02:08:46,195 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-24 02:08:46,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][219], [18#L694-3true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 55#L693-14true]) [2024-11-24 02:08:46,197 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-11-24 02:08:46,197 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-24 02:08:46,197 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-24 02:08:46,197 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-24 02:08:46,597 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([538] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][256], [162#true, 14#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 134#L694-3true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-3true, 158#true, Black: 176#(= |#race~c~0| 0), 140#L693-15true, 156#true, 179#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-24 02:08:46,597 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is not cut-off event [2024-11-24 02:08:46,597 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is not cut-off event [2024-11-24 02:08:46,597 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is not cut-off event [2024-11-24 02:08:46,597 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is not cut-off event