./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 a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd91d60-9eb9-47ce-bfdd-11447940a05a/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd91d60-9eb9-47ce-bfdd-11447940a05a/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd91d60-9eb9-47ce-bfdd-11447940a05a/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd91d60-9eb9-47ce-bfdd-11447940a05a/bin/uautomizer-verify-jihMAELWvX/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_bcd91d60-9eb9-47ce-bfdd-11447940a05a/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd91d60-9eb9-47ce-bfdd-11447940a05a/bin/uautomizer-verify-jihMAELWvX --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.2.5-dev-a016563 [2024-11-08 16:06:59,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:06:59,843 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd91d60-9eb9-47ce-bfdd-11447940a05a/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-08 16:06:59,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:06:59,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:06:59,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:06:59,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:06:59,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:06:59,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:06:59,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:06:59,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:06:59,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:06:59,910 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:06:59,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:06:59,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:06:59,915 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:06:59,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:06:59,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:06:59,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:06:59,916 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:06:59,917 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:06:59,917 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:06:59,918 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-08 16:06:59,918 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:06:59,919 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 16:06:59,919 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:06:59,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:06:59,920 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:06:59,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:06:59,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:06:59,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:06:59,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:06:59,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:06:59,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:06:59,923 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:06:59,923 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:06:59,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:06:59,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:06:59,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:06:59,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:06:59,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:06:59,930 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd91d60-9eb9-47ce-bfdd-11447940a05a/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd91d60-9eb9-47ce-bfdd-11447940a05a/bin/uautomizer-verify-jihMAELWvX 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-08 16:07:00,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:07:00,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:07:00,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:07:00,338 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:07:00,339 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:07:00,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd91d60-9eb9-47ce-bfdd-11447940a05a/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i Unable to find full path for "g++" [2024-11-08 16:07:02,618 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:07:02,913 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:07:02,914 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd91d60-9eb9-47ce-bfdd-11447940a05a/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2024-11-08 16:07:02,931 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd91d60-9eb9-47ce-bfdd-11447940a05a/bin/uautomizer-verify-jihMAELWvX/data/ba1137614/f13f1f2ac90b4be4807c01caa97049e8/FLAGfb05f2f17 [2024-11-08 16:07:03,225 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd91d60-9eb9-47ce-bfdd-11447940a05a/bin/uautomizer-verify-jihMAELWvX/data/ba1137614/f13f1f2ac90b4be4807c01caa97049e8 [2024-11-08 16:07:03,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:07:03,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:07:03,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:07:03,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:07:03,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:07:03,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:07:03" (1/1) ... [2024-11-08 16:07:03,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e78a7d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:07:03, skipping insertion in model container [2024-11-08 16:07:03,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:07:03" (1/1) ... [2024-11-08 16:07:03,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:07:03,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:07:03,845 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:07:03,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:07:03,986 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:07:03,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:07:03 WrapperNode [2024-11-08 16:07:03,987 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:07:03,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:07:03,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:07:03,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:07:04,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:07:03" (1/1) ... [2024-11-08 16:07:04,016 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:07:03" (1/1) ... [2024-11-08 16:07:04,042 INFO L138 Inliner]: procedures = 164, calls = 17, calls flagged for inlining = 4, calls inlined = 5, statements flattened = 86 [2024-11-08 16:07:04,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:07:04,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:07:04,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:07:04,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:07:04,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:07:03" (1/1) ... [2024-11-08 16:07:04,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:07:03" (1/1) ... [2024-11-08 16:07:04,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:07:03" (1/1) ... [2024-11-08 16:07:04,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:07:03" (1/1) ... [2024-11-08 16:07:04,073 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:07:03" (1/1) ... [2024-11-08 16:07:04,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:07:03" (1/1) ... [2024-11-08 16:07:04,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:07:03" (1/1) ... [2024-11-08 16:07:04,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:07:03" (1/1) ... [2024-11-08 16:07:04,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:07:04,085 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:07:04,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:07:04,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:07:04,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:07:03" (1/1) ... [2024-11-08 16:07:04,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:07:04,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd91d60-9eb9-47ce-bfdd-11447940a05a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:07:04,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd91d60-9eb9-47ce-bfdd-11447940a05a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:07:04,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcd91d60-9eb9-47ce-bfdd-11447940a05a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:07:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-08 16:07:04,177 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-08 16:07:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-08 16:07:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:07:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 16:07:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-08 16:07:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:07:04,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:07:04,183 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 16:07:04,427 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:07:04,430 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:07:04,738 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 16:07:04,739 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:07:04,801 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:07:04,801 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:07:04,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:07:04 BoogieIcfgContainer [2024-11-08 16:07:04,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:07:04,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:07:04,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:07:04,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:07:04,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:07:03" (1/3) ... [2024-11-08 16:07:04,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161b63e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:07:04, skipping insertion in model container [2024-11-08 16:07:04,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:07:03" (2/3) ... [2024-11-08 16:07:04,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161b63e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:07:04, skipping insertion in model container [2024-11-08 16:07:04,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:07:04" (3/3) ... [2024-11-08 16:07:04,828 INFO L112 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-pthread.i [2024-11-08 16:07:04,865 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:07:04,865 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-08 16:07:04,866 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 16:07:04,927 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 16:07:04,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 99 transitions, 202 flow [2024-11-08 16:07:05,046 INFO L124 PetriNetUnfolderBase]: 8/149 cut-off events. [2024-11-08 16:07:05,046 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 16:07:05,056 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 351 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-08 16:07:05,057 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 99 transitions, 202 flow [2024-11-08 16:07:05,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 99 transitions, 202 flow [2024-11-08 16:07:05,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:07:05,082 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;@6756df67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:07:05,082 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-08 16:07:05,098 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 16:07:05,099 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2024-11-08 16:07:05,099 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 16:07:05,099 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:07:05,100 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:07:05,101 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-08 16:07:05,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:07:05,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1510674603, now seen corresponding path program 1 times [2024-11-08 16:07:05,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:07:05,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217032383] [2024-11-08 16:07:05,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:07:05,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:07:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:05,399 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-08 16:07:05,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:07:05,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217032383] [2024-11-08 16:07:05,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217032383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:07:05,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:07:05,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:07:05,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507524265] [2024-11-08 16:07:05,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:07:05,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:07:05,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:07:05,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:07:05,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:07:05,451 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 99 [2024-11-08 16:07:05,454 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-08 16:07:05,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:07:05,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 99 [2024-11-08 16:07:05,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:07:05,570 INFO L124 PetriNetUnfolderBase]: 4/189 cut-off events. [2024-11-08 16:07:05,571 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-08 16:07:05,572 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 7. Compared 542 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-08 16:07:05,576 INFO L140 encePairwiseOnDemand]: 94/99 looper letters, 5 selfloop transitions, 0 changer transitions 0/90 dead transitions. [2024-11-08 16:07:05,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 90 transitions, 194 flow [2024-11-08 16:07:05,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:07:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-08 16:07:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2024-11-08 16:07:05,591 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9292929292929293 [2024-11-08 16:07:05,593 INFO L175 Difference]: Start difference. First operand has 97 places, 99 transitions, 202 flow. Second operand 2 states and 184 transitions. [2024-11-08 16:07:05,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 90 transitions, 194 flow [2024-11-08 16:07:05,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 90 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 16:07:05,601 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 184 flow [2024-11-08 16:07:05,603 INFO L260 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-08 16:07:05,608 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -3 predicate places. [2024-11-08 16:07:05,609 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 184 flow [2024-11-08 16:07:05,609 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-08 16:07:05,609 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:07:05,609 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:07:05,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:07:05,610 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-08 16:07:05,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:07:05,611 INFO L85 PathProgramCache]: Analyzing trace with hash 592009294, now seen corresponding path program 1 times [2024-11-08 16:07:05,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:07:05,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656510020] [2024-11-08 16:07:05,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:07:05,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:07:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:05,784 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-08 16:07:05,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:07:05,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656510020] [2024-11-08 16:07:05,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656510020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:07:05,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:07:05,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:07:05,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103806381] [2024-11-08 16:07:05,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:07:05,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:07:05,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:07:05,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:07:05,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:07:05,842 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 99 [2024-11-08 16:07:05,843 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-08 16:07:05,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:07:05,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 99 [2024-11-08 16:07:05,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:07:05,995 INFO L124 PetriNetUnfolderBase]: 59/448 cut-off events. [2024-11-08 16:07:05,996 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-08 16:07:06,000 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 23. Compared 2365 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-08 16:07:06,005 INFO L140 encePairwiseOnDemand]: 92/99 looper letters, 18 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2024-11-08 16:07:06,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 97 transitions, 246 flow [2024-11-08 16:07:06,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:07:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:07:06,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2024-11-08 16:07:06,010 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8417508417508418 [2024-11-08 16:07:06,012 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 184 flow. Second operand 3 states and 250 transitions. [2024-11-08 16:07:06,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 97 transitions, 246 flow [2024-11-08 16:07:06,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 16:07:06,018 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 230 flow [2024-11-08 16:07:06,019 INFO L260 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-08 16:07:06,020 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, 1 predicate places. [2024-11-08 16:07:06,020 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 230 flow [2024-11-08 16:07:06,021 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-08 16:07:06,021 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:07:06,021 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:07:06,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:07:06,022 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-08 16:07:06,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:07:06,024 INFO L85 PathProgramCache]: Analyzing trace with hash -263722143, now seen corresponding path program 1 times [2024-11-08 16:07:06,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:07:06,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748378883] [2024-11-08 16:07:06,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:07:06,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:07:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:06,233 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-08 16:07:06,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:07:06,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748378883] [2024-11-08 16:07:06,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748378883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:07:06,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:07:06,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:07:06,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947281638] [2024-11-08 16:07:06,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:07:06,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:07:06,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:07:06,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:07:06,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:07:06,317 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 99 [2024-11-08 16:07:06,318 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-08 16:07:06,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:07:06,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 99 [2024-11-08 16:07:06,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:07:06,442 INFO L124 PetriNetUnfolderBase]: 64/427 cut-off events. [2024-11-08 16:07:06,443 INFO L125 PetriNetUnfolderBase]: For 46/48 co-relation queries the response was YES. [2024-11-08 16:07:06,445 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 26. Compared 2341 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-08 16:07:06,447 INFO L140 encePairwiseOnDemand]: 92/99 looper letters, 18 selfloop transitions, 7 changer transitions 0/102 dead transitions. [2024-11-08 16:07:06,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 102 transitions, 298 flow [2024-11-08 16:07:06,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:07:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:07:06,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2024-11-08 16:07:06,455 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8552188552188552 [2024-11-08 16:07:06,455 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 230 flow. Second operand 3 states and 254 transitions. [2024-11-08 16:07:06,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 102 transitions, 298 flow [2024-11-08 16:07:06,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 102 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 16:07:06,467 INFO L231 Difference]: Finished difference. Result has 100 places, 100 transitions, 270 flow [2024-11-08 16:07:06,467 INFO L260 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-08 16:07:06,468 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, 3 predicate places. [2024-11-08 16:07:06,469 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 100 transitions, 270 flow [2024-11-08 16:07:06,470 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-08 16:07:06,470 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:07:06,471 INFO L204 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-08 16:07:06,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:07:06,471 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-08 16:07:06,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:07:06,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1609933181, now seen corresponding path program 1 times [2024-11-08 16:07:06,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:07:06,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911676598] [2024-11-08 16:07:06,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:07:06,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:07:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:07:06,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:07:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:07:06,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:07:06,576 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:07:06,577 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-11-08 16:07:06,580 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-11-08 16:07:06,581 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-11-08 16:07:06,581 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-11-08 16:07:06,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-11-08 16:07:06,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-11-08 16:07:06,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-11-08 16:07:06,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-11-08 16:07:06,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-11-08 16:07:06,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-11-08 16:07:06,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:07:06,586 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 16:07:06,594 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 16:07:06,594 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-08 16:07:06,638 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 16:07:06,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 130 transitions, 270 flow [2024-11-08 16:07:06,691 INFO L124 PetriNetUnfolderBase]: 13/230 cut-off events. [2024-11-08 16:07:06,692 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-08 16:07:06,695 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 766 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-08 16:07:06,696 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 130 transitions, 270 flow [2024-11-08 16:07:06,699 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 130 transitions, 270 flow [2024-11-08 16:07:06,703 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:07:06,704 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;@6756df67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:07:06,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-08 16:07:06,714 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 16:07:06,714 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2024-11-08 16:07:06,714 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 16:07:06,715 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:07:06,715 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:07:06,716 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-08 16:07:06,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:07:06,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1370545451, now seen corresponding path program 1 times [2024-11-08 16:07:06,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:07:06,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650969527] [2024-11-08 16:07:06,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:07:06,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:07:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:06,773 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-08 16:07:06,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:07:06,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650969527] [2024-11-08 16:07:06,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650969527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:07:06,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:07:06,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:07:06,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945154690] [2024-11-08 16:07:06,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:07:06,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:07:06,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:07:06,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:07:06,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:07:06,782 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 130 [2024-11-08 16:07:06,782 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-08 16:07:06,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:07:06,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 130 [2024-11-08 16:07:06,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:07:06,912 INFO L124 PetriNetUnfolderBase]: 34/566 cut-off events. [2024-11-08 16:07:06,912 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-08 16:07:06,915 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 3248 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-08 16:07:06,918 INFO L140 encePairwiseOnDemand]: 123/130 looper letters, 8 selfloop transitions, 0 changer transitions 0/117 dead transitions. [2024-11-08 16:07:06,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 117 transitions, 260 flow [2024-11-08 16:07:06,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:07:06,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-08 16:07:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 239 transitions. [2024-11-08 16:07:06,921 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9192307692307692 [2024-11-08 16:07:06,922 INFO L175 Difference]: Start difference. First operand has 128 places, 130 transitions, 270 flow. Second operand 2 states and 239 transitions. [2024-11-08 16:07:06,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 117 transitions, 260 flow [2024-11-08 16:07:06,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 117 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 16:07:06,927 INFO L231 Difference]: Finished difference. Result has 123 places, 117 transitions, 244 flow [2024-11-08 16:07:06,928 INFO L260 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-08 16:07:06,929 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, -5 predicate places. [2024-11-08 16:07:06,932 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 117 transitions, 244 flow [2024-11-08 16:07:06,932 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-08 16:07:06,933 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:07:06,933 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:07:06,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:07:06,933 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-08 16:07:06,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:07:06,934 INFO L85 PathProgramCache]: Analyzing trace with hash 471493904, now seen corresponding path program 1 times [2024-11-08 16:07:06,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:07:06,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440682164] [2024-11-08 16:07:06,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:07:06,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:07:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:07,006 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-08 16:07:07,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:07:07,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440682164] [2024-11-08 16:07:07,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440682164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:07:07,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:07:07,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:07:07,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278143842] [2024-11-08 16:07:07,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:07:07,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:07:07,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:07:07,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:07:07,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:07:07,090 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2024-11-08 16:07:07,091 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-08 16:07:07,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:07:07,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2024-11-08 16:07:07,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:07:07,805 INFO L124 PetriNetUnfolderBase]: 845/3283 cut-off events. [2024-11-08 16:07:07,805 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-08 16:07:07,819 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 29720 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-08 16:07:07,841 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 26 selfloop transitions, 9 changer transitions 0/129 dead transitions. [2024-11-08 16:07:07,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 129 transitions, 338 flow [2024-11-08 16:07:07,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:07:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:07:07,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2024-11-08 16:07:07,895 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8384615384615385 [2024-11-08 16:07:07,895 INFO L175 Difference]: Start difference. First operand has 123 places, 117 transitions, 244 flow. Second operand 3 states and 327 transitions. [2024-11-08 16:07:07,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 129 transitions, 338 flow [2024-11-08 16:07:07,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 129 transitions, 338 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 16:07:07,901 INFO L231 Difference]: Finished difference. Result has 127 places, 125 transitions, 314 flow [2024-11-08 16:07:07,901 INFO L260 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-08 16:07:07,903 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, -1 predicate places. [2024-11-08 16:07:07,903 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 125 transitions, 314 flow [2024-11-08 16:07:07,904 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-08 16:07:07,904 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:07:07,904 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:07:07,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:07:07,904 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-08 16:07:07,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:07:07,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1512186271, now seen corresponding path program 1 times [2024-11-08 16:07:07,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:07:07,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119778327] [2024-11-08 16:07:07,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:07:07,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:07:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:08,035 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-08 16:07:08,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:07:08,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119778327] [2024-11-08 16:07:08,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119778327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:07:08,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:07:08,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:07:08,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174696355] [2024-11-08 16:07:08,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:07:08,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:07:08,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:07:08,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:07:08,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:07:08,102 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2024-11-08 16:07:08,103 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-08 16:07:08,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:07:08,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2024-11-08 16:07:08,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:07:08,797 INFO L124 PetriNetUnfolderBase]: 1088/3830 cut-off events. [2024-11-08 16:07:08,797 INFO L125 PetriNetUnfolderBase]: For 861/1014 co-relation queries the response was YES. [2024-11-08 16:07:08,815 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 173. Compared 36081 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-08 16:07:08,840 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 30 selfloop transitions, 13 changer transitions 0/141 dead transitions. [2024-11-08 16:07:08,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 141 transitions, 459 flow [2024-11-08 16:07:08,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:07:08,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:07:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2024-11-08 16:07:08,843 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8512820512820513 [2024-11-08 16:07:08,843 INFO L175 Difference]: Start difference. First operand has 127 places, 125 transitions, 314 flow. Second operand 3 states and 332 transitions. [2024-11-08 16:07:08,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 141 transitions, 459 flow [2024-11-08 16:07:08,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 141 transitions, 433 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 16:07:08,858 INFO L231 Difference]: Finished difference. Result has 129 places, 136 transitions, 408 flow [2024-11-08 16:07:08,858 INFO L260 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-08 16:07:08,859 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 1 predicate places. [2024-11-08 16:07:08,862 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 136 transitions, 408 flow [2024-11-08 16:07:08,862 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-08 16:07:08,863 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:07:08,863 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:07:08,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:07:08,863 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-08 16:07:08,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:07:08,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1732176313, now seen corresponding path program 1 times [2024-11-08 16:07:08,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:07:08,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620307713] [2024-11-08 16:07:08,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:07:08,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:07:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:08,914 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-08 16:07:08,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:07:08,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620307713] [2024-11-08 16:07:08,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620307713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:07:08,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:07:08,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:07:08,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285956018] [2024-11-08 16:07:08,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:07:08,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:07:08,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:07:08,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:07:08,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:07:08,975 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2024-11-08 16:07:08,975 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-08 16:07:08,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:07:08,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2024-11-08 16:07:08,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:07:10,134 INFO L124 PetriNetUnfolderBase]: 2061/6890 cut-off events. [2024-11-08 16:07:10,135 INFO L125 PetriNetUnfolderBase]: For 3809/3989 co-relation queries the response was YES. [2024-11-08 16:07:10,215 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 72191 event pairs, 630 based on Foata normal form. 7/5761 useless extension candidates. Maximal degree in co-relation 13651. Up to 1788 conditions per place. [2024-11-08 16:07:10,260 INFO L140 encePairwiseOnDemand]: 115/130 looper letters, 44 selfloop transitions, 26 changer transitions 0/168 dead transitions. [2024-11-08 16:07:10,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 168 transitions, 707 flow [2024-11-08 16:07:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:07:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:07:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2024-11-08 16:07:10,263 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8615384615384616 [2024-11-08 16:07:10,263 INFO L175 Difference]: Start difference. First operand has 129 places, 136 transitions, 408 flow. Second operand 3 states and 336 transitions. [2024-11-08 16:07:10,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 168 transitions, 707 flow [2024-11-08 16:07:10,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 168 transitions, 663 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 16:07:10,279 INFO L231 Difference]: Finished difference. Result has 131 places, 161 transitions, 664 flow [2024-11-08 16:07:10,279 INFO L260 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-08 16:07:10,282 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 3 predicate places. [2024-11-08 16:07:10,282 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 161 transitions, 664 flow [2024-11-08 16:07:10,282 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-08 16:07:10,282 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:07:10,283 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:07:10,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:07:10,283 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-08 16:07:10,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:07:10,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1485029766, now seen corresponding path program 1 times [2024-11-08 16:07:10,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:07:10,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723063372] [2024-11-08 16:07:10,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:07:10,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:07:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:10,355 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-08 16:07:10,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:07:10,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723063372] [2024-11-08 16:07:10,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723063372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:07:10,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:07:10,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:07:10,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159804370] [2024-11-08 16:07:10,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:07:10,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:07:10,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:07:10,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:07:10,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:07:10,434 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2024-11-08 16:07:10,434 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-08 16:07:10,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:07:10,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2024-11-08 16:07:10,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:07:12,264 INFO L124 PetriNetUnfolderBase]: 2966/9755 cut-off events. [2024-11-08 16:07:12,265 INFO L125 PetriNetUnfolderBase]: For 15047/15536 co-relation queries the response was YES. [2024-11-08 16:07:12,297 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 426. Compared 106002 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-08 16:07:12,352 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 60 selfloop transitions, 22 changer transitions 0/183 dead transitions. [2024-11-08 16:07:12,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 183 transitions, 976 flow [2024-11-08 16:07:12,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:07:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:07:12,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2024-11-08 16:07:12,354 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8384615384615385 [2024-11-08 16:07:12,354 INFO L175 Difference]: Start difference. First operand has 131 places, 161 transitions, 664 flow. Second operand 3 states and 327 transitions. [2024-11-08 16:07:12,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 183 transitions, 976 flow [2024-11-08 16:07:12,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 183 transitions, 908 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 16:07:12,373 INFO L231 Difference]: Finished difference. Result has 133 places, 179 transitions, 862 flow [2024-11-08 16:07:12,374 INFO L260 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-08 16:07:12,375 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 5 predicate places. [2024-11-08 16:07:12,375 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 179 transitions, 862 flow [2024-11-08 16:07:12,375 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-08 16:07:12,376 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:07:12,376 INFO L204 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-08 16:07:12,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:07:12,377 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-08 16:07:12,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:07:12,377 INFO L85 PathProgramCache]: Analyzing trace with hash -144398375, now seen corresponding path program 1 times [2024-11-08 16:07:12,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:07:12,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657805921] [2024-11-08 16:07:12,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:07:12,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:07:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 16:07:12,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:07:12,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657805921] [2024-11-08 16:07:12,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657805921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:07:12,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:07:12,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:07:12,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611345530] [2024-11-08 16:07:12,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:07:12,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:07:12,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:07:12,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:07:12,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:07:12,483 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2024-11-08 16:07:12,484 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-08 16:07:12,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:07:12,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2024-11-08 16:07:12,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:07:14,380 INFO L124 PetriNetUnfolderBase]: 3533/10646 cut-off events. [2024-11-08 16:07:14,381 INFO L125 PetriNetUnfolderBase]: For 19402/19852 co-relation queries the response was YES. [2024-11-08 16:07:14,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27773 conditions, 10646 events. 3533/10646 cut-off events. For 19402/19852 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 115735 event pairs, 994 based on Foata normal form. 26/8880 useless extension candidates. Maximal degree in co-relation 27763. Up to 3995 conditions per place. [2024-11-08 16:07:14,478 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 68 selfloop transitions, 36 changer transitions 0/209 dead transitions. [2024-11-08 16:07:14,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 209 transitions, 1284 flow [2024-11-08 16:07:14,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:07:14,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:07:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2024-11-08 16:07:14,480 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8487179487179487 [2024-11-08 16:07:14,481 INFO L175 Difference]: Start difference. First operand has 133 places, 179 transitions, 862 flow. Second operand 3 states and 331 transitions. [2024-11-08 16:07:14,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 209 transitions, 1284 flow [2024-11-08 16:07:14,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 209 transitions, 1184 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-11-08 16:07:14,541 INFO L231 Difference]: Finished difference. Result has 135 places, 205 transitions, 1166 flow [2024-11-08 16:07:14,542 INFO L260 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-08 16:07:14,543 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 7 predicate places. [2024-11-08 16:07:14,543 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 205 transitions, 1166 flow [2024-11-08 16:07:14,544 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-08 16:07:14,544 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:07:14,544 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:07:14,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 16:07:14,545 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-08 16:07:14,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:07:14,546 INFO L85 PathProgramCache]: Analyzing trace with hash 426248522, now seen corresponding path program 1 times [2024-11-08 16:07:14,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:07:14,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736690546] [2024-11-08 16:07:14,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:07:14,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:07:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:14,595 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-08 16:07:14,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:07:14,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736690546] [2024-11-08 16:07:14,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736690546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:07:14,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:07:14,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:07:14,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523773523] [2024-11-08 16:07:14,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:07:14,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:07:14,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:07:14,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:07:14,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:07:14,655 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2024-11-08 16:07:14,656 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-08 16:07:14,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:07:14,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2024-11-08 16:07:14,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:07:16,643 INFO L124 PetriNetUnfolderBase]: 4494/13130 cut-off events. [2024-11-08 16:07:16,643 INFO L125 PetriNetUnfolderBase]: For 33502/34099 co-relation queries the response was YES. [2024-11-08 16:07:16,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37401 conditions, 13130 events. 4494/13130 cut-off events. For 33502/34099 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 144824 event pairs, 1133 based on Foata normal form. 23/11003 useless extension candidates. Maximal degree in co-relation 37390. Up to 4861 conditions per place. [2024-11-08 16:07:16,762 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 91 selfloop transitions, 38 changer transitions 0/236 dead transitions. [2024-11-08 16:07:16,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 236 transitions, 1685 flow [2024-11-08 16:07:16,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:07:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:07:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2024-11-08 16:07:16,764 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8512820512820513 [2024-11-08 16:07:16,765 INFO L175 Difference]: Start difference. First operand has 135 places, 205 transitions, 1166 flow. Second operand 3 states and 332 transitions. [2024-11-08 16:07:16,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 236 transitions, 1685 flow [2024-11-08 16:07:16,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 236 transitions, 1597 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 16:07:16,810 INFO L231 Difference]: Finished difference. Result has 137 places, 231 transitions, 1530 flow [2024-11-08 16:07:16,812 INFO L260 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-08 16:07:16,813 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 9 predicate places. [2024-11-08 16:07:16,814 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 231 transitions, 1530 flow [2024-11-08 16:07:16,814 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-08 16:07:16,814 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:07:16,815 INFO L204 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-08 16:07:16,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 16:07:16,815 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-08 16:07:16,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:07:16,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1014002853, now seen corresponding path program 1 times [2024-11-08 16:07:16,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:07:16,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671203785] [2024-11-08 16:07:16,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:07:16,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:07:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:07:16,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:07:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:07:16,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:07:16,871 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:07:16,872 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2024-11-08 16:07:16,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2024-11-08 16:07:16,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2024-11-08 16:07:16,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2024-11-08 16:07:16,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2024-11-08 16:07:16,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2024-11-08 16:07:16,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2024-11-08 16:07:16,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2024-11-08 16:07:16,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2024-11-08 16:07:16,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2024-11-08 16:07:16,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2024-11-08 16:07:16,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2024-11-08 16:07:16,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2024-11-08 16:07:16,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 16:07:16,878 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:07:16,879 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 16:07:16,879 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-08 16:07:16,943 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 16:07:16,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 161 transitions, 340 flow [2024-11-08 16:07:17,009 INFO L124 PetriNetUnfolderBase]: 18/311 cut-off events. [2024-11-08 16:07:17,009 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-08 16:07:17,011 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 1203 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-08 16:07:17,012 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 161 transitions, 340 flow [2024-11-08 16:07:17,015 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 161 transitions, 340 flow [2024-11-08 16:07:17,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:07:17,019 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;@6756df67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:07:17,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-08 16:07:17,026 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 16:07:17,026 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2024-11-08 16:07:17,026 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 16:07:17,026 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:07:17,027 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:07:17,027 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-08 16:07:17,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:07:17,028 INFO L85 PathProgramCache]: Analyzing trace with hash 58451093, now seen corresponding path program 1 times [2024-11-08 16:07:17,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:07:17,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026528370] [2024-11-08 16:07:17,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:07:17,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:07:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:17,064 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-08 16:07:17,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:07:17,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026528370] [2024-11-08 16:07:17,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026528370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:07:17,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:07:17,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:07:17,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440063661] [2024-11-08 16:07:17,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:07:17,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:07:17,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:07:17,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:07:17,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:07:17,071 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 161 [2024-11-08 16:07:17,072 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-08 16:07:17,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:07:17,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 161 [2024-11-08 16:07:17,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:07:17,432 INFO L124 PetriNetUnfolderBase]: 178/1732 cut-off events. [2024-11-08 16:07:17,432 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-11-08 16:07:17,441 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 14445 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-08 16:07:17,452 INFO L140 encePairwiseOnDemand]: 152/161 looper letters, 11 selfloop transitions, 0 changer transitions 0/144 dead transitions. [2024-11-08 16:07:17,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 144 transitions, 328 flow [2024-11-08 16:07:17,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:07:17,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-08 16:07:17,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 294 transitions. [2024-11-08 16:07:17,454 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9130434782608695 [2024-11-08 16:07:17,455 INFO L175 Difference]: Start difference. First operand has 159 places, 161 transitions, 340 flow. Second operand 2 states and 294 transitions. [2024-11-08 16:07:17,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 144 transitions, 328 flow [2024-11-08 16:07:17,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 144 transitions, 326 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-11-08 16:07:17,459 INFO L231 Difference]: Finished difference. Result has 152 places, 144 transitions, 304 flow [2024-11-08 16:07:17,460 INFO L260 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-08 16:07:17,460 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, -7 predicate places. [2024-11-08 16:07:17,461 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 144 transitions, 304 flow [2024-11-08 16:07:17,461 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-08 16:07:17,461 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:07:17,461 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:07:17,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 16:07:17,462 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-08 16:07:17,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:07:17,462 INFO L85 PathProgramCache]: Analyzing trace with hash -8141871, now seen corresponding path program 1 times [2024-11-08 16:07:17,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:07:17,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115005903] [2024-11-08 16:07:17,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:07:17,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:07:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:17,515 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-08 16:07:17,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:07:17,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115005903] [2024-11-08 16:07:17,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115005903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:07:17,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:07:17,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:07:17,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446657037] [2024-11-08 16:07:17,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:07:17,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:07:17,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:07:17,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:07:17,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:07:17,627 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 161 [2024-11-08 16:07:17,628 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-08 16:07:17,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:07:17,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 161 [2024-11-08 16:07:17,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:07:20,476 INFO L124 PetriNetUnfolderBase]: 8153/23044 cut-off events. [2024-11-08 16:07:20,476 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2024-11-08 16:07:20,531 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 266221 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-08 16:07:20,644 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 34 selfloop transitions, 12 changer transitions 0/161 dead transitions. [2024-11-08 16:07:20,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 161 transitions, 430 flow [2024-11-08 16:07:20,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:07:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:07:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2024-11-08 16:07:20,647 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8364389233954451 [2024-11-08 16:07:20,647 INFO L175 Difference]: Start difference. First operand has 152 places, 144 transitions, 304 flow. Second operand 3 states and 404 transitions. [2024-11-08 16:07:20,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 161 transitions, 430 flow [2024-11-08 16:07:20,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 161 transitions, 430 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 16:07:20,651 INFO L231 Difference]: Finished difference. Result has 156 places, 155 transitions, 398 flow [2024-11-08 16:07:20,651 INFO L260 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-08 16:07:20,652 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, -3 predicate places. [2024-11-08 16:07:20,652 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 155 transitions, 398 flow [2024-11-08 16:07:20,653 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-08 16:07:20,653 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:07:20,653 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:07:20,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 16:07:20,654 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-08 16:07:20,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:07:20,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1543676547, now seen corresponding path program 1 times [2024-11-08 16:07:20,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:07:20,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018073986] [2024-11-08 16:07:20,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:07:20,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:07:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:20,693 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-08 16:07:20,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:07:20,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018073986] [2024-11-08 16:07:20,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018073986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:07:20,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:07:20,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:07:20,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425426510] [2024-11-08 16:07:20,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:07:20,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:07:20,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:07:20,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:07:20,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:07:20,767 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2024-11-08 16:07:20,768 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-08 16:07:20,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:07:20,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2024-11-08 16:07:20,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:07:24,871 INFO L124 PetriNetUnfolderBase]: 11247/29861 cut-off events. [2024-11-08 16:07:24,871 INFO L125 PetriNetUnfolderBase]: For 7866/9081 co-relation queries the response was YES. [2024-11-08 16:07:24,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56111 conditions, 29861 events. 11247/29861 cut-off events. For 7866/9081 co-relation queries the response was YES. Maximal size of possible extension queue 1033. Compared 351640 event pairs, 6419 based on Foata normal form. 28/25419 useless extension candidates. Maximal degree in co-relation 56103. Up to 13140 conditions per place. [2024-11-08 16:07:25,099 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 42 selfloop transitions, 19 changer transitions 0/180 dead transitions. [2024-11-08 16:07:25,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 180 transitions, 620 flow [2024-11-08 16:07:25,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:07:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:07:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2024-11-08 16:07:25,102 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8488612836438924 [2024-11-08 16:07:25,102 INFO L175 Difference]: Start difference. First operand has 156 places, 155 transitions, 398 flow. Second operand 3 states and 410 transitions. [2024-11-08 16:07:25,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 180 transitions, 620 flow [2024-11-08 16:07:25,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 180 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 16:07:25,225 INFO L231 Difference]: Finished difference. Result has 158 places, 172 transitions, 546 flow [2024-11-08 16:07:25,225 INFO L260 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-08 16:07:25,226 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, -1 predicate places. [2024-11-08 16:07:25,226 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 172 transitions, 546 flow [2024-11-08 16:07:25,227 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-08 16:07:25,227 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:07:25,227 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:07:25,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 16:07:25,228 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-08 16:07:25,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:07:25,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2035810343, now seen corresponding path program 1 times [2024-11-08 16:07:25,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:07:25,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158184795] [2024-11-08 16:07:25,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:07:25,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:07:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:25,263 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-08 16:07:25,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:07:25,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158184795] [2024-11-08 16:07:25,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158184795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:07:25,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:07:25,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:07:25,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752882581] [2024-11-08 16:07:25,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:07:25,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:07:25,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:07:25,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:07:25,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:07:25,331 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 161 [2024-11-08 16:07:25,332 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-08 16:07:25,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:07:25,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 161 [2024-11-08 16:07:25,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:07:30,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([523] 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][148], [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, 176#(= |#race~c~0| 0), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true]) [2024-11-08 16:07:30,539 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-08 16:07:30,539 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:07:30,539 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:07:30,539 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:07:31,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] 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, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 160#true, 169#true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 54#L693-14true, 158#true]) [2024-11-08 16:07:31,083 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-08 16:07:31,083 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:07:31,083 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:07:31,083 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:07:31,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] 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][196], [106#L693-4true, 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 160#true, 169#true, 91#L693-14true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true]) [2024-11-08 16:07:31,096 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-08 16:07:31,096 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:07:31,096 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:07:31,096 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:07:31,524 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] 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][125], [25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 147#L693-5true, 156#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 160#true, 169#true, 91#L693-14true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true]) [2024-11-08 16:07:31,524 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-08 16:07:31,524 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:07:31,525 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:07:31,525 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:07:31,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] 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|), 70#L693-7true, 160#true, 169#true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 174#true, 158#true]) [2024-11-08 16:07:31,528 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-08 16:07:31,528 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:07:31,528 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:07:31,528 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:07:35,294 INFO L124 PetriNetUnfolderBase]: 31822/78787 cut-off events. [2024-11-08 16:07:35,295 INFO L125 PetriNetUnfolderBase]: For 55391/57079 co-relation queries the response was YES. [2024-11-08 16:07:35,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171117 conditions, 78787 events. 31822/78787 cut-off events. For 55391/57079 co-relation queries the response was YES. Maximal size of possible extension queue 2883. Compared 1033087 event pairs, 10576 based on Foata normal form. 71/64972 useless extension candidates. Maximal degree in co-relation 171108. Up to 24692 conditions per place. [2024-11-08 16:07:35,812 INFO L140 encePairwiseOnDemand]: 141/161 looper letters, 65 selfloop transitions, 40 changer transitions 0/222 dead transitions. [2024-11-08 16:07:35,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 222 transitions, 1028 flow [2024-11-08 16:07:35,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:07:35,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:07:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2024-11-08 16:07:35,815 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8530020703933747 [2024-11-08 16:07:35,815 INFO L175 Difference]: Start difference. First operand has 158 places, 172 transitions, 546 flow. Second operand 3 states and 412 transitions. [2024-11-08 16:07:35,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 222 transitions, 1028 flow [2024-11-08 16:07:36,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 222 transitions, 956 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 16:07:36,525 INFO L231 Difference]: Finished difference. Result has 160 places, 212 transitions, 964 flow [2024-11-08 16:07:36,525 INFO L260 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-08 16:07:36,526 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, 1 predicate places. [2024-11-08 16:07:36,526 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 212 transitions, 964 flow [2024-11-08 16:07:36,526 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-08 16:07:36,527 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:07:36,527 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:07:36,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 16:07:36,527 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-08 16:07:36,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:07:36,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1025238983, now seen corresponding path program 1 times [2024-11-08 16:07:36,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:07:36,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963240379] [2024-11-08 16:07:36,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:07:36,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:07:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:36,565 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-08 16:07:36,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:07:36,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963240379] [2024-11-08 16:07:36,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963240379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:07:36,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:07:36,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:07:36,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904347492] [2024-11-08 16:07:36,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:07:36,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:07:36,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:07:36,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:07:36,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:07:36,650 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 161 [2024-11-08 16:07:36,651 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-08 16:07:36,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:07:36,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 161 [2024-11-08 16:07:36,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:07:40,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] 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][141], [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, 156#true, 179#true, 160#true, 176#(= |#race~c~0| 0)]) [2024-11-08 16:07:40,742 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2024-11-08 16:07:40,742 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-08 16:07:40,742 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-08 16:07:40,742 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-08 16:07:40,779 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([523] 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][142], [162#true, 88#L692-3true, 16#L693-6true, 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|), 158#true, Black: 174#true, 156#true, 179#true, 160#true, 176#(= |#race~c~0| 0)]) [2024-11-08 16:07:40,779 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2024-11-08 16:07:40,779 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-08 16:07:40,779 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-08 16:07:40,779 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-08 16:07:40,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([537] 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][196], [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, Black: 176#(= |#race~c~0| 0), 115#L693-7true, 156#true, 179#true, 90#L693-4true, 160#true]) [2024-11-08 16:07:40,873 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-08 16:07:40,873 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:40,873 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:40,874 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:40,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([537] 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, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 107#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, 156#true, 179#true, 160#true]) [2024-11-08 16:07:40,933 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-08 16:07:40,933 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:40,933 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:40,933 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:41,224 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] 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][165], [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, 115#L693-7true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, 160#true]) [2024-11-08 16:07:41,225 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-08 16:07:41,225 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:41,225 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:41,225 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:41,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] 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][195], [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, 156#true, 179#true, 160#true]) [2024-11-08 16:07:41,708 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-08 16:07:41,709 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:41,709 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:41,709 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:41,767 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] 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][156], [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, 38#L693-14true, Black: 176#(= |#race~c~0| 0), 106#L693-4true, 156#true, 179#true, 160#true]) [2024-11-08 16:07:41,767 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-08 16:07:41,767 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:41,767 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:41,767 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:41,975 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] 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][71], [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, 38#L693-14true, Black: 176#(= |#race~c~0| 0), 147#L693-5true, 179#true, 156#true, 160#true]) [2024-11-08 16:07:41,975 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2024-11-08 16:07:41,975 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-08 16:07:41,975 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-08 16:07:41,975 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-08 16:07:42,303 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] 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][120], [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, 156#true, 179#true, 160#true]) [2024-11-08 16:07:42,303 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2024-11-08 16:07:42,303 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-08 16:07:42,303 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-08 16:07:42,304 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-08 16:07:42,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] 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][120], [162#true, 88#L692-3true, 107#L693-7true, 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), 147#L693-5true, 156#true, 179#true, 160#true]) [2024-11-08 16:07:42,357 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2024-11-08 16:07:42,357 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-08 16:07:42,357 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-08 16:07:42,357 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-08 16:07:42,748 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([537] 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][160], [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, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 115#L693-7true, 156#true, 179#true, 160#true]) [2024-11-08 16:07:42,748 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is not cut-off event [2024-11-08 16:07:42,748 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-11-08 16:07:42,748 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-11-08 16:07:42,748 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-11-08 16:07:42,808 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([537] 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][160], [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, 156#true, 179#true, 160#true]) [2024-11-08 16:07:42,808 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is not cut-off event [2024-11-08 16:07:42,808 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-11-08 16:07:42,808 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-11-08 16:07:42,808 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-11-08 16:07:43,699 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([523] 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][142], [162#true, 16#L693-6true, 70#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, Black: 174#true, 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 179#true, 160#true, 176#(= |#race~c~0| 0)]) [2024-11-08 16:07:43,699 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-08 16:07:43,699 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:07:43,699 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:07:43,699 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:07:43,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] 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][141], [162#true, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 86#L693-6true, 108#L693-7true, 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 156#true, 179#true, 160#true, 176#(= |#race~c~0| 0)]) [2024-11-08 16:07:43,766 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-08 16:07:43,766 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:07:43,766 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:07:43,766 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:07:44,194 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] 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][201], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 90#L693-4true, 160#true]) [2024-11-08 16:07:44,194 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-08 16:07:44,194 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:07:44,194 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:07:44,194 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:07:44,195 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] 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|), 54#L693-14true, 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 106#L693-4true, 156#true, 179#true, 160#true]) [2024-11-08 16:07:44,195 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-08 16:07:44,195 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:07:44,195 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:07:44,195 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:07:44,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] 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][165], [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, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 90#L693-4true, 160#true]) [2024-11-08 16:07:44,202 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-08 16:07:44,202 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:07:44,202 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:07:44,202 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:07:44,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] 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][195], [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, 156#true, 179#true, 160#true]) [2024-11-08 16:07:44,214 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-08 16:07:44,214 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:07:44,214 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:07:44,214 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:07:45,315 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] 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][120], [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-08 16:07:45,316 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-08 16:07:45,316 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:07:45,316 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:07:45,316 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:07:45,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] 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][173], [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, 54#L693-14true, 158#true, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 147#L693-5true, 156#true, 179#true, 160#true]) [2024-11-08 16:07:45,319 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-08 16:07:45,319 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:07:45,319 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:07:45,319 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:07:45,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] 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][120], [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), 156#true, 179#true, 160#true]) [2024-11-08 16:07:45,382 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-08 16:07:45,382 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:07:45,382 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:07:45,382 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:07:45,384 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] 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][173], [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, 54#L693-14true, 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 160#true]) [2024-11-08 16:07:45,384 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-08 16:07:45,384 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:07:45,384 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:07:45,384 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:07:49,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] 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][165], [18#L694-3true, 37#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 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, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 90#L693-4true, 160#true]) [2024-11-08 16:07:49,444 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-11-08 16:07:49,444 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-08 16:07:49,445 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-08 16:07:49,445 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-08 16:07:49,447 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] 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][201], [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, 54#L693-14true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 90#L693-4true, 160#true]) [2024-11-08 16:07:49,447 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-11-08 16:07:49,447 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-08 16:07:49,447 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-08 16:07:49,447 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-08 16:07:49,757 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] 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][173], [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, 54#L693-14true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 179#true, 156#true, 160#true]) [2024-11-08 16:07:49,757 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-11-08 16:07:49,757 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-08 16:07:49,757 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-08 16:07:49,757 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-08 16:07:49,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] 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][120], [18#L694-3true, 37#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 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, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 179#true, 160#true]) [2024-11-08 16:07:49,758 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2024-11-08 16:07:49,758 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-08 16:07:49,758 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-08 16:07:49,759 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-08 16:07:50,370 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] 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][165], [37#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 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, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693-4true, 160#true, 28#L701-3true]) [2024-11-08 16:07:50,370 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-11-08 16:07:50,370 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-08 16:07:50,370 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-08 16:07:50,370 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-08 16:07:50,373 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] 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][201], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 54#L693-14true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 90#L693-4true, 160#true, 28#L701-3true]) [2024-11-08 16:07:50,373 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-11-08 16:07:50,373 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-08 16:07:50,373 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-08 16:07:50,373 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-08 16:07:50,550 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] 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][120], [37#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 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, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 179#true, 28#L701-3true, 160#true]) [2024-11-08 16:07:50,550 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-11-08 16:07:50,550 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-08 16:07:50,550 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-08 16:07:50,550 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-08 16:07:50,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] 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][173], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 54#L693-14true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 179#true, 28#L701-3true, 160#true]) [2024-11-08 16:07:50,563 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2024-11-08 16:07:50,563 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-08 16:07:50,564 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-08 16:07:50,564 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-08 16:07:51,732 INFO L124 PetriNetUnfolderBase]: 45404/114068 cut-off events. [2024-11-08 16:07:51,733 INFO L125 PetriNetUnfolderBase]: For 212335/218324 co-relation queries the response was YES. [2024-11-08 16:07:52,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305840 conditions, 114068 events. 45404/114068 cut-off events. For 212335/218324 co-relation queries the response was YES. Maximal size of possible extension queue 3863. Compared 1555285 event pairs, 17118 based on Foata normal form. 381/95247 useless extension candidates. Maximal degree in co-relation 305830. Up to 49201 conditions per place. [2024-11-08 16:07:52,504 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 91 selfloop transitions, 36 changer transitions 0/250 dead transitions. [2024-11-08 16:07:52,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 250 transitions, 1496 flow [2024-11-08 16:07:52,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:07:52,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:07:52,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2024-11-08 16:07:52,507 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8364389233954451 [2024-11-08 16:07:52,507 INFO L175 Difference]: Start difference. First operand has 160 places, 212 transitions, 964 flow. Second operand 3 states and 404 transitions. [2024-11-08 16:07:52,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 250 transitions, 1496 flow [2024-11-08 16:07:52,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 250 transitions, 1386 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 16:07:52,636 INFO L231 Difference]: Finished difference. Result has 162 places, 244 transitions, 1330 flow [2024-11-08 16:07:52,636 INFO L260 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-08 16:07:52,637 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, 3 predicate places. [2024-11-08 16:07:52,637 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 244 transitions, 1330 flow [2024-11-08 16:07:52,638 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-08 16:07:52,638 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:07:52,638 INFO L204 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-08 16:07:52,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 16:07:52,638 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-08 16:07:52,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:07:52,639 INFO L85 PathProgramCache]: Analyzing trace with hash 286189145, now seen corresponding path program 1 times [2024-11-08 16:07:52,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:07:52,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142072887] [2024-11-08 16:07:52,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:07:52,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:07:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:07:52,678 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 16:07:52,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:07:52,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142072887] [2024-11-08 16:07:52,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142072887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:07:52,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:07:52,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:07:52,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588202997] [2024-11-08 16:07:52,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:07:52,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:07:52,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:07:52,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:07:52,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:07:52,747 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2024-11-08 16:07:52,748 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-08 16:07:52,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:07:52,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2024-11-08 16:07:52,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:07:58,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([523] 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-08 16:07:58,178 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-08 16:07:58,179 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:58,179 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:58,179 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:58,240 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] 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-08 16:07:58,241 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-08 16:07:58,241 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:58,241 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:58,241 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:58,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([601] 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|), 108#L693-7true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 106#L693-4true, 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-08 16:07:58,613 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2024-11-08 16:07:58,614 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:58,614 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:58,614 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-08 16:07:58,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] 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|), 54#L693-14true, 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]) [2024-11-08 16:07:58,770 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2024-11-08 16:07:58,770 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-08 16:07:58,770 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-08 16:07:58,770 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-08 16:07:59,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] 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][254], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 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]) [2024-11-08 16:07:59,672 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-08 16:07:59,672 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:07:59,672 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:07:59,672 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:07:59,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] 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|), 54#L693-14true, 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]) [2024-11-08 16:07:59,738 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-08 16:07:59,738 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:07:59,739 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:07:59,739 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:07:59,750 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] 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|), 54#L693-14true, 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]) [2024-11-08 16:07:59,750 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-08 16:07:59,750 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:07:59,750 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:07:59,750 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:08:01,005 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] 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][149], [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-08 16:08:01,005 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-08 16:08:01,005 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:08:01,005 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:08:01,005 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:08:01,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([523] 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][150], [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-08 16:08:01,084 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-08 16:08:01,084 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:08:01,084 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:08:01,084 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:08:01,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([601] 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][157], [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-08 16:08:01,141 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-08 16:08:01,141 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:08:01,141 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:08:01,141 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:08:01,163 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] 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][224], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 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]) [2024-11-08 16:08:01,163 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-08 16:08:01,163 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:01,164 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:01,164 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:01,294 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([601] 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][157], [162#true, 107#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 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-08 16:08:01,294 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-08 16:08:01,294 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:08:01,294 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:08:01,294 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:08:01,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] 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][224], [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|), 54#L693-14true, 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]) [2024-11-08 16:08:01,307 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-08 16:08:01,307 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:01,307 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:01,308 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:01,317 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] 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][149], [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, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-08 16:08:01,317 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-08 16:08:01,317 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:08:01,317 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:08:01,317 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-08 16:08:01,787 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] 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][223], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 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]) [2024-11-08 16:08:01,787 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-08 16:08:01,787 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:01,787 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:01,787 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:01,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([443] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_3|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][211], [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, 51#L693-14true, 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-08 16:08:01,861 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-08 16:08:01,861 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:01,861 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:01,861 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:01,946 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([443] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_3|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][163], [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, 51#L693-14true, Black: 176#(= |#race~c~0| 0), 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 90#L693-4true, Black: 179#true, 160#true, 184#true]) [2024-11-08 16:08:01,946 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-08 16:08:01,946 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:01,946 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:01,946 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:02,000 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] 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][175], [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, 38#L693-14true, 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]) [2024-11-08 16:08:02,000 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-08 16:08:02,000 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:02,001 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:02,001 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:02,024 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] 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][223], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 105#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 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|), 160#true, 184#true]) [2024-11-08 16:08:02,024 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-08 16:08:02,024 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:02,024 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:02,024 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:02,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] 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][176], [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|), 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|), 160#true, 184#true]) [2024-11-08 16:08:02,035 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-11-08 16:08:02,035 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:02,035 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:02,035 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-08 16:08:03,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([443] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_3|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][66], [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, 57#L693-5true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 51#L693-14true, 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), Black: 179#true, 160#true, 184#true]) [2024-11-08 16:08:03,397 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-08 16:08:03,398 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:08:03,398 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:08:03,398 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:08:03,405 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] 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][185], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 158#true, 57#L693-5true, Black: 176#(= |#race~c~0| 0), 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 115#L693-7true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-08 16:08:03,406 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-08 16:08:03,406 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:08:03,406 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:08:03,406 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:08:03,533 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] 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][71], [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, 38#L693-14true, Black: 176#(= |#race~c~0| 0), 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 147#L693-5true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2024-11-08 16:08:03,533 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-08 16:08:03,534 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:08:03,534 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:08:03,534 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:08:03,540 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] 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][185], [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|), 54#L693-14true, 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]) [2024-11-08 16:08:03,540 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-11-08 16:08:03,540 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:08:03,540 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-08 16:08:03,540 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event