./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4fc63b2a 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_0648d4fc-3363-4c9b-8149-d72c2332be43/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0648d4fc-3363-4c9b-8149-d72c2332be43/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0648d4fc-3363-4c9b-8149-d72c2332be43/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0648d4fc-3363-4c9b-8149-d72c2332be43/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0648d4fc-3363-4c9b-8149-d72c2332be43/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0648d4fc-3363-4c9b-8149-d72c2332be43/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:04:56,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:04:56,860 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0648d4fc-3363-4c9b-8149-d72c2332be43/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-31 22:04:56,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:04:56,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:04:56,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:04:56,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:04:56,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:04:56,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:04:56,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:04:56,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:04:56,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:04:56,916 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:04:56,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:04:56,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:04:56,920 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:04:56,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:04:56,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:04:56,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:04:56,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:04:56,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:04:56,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:04:56,923 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-31 22:04:56,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:04:56,927 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:04:56,927 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:04:56,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:04:56,928 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:04:56,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:04:56,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:04:56,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:04:56,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:04:56,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:04:56,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:04:56,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:04:56,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:04:56,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:04:56,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:04:56,934 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:04:56,934 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:04:56,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:04:56,935 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_0648d4fc-3363-4c9b-8149-d72c2332be43/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0648d4fc-3363-4c9b-8149-d72c2332be43/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 [2024-10-31 22:04:57,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:04:57,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:04:57,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:04:57,270 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:04:57,270 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:04:57,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0648d4fc-3363-4c9b-8149-d72c2332be43/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i Unable to find full path for "g++" [2024-10-31 22:04:59,476 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:04:59,741 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:04:59,742 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0648d4fc-3363-4c9b-8149-d72c2332be43/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i [2024-10-31 22:04:59,765 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0648d4fc-3363-4c9b-8149-d72c2332be43/bin/uautomizer-verify-4GaUIPS5ZU/data/a611efea0/3531d3981efd469887256e4b2fabb0e5/FLAG01763dc4f [2024-10-31 22:04:59,782 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0648d4fc-3363-4c9b-8149-d72c2332be43/bin/uautomizer-verify-4GaUIPS5ZU/data/a611efea0/3531d3981efd469887256e4b2fabb0e5 [2024-10-31 22:04:59,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:04:59,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:04:59,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:04:59,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:04:59,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:04:59,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:04:59" (1/1) ... [2024-10-31 22:04:59,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425a9030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:59, skipping insertion in model container [2024-10-31 22:04:59,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:04:59" (1/1) ... [2024-10-31 22:04:59,869 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:05:00,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:05:00,514 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:05:00,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:05:00,654 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:05:00,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:00 WrapperNode [2024-10-31 22:05:00,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:05:00,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:05:00,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:05:00,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:05:00,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:00" (1/1) ... [2024-10-31 22:05:00,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:00" (1/1) ... [2024-10-31 22:05:00,750 INFO L138 Inliner]: procedures = 168, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 249 [2024-10-31 22:05:00,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:05:00,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:05:00,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:05:00,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:05:00,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:00" (1/1) ... [2024-10-31 22:05:00,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:00" (1/1) ... [2024-10-31 22:05:00,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:00" (1/1) ... [2024-10-31 22:05:00,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:00" (1/1) ... [2024-10-31 22:05:00,785 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:00" (1/1) ... [2024-10-31 22:05:00,791 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:00" (1/1) ... [2024-10-31 22:05:00,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:00" (1/1) ... [2024-10-31 22:05:00,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:00" (1/1) ... [2024-10-31 22:05:00,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:05:00,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:05:00,834 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:05:00,834 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:05:00,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:00" (1/1) ... [2024-10-31 22:05:00,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:05:00,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0648d4fc-3363-4c9b-8149-d72c2332be43/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:05:00,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0648d4fc-3363-4c9b-8149-d72c2332be43/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:05:00,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0648d4fc-3363-4c9b-8149-d72c2332be43/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:05:00,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-31 22:05:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-31 22:05:00,926 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-31 22:05:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-31 22:05:00,927 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-31 22:05:00,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-31 22:05:00,927 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-31 22:05:00,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:05:00,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-10-31 22:05:00,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 22:05:00,929 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-31 22:05:00,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:05:00,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:05:00,932 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:05:01,165 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:05:01,168 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:05:01,683 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:05:01,683 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:05:01,724 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:05:01,726 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-31 22:05:01,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:05:01 BoogieIcfgContainer [2024-10-31 22:05:01,728 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:05:01,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:05:01,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:05:01,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:05:01,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:04:59" (1/3) ... [2024-10-31 22:05:01,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cccf21b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:05:01, skipping insertion in model container [2024-10-31 22:05:01,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:00" (2/3) ... [2024-10-31 22:05:01,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cccf21b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:05:01, skipping insertion in model container [2024-10-31 22:05:01,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:05:01" (3/3) ... [2024-10-31 22:05:01,740 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2024-10-31 22:05:01,761 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:05:01,761 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2024-10-31 22:05:01,762 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:05:01,896 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-31 22:05:01,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 287 places, 296 transitions, 606 flow [2024-10-31 22:05:02,155 INFO L124 PetriNetUnfolderBase]: 16/294 cut-off events. [2024-10-31 22:05:02,155 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-31 22:05:02,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 294 events. 16/294 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 748 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 208. Up to 2 conditions per place. [2024-10-31 22:05:02,178 INFO L82 GeneralOperation]: Start removeDead. Operand has 287 places, 296 transitions, 606 flow [2024-10-31 22:05:02,222 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 280 places, 289 transitions, 587 flow [2024-10-31 22:05:02,260 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:05:02,274 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;@123e9e8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:05:02,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2024-10-31 22:05:02,298 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:05:02,302 INFO L124 PetriNetUnfolderBase]: 0/46 cut-off events. [2024-10-31 22:05:02,303 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:05:02,303 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:02,304 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:02,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-31 22:05:02,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:02,318 INFO L85 PathProgramCache]: Analyzing trace with hash -622365026, now seen corresponding path program 1 times [2024-10-31 22:05:02,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:02,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907662011] [2024-10-31 22:05:02,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:02,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:02,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:02,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907662011] [2024-10-31 22:05:02,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907662011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:02,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:02,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:05:02,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100632858] [2024-10-31 22:05:02,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:02,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:05:02,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:02,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:05:02,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:05:02,840 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 296 [2024-10-31 22:05:02,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 289 transitions, 587 flow. Second operand has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:02,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:02,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 296 [2024-10-31 22:05:02,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:03,038 INFO L124 PetriNetUnfolderBase]: 55/704 cut-off events. [2024-10-31 22:05:03,038 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-10-31 22:05:03,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 704 events. 55/704 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3806 event pairs, 27 based on Foata normal form. 43/623 useless extension candidates. Maximal degree in co-relation 688. Up to 79 conditions per place. [2024-10-31 22:05:03,047 INFO L140 encePairwiseOnDemand]: 285/296 looper letters, 16 selfloop transitions, 2 changer transitions 0/274 dead transitions. [2024-10-31 22:05:03,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 274 transitions, 593 flow [2024-10-31 22:05:03,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:05:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:05:03,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 822 transitions. [2024-10-31 22:05:03,066 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9256756756756757 [2024-10-31 22:05:03,071 INFO L175 Difference]: Start difference. First operand has 280 places, 289 transitions, 587 flow. Second operand 3 states and 822 transitions. [2024-10-31 22:05:03,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 274 transitions, 593 flow [2024-10-31 22:05:03,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 274 transitions, 588 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-31 22:05:03,087 INFO L231 Difference]: Finished difference. Result has 272 places, 274 transitions, 556 flow [2024-10-31 22:05:03,089 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=272, PETRI_TRANSITIONS=274} [2024-10-31 22:05:03,095 INFO L277 CegarLoopForPetriNet]: 280 programPoint places, -8 predicate places. [2024-10-31 22:05:03,095 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 274 transitions, 556 flow [2024-10-31 22:05:03,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:03,096 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:03,097 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:03,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:05:03,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-31 22:05:03,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:03,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1696912876, now seen corresponding path program 1 times [2024-10-31 22:05:03,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:03,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345388758] [2024-10-31 22:05:03,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:03,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:03,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:03,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:03,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345388758] [2024-10-31 22:05:03,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345388758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:03,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:03,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:05:03,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915380079] [2024-10-31 22:05:03,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:03,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:05:03,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:03,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:05:03,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:05:03,311 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 296 [2024-10-31 22:05:03,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 274 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:03,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:03,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 296 [2024-10-31 22:05:03,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:03,454 INFO L124 PetriNetUnfolderBase]: 59/707 cut-off events. [2024-10-31 22:05:03,455 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-31 22:05:03,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 707 events. 59/707 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3907 event pairs, 31 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 765. Up to 89 conditions per place. [2024-10-31 22:05:03,461 INFO L140 encePairwiseOnDemand]: 293/296 looper letters, 18 selfloop transitions, 2 changer transitions 0/273 dead transitions. [2024-10-31 22:05:03,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 273 transitions, 594 flow [2024-10-31 22:05:03,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:05:03,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:05:03,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 810 transitions. [2024-10-31 22:05:03,464 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9121621621621622 [2024-10-31 22:05:03,464 INFO L175 Difference]: Start difference. First operand has 272 places, 274 transitions, 556 flow. Second operand 3 states and 810 transitions. [2024-10-31 22:05:03,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 273 transitions, 594 flow [2024-10-31 22:05:03,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 273 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:05:03,471 INFO L231 Difference]: Finished difference. Result has 271 places, 273 transitions, 554 flow [2024-10-31 22:05:03,471 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=271, PETRI_TRANSITIONS=273} [2024-10-31 22:05:03,472 INFO L277 CegarLoopForPetriNet]: 280 programPoint places, -9 predicate places. [2024-10-31 22:05:03,472 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 273 transitions, 554 flow [2024-10-31 22:05:03,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:03,473 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:03,474 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:03,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:05:03,474 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-31 22:05:03,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:03,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1354278050, now seen corresponding path program 1 times [2024-10-31 22:05:03,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:03,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876220683] [2024-10-31 22:05:03,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:03,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:03,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:03,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:03,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876220683] [2024-10-31 22:05:03,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876220683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:03,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:03,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:05:03,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537229252] [2024-10-31 22:05:03,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:03,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:05:03,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:03,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:05:03,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:05:03,591 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 296 [2024-10-31 22:05:03,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 273 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:03,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:03,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 296 [2024-10-31 22:05:03,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:03,847 INFO L124 PetriNetUnfolderBase]: 125/1320 cut-off events. [2024-10-31 22:05:03,847 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-10-31 22:05:03,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1533 conditions, 1320 events. 125/1320 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 8585 event pairs, 54 based on Foata normal form. 0/1098 useless extension candidates. Maximal degree in co-relation 1473. Up to 170 conditions per place. [2024-10-31 22:05:03,857 INFO L140 encePairwiseOnDemand]: 285/296 looper letters, 23 selfloop transitions, 5 changer transitions 0/274 dead transitions. [2024-10-31 22:05:03,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 274 transitions, 614 flow [2024-10-31 22:05:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:05:03,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:05:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 805 transitions. [2024-10-31 22:05:03,861 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9065315315315315 [2024-10-31 22:05:03,861 INFO L175 Difference]: Start difference. First operand has 271 places, 273 transitions, 554 flow. Second operand 3 states and 805 transitions. [2024-10-31 22:05:03,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 274 transitions, 614 flow [2024-10-31 22:05:03,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 274 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:05:03,867 INFO L231 Difference]: Finished difference. Result has 268 places, 271 transitions, 574 flow [2024-10-31 22:05:03,868 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=268, PETRI_TRANSITIONS=271} [2024-10-31 22:05:03,869 INFO L277 CegarLoopForPetriNet]: 280 programPoint places, -12 predicate places. [2024-10-31 22:05:03,869 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 271 transitions, 574 flow [2024-10-31 22:05:03,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:03,870 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:03,870 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:03,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:05:03,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-31 22:05:03,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:03,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1136070789, now seen corresponding path program 1 times [2024-10-31 22:05:03,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:03,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675683196] [2024-10-31 22:05:03,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:03,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:03,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:03,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675683196] [2024-10-31 22:05:03,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675683196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:03,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:03,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:05:03,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396609992] [2024-10-31 22:05:03,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:03,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:05:03,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:03,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:05:03,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:05:03,965 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 296 [2024-10-31 22:05:03,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 271 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:03,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:03,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 296 [2024-10-31 22:05:03,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:04,222 INFO L124 PetriNetUnfolderBase]: 79/1187 cut-off events. [2024-10-31 22:05:04,223 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-10-31 22:05:04,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1340 conditions, 1187 events. 79/1187 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7069 event pairs, 24 based on Foata normal form. 0/995 useless extension candidates. Maximal degree in co-relation 1135. Up to 82 conditions per place. [2024-10-31 22:05:04,233 INFO L140 encePairwiseOnDemand]: 293/296 looper letters, 15 selfloop transitions, 2 changer transitions 0/270 dead transitions. [2024-10-31 22:05:04,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 270 transitions, 606 flow [2024-10-31 22:05:04,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:05:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:05:04,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2024-10-31 22:05:04,237 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.918918918918919 [2024-10-31 22:05:04,237 INFO L175 Difference]: Start difference. First operand has 268 places, 271 transitions, 574 flow. Second operand 3 states and 816 transitions. [2024-10-31 22:05:04,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 270 transitions, 606 flow [2024-10-31 22:05:04,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 270 transitions, 596 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:05:04,245 INFO L231 Difference]: Finished difference. Result has 267 places, 270 transitions, 566 flow [2024-10-31 22:05:04,245 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=267, PETRI_TRANSITIONS=270} [2024-10-31 22:05:04,246 INFO L277 CegarLoopForPetriNet]: 280 programPoint places, -13 predicate places. [2024-10-31 22:05:04,247 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 270 transitions, 566 flow [2024-10-31 22:05:04,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:04,248 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:04,248 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:04,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:05:04,249 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-31 22:05:04,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:04,250 INFO L85 PathProgramCache]: Analyzing trace with hash -92905258, now seen corresponding path program 1 times [2024-10-31 22:05:04,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:04,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005698369] [2024-10-31 22:05:04,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:04,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:04,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005698369] [2024-10-31 22:05:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005698369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:04,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:04,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:05:04,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143243300] [2024-10-31 22:05:04,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:04,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:05:04,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:04,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:05:04,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:05:04,366 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 296 [2024-10-31 22:05:04,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 270 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 268.3333333333333) internal successors, (805), 3 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:04,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:04,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 296 [2024-10-31 22:05:04,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:04,529 INFO L124 PetriNetUnfolderBase]: 63/915 cut-off events. [2024-10-31 22:05:04,529 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-31 22:05:04,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 915 events. 63/915 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4531 event pairs, 22 based on Foata normal form. 0/768 useless extension candidates. Maximal degree in co-relation 962. Up to 69 conditions per place. [2024-10-31 22:05:04,537 INFO L140 encePairwiseOnDemand]: 293/296 looper letters, 13 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2024-10-31 22:05:04,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 269 transitions, 594 flow [2024-10-31 22:05:04,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:05:04,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:05:04,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 817 transitions. [2024-10-31 22:05:04,540 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.920045045045045 [2024-10-31 22:05:04,540 INFO L175 Difference]: Start difference. First operand has 267 places, 270 transitions, 566 flow. Second operand 3 states and 817 transitions. [2024-10-31 22:05:04,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 269 transitions, 594 flow [2024-10-31 22:05:04,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 269 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:05:04,546 INFO L231 Difference]: Finished difference. Result has 266 places, 269 transitions, 564 flow [2024-10-31 22:05:04,546 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=266, PETRI_TRANSITIONS=269} [2024-10-31 22:05:04,547 INFO L277 CegarLoopForPetriNet]: 280 programPoint places, -14 predicate places. [2024-10-31 22:05:04,548 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 269 transitions, 564 flow [2024-10-31 22:05:04,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 268.3333333333333) internal successors, (805), 3 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:04,549 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:04,549 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:04,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:05:04,549 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-31 22:05:04,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:04,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2145093817, now seen corresponding path program 1 times [2024-10-31 22:05:04,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:04,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130715728] [2024-10-31 22:05:04,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:04,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:04,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:04,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130715728] [2024-10-31 22:05:04,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130715728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:04,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:04,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:05:04,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081633518] [2024-10-31 22:05:04,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:04,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:05:04,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:04,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:05:04,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:05:04,641 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 296 [2024-10-31 22:05:04,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 269 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 268.3333333333333) internal successors, (805), 3 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:04,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:04,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 296 [2024-10-31 22:05:04,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:04,805 INFO L124 PetriNetUnfolderBase]: 68/1005 cut-off events. [2024-10-31 22:05:04,805 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-31 22:05:04,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 1005 events. 68/1005 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5347 event pairs, 22 based on Foata normal form. 0/845 useless extension candidates. Maximal degree in co-relation 1047. Up to 71 conditions per place. [2024-10-31 22:05:04,816 INFO L140 encePairwiseOnDemand]: 293/296 looper letters, 13 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2024-10-31 22:05:04,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 268 transitions, 592 flow [2024-10-31 22:05:04,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:05:04,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:05:04,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 817 transitions. [2024-10-31 22:05:04,819 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.920045045045045 [2024-10-31 22:05:04,819 INFO L175 Difference]: Start difference. First operand has 266 places, 269 transitions, 564 flow. Second operand 3 states and 817 transitions. [2024-10-31 22:05:04,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 268 transitions, 592 flow [2024-10-31 22:05:04,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 268 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:05:04,824 INFO L231 Difference]: Finished difference. Result has 265 places, 268 transitions, 562 flow [2024-10-31 22:05:04,825 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=265, PETRI_TRANSITIONS=268} [2024-10-31 22:05:04,828 INFO L277 CegarLoopForPetriNet]: 280 programPoint places, -15 predicate places. [2024-10-31 22:05:04,828 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 268 transitions, 562 flow [2024-10-31 22:05:04,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 268.3333333333333) internal successors, (805), 3 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:04,829 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:04,829 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:04,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:05:04,830 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-31 22:05:04,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:04,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2067276918, now seen corresponding path program 1 times [2024-10-31 22:05:04,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:04,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810859247] [2024-10-31 22:05:04,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:04,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:04,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:04,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810859247] [2024-10-31 22:05:04,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810859247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:04,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:04,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:05:04,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193464587] [2024-10-31 22:05:04,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:04,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:05:04,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:04,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:05:04,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:05:04,964 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 296 [2024-10-31 22:05:04,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 268 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 272.6666666666667) internal successors, (818), 3 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:04,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:04,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 296 [2024-10-31 22:05:04,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:05,220 INFO L124 PetriNetUnfolderBase]: 110/1350 cut-off events. [2024-10-31 22:05:05,221 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-31 22:05:05,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1556 conditions, 1350 events. 110/1350 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 8014 event pairs, 20 based on Foata normal form. 0/1132 useless extension candidates. Maximal degree in co-relation 1476. Up to 87 conditions per place. [2024-10-31 22:05:05,232 INFO L140 encePairwiseOnDemand]: 291/296 looper letters, 19 selfloop transitions, 4 changer transitions 0/278 dead transitions. [2024-10-31 22:05:05,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 278 transitions, 631 flow [2024-10-31 22:05:05,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:05:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:05:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 837 transitions. [2024-10-31 22:05:05,235 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9425675675675675 [2024-10-31 22:05:05,235 INFO L175 Difference]: Start difference. First operand has 265 places, 268 transitions, 562 flow. Second operand 3 states and 837 transitions. [2024-10-31 22:05:05,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 278 transitions, 631 flow [2024-10-31 22:05:05,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 278 transitions, 627 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:05:05,244 INFO L231 Difference]: Finished difference. Result has 267 places, 272 transitions, 592 flow [2024-10-31 22:05:05,244 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=267, PETRI_TRANSITIONS=272} [2024-10-31 22:05:05,245 INFO L277 CegarLoopForPetriNet]: 280 programPoint places, -13 predicate places. [2024-10-31 22:05:05,245 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 272 transitions, 592 flow [2024-10-31 22:05:05,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.6666666666667) internal successors, (818), 3 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:05,246 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:05,247 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:05,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:05:05,248 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-31 22:05:05,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:05,249 INFO L85 PathProgramCache]: Analyzing trace with hash 828549193, now seen corresponding path program 1 times [2024-10-31 22:05:05,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:05,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469355823] [2024-10-31 22:05:05,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:05,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:05,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:05,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469355823] [2024-10-31 22:05:05,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469355823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:05,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:05,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:05:05,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261263243] [2024-10-31 22:05:05,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:05,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:05:05,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:05,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:05:05,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:05:05,351 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 296 [2024-10-31 22:05:05,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 272 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:05,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:05,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 296 [2024-10-31 22:05:05,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:05,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([803] L746-4-->L753-2: Formula: (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0))) (= |v_t2Thread1of1ForFork1_#t~ret22#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret22#1=|v_t2Thread1of1ForFork1_#t~ret22#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret22#1][261], [310#true, 147#L727-3true, 288#true, 96#L753-2true, 315#true, Black: 312#(= |#race~send~0| 0), Black: 296#true, 54#L764-4true]) [2024-10-31 22:05:05,699 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2024-10-31 22:05:05,699 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-31 22:05:05,699 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-10-31 22:05:05,699 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-10-31 22:05:05,710 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([803] L746-4-->L753-2: Formula: (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0))) (= |v_t2Thread1of1ForFork1_#t~ret22#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret22#1=|v_t2Thread1of1ForFork1_#t~ret22#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret22#1][261], [310#true, 288#true, 96#L753-2true, 315#true, Black: 312#(= |#race~send~0| 0), Black: 296#true, 228#L765-1true]) [2024-10-31 22:05:05,711 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2024-10-31 22:05:05,711 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-31 22:05:05,711 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-31 22:05:05,711 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-10-31 22:05:05,820 INFO L124 PetriNetUnfolderBase]: 217/2431 cut-off events. [2024-10-31 22:05:05,821 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-10-31 22:05:05,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2869 conditions, 2431 events. 217/2431 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 17886 event pairs, 41 based on Foata normal form. 0/2032 useless extension candidates. Maximal degree in co-relation 2641. Up to 161 conditions per place. [2024-10-31 22:05:05,836 INFO L140 encePairwiseOnDemand]: 291/296 looper letters, 18 selfloop transitions, 4 changer transitions 0/281 dead transitions. [2024-10-31 22:05:05,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 281 transitions, 655 flow [2024-10-31 22:05:05,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:05:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:05:05,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 836 transitions. [2024-10-31 22:05:05,839 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414414414414415 [2024-10-31 22:05:05,839 INFO L175 Difference]: Start difference. First operand has 267 places, 272 transitions, 592 flow. Second operand 3 states and 836 transitions. [2024-10-31 22:05:05,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 281 transitions, 655 flow [2024-10-31 22:05:05,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 281 transitions, 647 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:05:05,845 INFO L231 Difference]: Finished difference. Result has 269 places, 276 transitions, 618 flow [2024-10-31 22:05:05,846 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=269, PETRI_TRANSITIONS=276} [2024-10-31 22:05:05,847 INFO L277 CegarLoopForPetriNet]: 280 programPoint places, -11 predicate places. [2024-10-31 22:05:05,847 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 276 transitions, 618 flow [2024-10-31 22:05:05,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:05,848 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:05,848 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:05,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:05:05,849 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-31 22:05:05,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:05,849 INFO L85 PathProgramCache]: Analyzing trace with hash 57012047, now seen corresponding path program 1 times [2024-10-31 22:05:05,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:05,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018139483] [2024-10-31 22:05:05,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:05,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:05,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:05,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018139483] [2024-10-31 22:05:05,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018139483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:05,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:05,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:05:05,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282546314] [2024-10-31 22:05:05,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:05,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:05:05,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:05,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:05:05,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:05:05,954 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 296 [2024-10-31 22:05:05,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 276 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:05,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:05,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 296 [2024-10-31 22:05:05,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:06,739 INFO L124 PetriNetUnfolderBase]: 466/4512 cut-off events. [2024-10-31 22:05:06,740 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-10-31 22:05:06,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5515 conditions, 4512 events. 466/4512 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 42744 event pairs, 114 based on Foata normal form. 0/3852 useless extension candidates. Maximal degree in co-relation 5208. Up to 521 conditions per place. [2024-10-31 22:05:06,779 INFO L140 encePairwiseOnDemand]: 289/296 looper letters, 24 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2024-10-31 22:05:06,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 279 transitions, 679 flow [2024-10-31 22:05:06,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:05:06,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:05:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 814 transitions. [2024-10-31 22:05:06,785 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2024-10-31 22:05:06,785 INFO L175 Difference]: Start difference. First operand has 269 places, 276 transitions, 618 flow. Second operand 3 states and 814 transitions. [2024-10-31 22:05:06,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 279 transitions, 679 flow [2024-10-31 22:05:06,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 279 transitions, 671 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:05:06,798 INFO L231 Difference]: Finished difference. Result has 265 places, 273 transitions, 614 flow [2024-10-31 22:05:06,799 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=265, PETRI_TRANSITIONS=273} [2024-10-31 22:05:06,800 INFO L277 CegarLoopForPetriNet]: 280 programPoint places, -15 predicate places. [2024-10-31 22:05:06,800 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 273 transitions, 614 flow [2024-10-31 22:05:06,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:06,801 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:06,802 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:06,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:05:06,802 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-31 22:05:06,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:06,803 INFO L85 PathProgramCache]: Analyzing trace with hash -2112364832, now seen corresponding path program 1 times [2024-10-31 22:05:06,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:06,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018668216] [2024-10-31 22:05:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:06,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:06,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:06,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:06,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018668216] [2024-10-31 22:05:06,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018668216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:06,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:06,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:05:06,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284690978] [2024-10-31 22:05:06,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:06,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:05:06,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:06,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:05:06,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:05:06,956 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 296 [2024-10-31 22:05:06,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 273 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:06,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:06,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 296 [2024-10-31 22:05:06,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:07,968 INFO L124 PetriNetUnfolderBase]: 669/5576 cut-off events. [2024-10-31 22:05:07,969 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2024-10-31 22:05:07,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7050 conditions, 5576 events. 669/5576 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 53184 event pairs, 125 based on Foata normal form. 0/4877 useless extension candidates. Maximal degree in co-relation 6781. Up to 598 conditions per place. [2024-10-31 22:05:08,007 INFO L140 encePairwiseOnDemand]: 289/296 looper letters, 18 selfloop transitions, 4 changer transitions 0/277 dead transitions. [2024-10-31 22:05:08,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 277 transitions, 667 flow [2024-10-31 22:05:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:05:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:05:08,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 823 transitions. [2024-10-31 22:05:08,010 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9268018018018018 [2024-10-31 22:05:08,010 INFO L175 Difference]: Start difference. First operand has 265 places, 273 transitions, 614 flow. Second operand 3 states and 823 transitions. [2024-10-31 22:05:08,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 277 transitions, 667 flow [2024-10-31 22:05:08,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 277 transitions, 667 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:05:08,017 INFO L231 Difference]: Finished difference. Result has 265 places, 272 transitions, 628 flow [2024-10-31 22:05:08,017 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=265, PETRI_TRANSITIONS=272} [2024-10-31 22:05:08,019 INFO L277 CegarLoopForPetriNet]: 280 programPoint places, -15 predicate places. [2024-10-31 22:05:08,019 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 272 transitions, 628 flow [2024-10-31 22:05:08,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:08,020 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:08,020 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:08,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:05:08,021 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-31 22:05:08,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:08,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1333814429, now seen corresponding path program 1 times [2024-10-31 22:05:08,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:08,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781354276] [2024-10-31 22:05:08,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:08,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:08,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:08,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781354276] [2024-10-31 22:05:08,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781354276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:08,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:08,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:05:08,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175402823] [2024-10-31 22:05:08,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:08,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:05:08,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:08,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:05:08,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:05:08,127 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 296 [2024-10-31 22:05:08,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 272 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:08,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:08,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 296 [2024-10-31 22:05:08,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:08,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([803] L746-4-->L753-2: Formula: (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0))) (= |v_t2Thread1of1ForFork1_#t~ret22#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret22#1=|v_t2Thread1of1ForFork1_#t~ret22#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret22#1][123], [326#(= |#race~first~0| 0), 322#(= |#race~buffer_size~0| 0), 147#L727-3true, Black: 320#true, 288#true, Black: 324#true, 96#L753-2true, 328#true, Black: 312#(= |#race~send~0| 0), Black: 296#true, 54#L764-4true, Black: 317#(= |#race~receive~0| 0)]) [2024-10-31 22:05:08,973 INFO L294 olderBase$Statistics]: this new event has 184 ancestors and is cut-off event [2024-10-31 22:05:08,973 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-31 22:05:08,973 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-10-31 22:05:08,973 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-31 22:05:09,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([803] L746-4-->L753-2: Formula: (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0))) (= |v_t2Thread1of1ForFork1_#t~ret22#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret22#1=|v_t2Thread1of1ForFork1_#t~ret22#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret22#1][123], [326#(= |#race~first~0| 0), 322#(= |#race~buffer_size~0| 0), Black: 320#true, 288#true, Black: 324#true, 96#L753-2true, 328#true, Black: 312#(= |#race~send~0| 0), Black: 296#true, 228#L765-1true, Black: 317#(= |#race~receive~0| 0)]) [2024-10-31 22:05:09,007 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2024-10-31 22:05:09,008 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:05:09,008 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-10-31 22:05:09,008 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-31 22:05:09,158 INFO L124 PetriNetUnfolderBase]: 685/5268 cut-off events. [2024-10-31 22:05:09,158 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-10-31 22:05:09,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6930 conditions, 5268 events. 685/5268 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 49463 event pairs, 291 based on Foata normal form. 0/4576 useless extension candidates. Maximal degree in co-relation 6604. Up to 816 conditions per place. [2024-10-31 22:05:09,210 INFO L140 encePairwiseOnDemand]: 292/296 looper letters, 18 selfloop transitions, 3 changer transitions 0/276 dead transitions. [2024-10-31 22:05:09,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 276 transitions, 680 flow [2024-10-31 22:05:09,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:05:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:05:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 823 transitions. [2024-10-31 22:05:09,214 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9268018018018018 [2024-10-31 22:05:09,214 INFO L175 Difference]: Start difference. First operand has 265 places, 272 transitions, 628 flow. Second operand 3 states and 823 transitions. [2024-10-31 22:05:09,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 276 transitions, 680 flow [2024-10-31 22:05:09,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 276 transitions, 676 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:05:09,222 INFO L231 Difference]: Finished difference. Result has 268 places, 273 transitions, 642 flow [2024-10-31 22:05:09,223 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=268, PETRI_TRANSITIONS=273} [2024-10-31 22:05:09,224 INFO L277 CegarLoopForPetriNet]: 280 programPoint places, -12 predicate places. [2024-10-31 22:05:09,224 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 273 transitions, 642 flow [2024-10-31 22:05:09,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:09,225 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:09,225 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:09,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:05:09,226 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-31 22:05:09,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:09,226 INFO L85 PathProgramCache]: Analyzing trace with hash -173480469, now seen corresponding path program 1 times [2024-10-31 22:05:09,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:09,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311421577] [2024-10-31 22:05:09,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:09,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:09,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:09,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311421577] [2024-10-31 22:05:09,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311421577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:09,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:09,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:05:09,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936624694] [2024-10-31 22:05:09,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:09,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:05:09,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:09,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:05:09,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:05:09,315 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 296 [2024-10-31 22:05:09,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 273 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:09,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:09,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 296 [2024-10-31 22:05:09,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:10,887 INFO L124 PetriNetUnfolderBase]: 1039/9403 cut-off events. [2024-10-31 22:05:10,888 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2024-10-31 22:05:10,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12054 conditions, 9403 events. 1039/9403 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 102635 event pairs, 204 based on Foata normal form. 0/8262 useless extension candidates. Maximal degree in co-relation 11769. Up to 705 conditions per place. [2024-10-31 22:05:10,964 INFO L140 encePairwiseOnDemand]: 292/296 looper letters, 16 selfloop transitions, 3 changer transitions 0/281 dead transitions. [2024-10-31 22:05:10,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 281 transitions, 697 flow [2024-10-31 22:05:10,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:05:10,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:05:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 839 transitions. [2024-10-31 22:05:10,966 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9448198198198198 [2024-10-31 22:05:10,966 INFO L175 Difference]: Start difference. First operand has 268 places, 273 transitions, 642 flow. Second operand 3 states and 839 transitions. [2024-10-31 22:05:10,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 281 transitions, 697 flow [2024-10-31 22:05:10,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 281 transitions, 691 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:05:10,975 INFO L231 Difference]: Finished difference. Result has 270 places, 276 transitions, 662 flow [2024-10-31 22:05:10,975 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=270, PETRI_TRANSITIONS=276} [2024-10-31 22:05:10,977 INFO L277 CegarLoopForPetriNet]: 280 programPoint places, -10 predicate places. [2024-10-31 22:05:10,977 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 276 transitions, 662 flow [2024-10-31 22:05:10,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:10,978 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:10,978 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:10,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:05:10,978 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-31 22:05:10,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:10,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1935369411, now seen corresponding path program 1 times [2024-10-31 22:05:10,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:10,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775690670] [2024-10-31 22:05:10,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:10,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:11,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:11,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:11,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775690670] [2024-10-31 22:05:11,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775690670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:11,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:11,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:05:11,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475960091] [2024-10-31 22:05:11,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:11,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:05:11,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:11,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:05:11,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:05:11,066 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 296 [2024-10-31 22:05:11,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 276 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 269.6666666666667) internal successors, (809), 3 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:11,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:11,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 296 [2024-10-31 22:05:11,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:12,643 INFO L124 PetriNetUnfolderBase]: 1407/10206 cut-off events. [2024-10-31 22:05:12,643 INFO L125 PetriNetUnfolderBase]: For 379/385 co-relation queries the response was YES. [2024-10-31 22:05:12,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14158 conditions, 10206 events. 1407/10206 cut-off events. For 379/385 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 111859 event pairs, 588 based on Foata normal form. 0/9033 useless extension candidates. Maximal degree in co-relation 13879. Up to 1707 conditions per place. [2024-10-31 22:05:12,718 INFO L140 encePairwiseOnDemand]: 292/296 looper letters, 18 selfloop transitions, 3 changer transitions 0/279 dead transitions. [2024-10-31 22:05:12,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 279 transitions, 709 flow [2024-10-31 22:05:12,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:05:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:05:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 823 transitions. [2024-10-31 22:05:12,721 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9268018018018018 [2024-10-31 22:05:12,721 INFO L175 Difference]: Start difference. First operand has 270 places, 276 transitions, 662 flow. Second operand 3 states and 823 transitions. [2024-10-31 22:05:12,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 279 transitions, 709 flow [2024-10-31 22:05:12,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 279 transitions, 701 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-31 22:05:12,730 INFO L231 Difference]: Finished difference. Result has 272 places, 276 transitions, 668 flow [2024-10-31 22:05:12,731 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=668, PETRI_PLACES=272, PETRI_TRANSITIONS=276} [2024-10-31 22:05:12,732 INFO L277 CegarLoopForPetriNet]: 280 programPoint places, -8 predicate places. [2024-10-31 22:05:12,732 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 276 transitions, 668 flow [2024-10-31 22:05:12,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.6666666666667) internal successors, (809), 3 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:12,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:12,733 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:12,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:05:12,734 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-31 22:05:12,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:12,734 INFO L85 PathProgramCache]: Analyzing trace with hash -958631901, now seen corresponding path program 1 times [2024-10-31 22:05:12,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:12,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754089897] [2024-10-31 22:05:12,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:12,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:12,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:12,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754089897] [2024-10-31 22:05:12,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754089897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:12,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:12,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:05:12,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371309712] [2024-10-31 22:05:12,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:12,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:05:12,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:12,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:05:12,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:05:13,067 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 296 [2024-10-31 22:05:13,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 276 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:13,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:13,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 296 [2024-10-31 22:05:13,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:14,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([803] L746-4-->L753-2: Formula: (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0))) (= |v_t2Thread1of1ForFork1_#t~ret22#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret22#1=|v_t2Thread1of1ForFork1_#t~ret22#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret22#1][123], [338#true, 322#(= |#race~buffer_size~0| 0), Black: 320#true, 288#true, Black: 324#true, Black: 296#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), 343#true, 54#L764-4true, Black: 333#true, 147#L727-3true, Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 96#L753-2true, Black: 312#(= |#race~send~0| 0), Black: 317#(= |#race~receive~0| 0)]) [2024-10-31 22:05:14,176 INFO L294 olderBase$Statistics]: this new event has 184 ancestors and is cut-off event [2024-10-31 22:05:14,176 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-31 22:05:14,176 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-31 22:05:14,177 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-10-31 22:05:14,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([803] L746-4-->L753-2: Formula: (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0))) (= |v_t2Thread1of1ForFork1_#t~ret22#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret22#1=|v_t2Thread1of1ForFork1_#t~ret22#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret22#1][123], [338#true, 322#(= |#race~buffer_size~0| 0), Black: 320#true, 288#true, Black: 324#true, Black: 296#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), 343#true, Black: 333#true, Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 96#L753-2true, Black: 312#(= |#race~send~0| 0), 228#L765-1true, Black: 317#(= |#race~receive~0| 0)]) [2024-10-31 22:05:14,277 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2024-10-31 22:05:14,277 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-10-31 22:05:14,277 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-31 22:05:14,277 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:05:14,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([803] L746-4-->L753-2: Formula: (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0))) (= |v_t2Thread1of1ForFork1_#t~ret22#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret22#1=|v_t2Thread1of1ForFork1_#t~ret22#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret22#1][123], [338#true, 322#(= |#race~buffer_size~0| 0), Black: 320#true, 288#true, Black: 324#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 296#true, 54#L764-4true, 343#true, Black: 333#true, Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 96#L753-2true, Black: 312#(= |#race~send~0| 0), 46#L736-2true, Black: 317#(= |#race~receive~0| 0)]) [2024-10-31 22:05:14,563 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2024-10-31 22:05:14,563 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2024-10-31 22:05:14,563 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-31 22:05:14,563 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-10-31 22:05:14,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([687] L728-->L728-1: Formula: (= |v_#race~send~0_4| 0) InVars {} OutVars{#race~send~0=|v_#race~send~0_4|} AuxVars[] AssignedVars[#race~send~0][93], [322#(= |#race~buffer_size~0| 0), 338#true, Black: 320#true, 288#true, 59#L751-3true, Black: 324#true, Black: 296#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), 54#L764-4true, 343#true, Black: 333#true, Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 310#true, 238#L728-1true, Black: 317#(= |#race~receive~0| 0)]) [2024-10-31 22:05:14,633 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2024-10-31 22:05:14,633 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-10-31 22:05:14,633 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2024-10-31 22:05:14,633 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-31 22:05:14,668 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([803] L746-4-->L753-2: Formula: (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0))) (= |v_t2Thread1of1ForFork1_#t~ret22#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret22#1=|v_t2Thread1of1ForFork1_#t~ret22#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret22#1][123], [322#(= |#race~buffer_size~0| 0), 338#true, Black: 320#true, 288#true, Black: 324#true, Black: 296#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), 54#L764-4true, 343#true, Black: 333#true, 147#L727-3true, Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 96#L753-2true, Black: 312#(= |#race~send~0| 0), Black: 317#(= |#race~receive~0| 0)]) [2024-10-31 22:05:14,668 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2024-10-31 22:05:14,669 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-31 22:05:14,669 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2024-10-31 22:05:14,669 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-31 22:05:14,669 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-10-31 22:05:14,731 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([803] L746-4-->L753-2: Formula: (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0))) (= |v_t2Thread1of1ForFork1_#t~ret22#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret22#1=|v_t2Thread1of1ForFork1_#t~ret22#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret22#1][123], [322#(= |#race~buffer_size~0| 0), 338#true, Black: 320#true, 288#true, Black: 324#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 296#true, 343#true, Black: 333#true, Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 96#L753-2true, Black: 312#(= |#race~send~0| 0), 228#L765-1true, Black: 317#(= |#race~receive~0| 0)]) [2024-10-31 22:05:14,731 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2024-10-31 22:05:14,731 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-10-31 22:05:14,731 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-31 22:05:14,731 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:05:14,732 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2024-10-31 22:05:14,888 INFO L124 PetriNetUnfolderBase]: 1218/10119 cut-off events. [2024-10-31 22:05:14,888 INFO L125 PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES. [2024-10-31 22:05:14,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13782 conditions, 10119 events. 1218/10119 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 111938 event pairs, 460 based on Foata normal form. 0/9020 useless extension candidates. Maximal degree in co-relation 13460. Up to 1348 conditions per place. [2024-10-31 22:05:14,983 INFO L140 encePairwiseOnDemand]: 291/296 looper letters, 21 selfloop transitions, 4 changer transitions 0/282 dead transitions. [2024-10-31 22:05:14,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 282 transitions, 732 flow [2024-10-31 22:05:14,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:05:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:05:14,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 821 transitions. [2024-10-31 22:05:14,985 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9245495495495496 [2024-10-31 22:05:14,986 INFO L175 Difference]: Start difference. First operand has 272 places, 276 transitions, 668 flow. Second operand 3 states and 821 transitions. [2024-10-31 22:05:14,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 282 transitions, 732 flow [2024-10-31 22:05:14,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 282 transitions, 726 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:05:14,996 INFO L231 Difference]: Finished difference. Result has 274 places, 279 transitions, 692 flow [2024-10-31 22:05:14,997 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=692, PETRI_PLACES=274, PETRI_TRANSITIONS=279} [2024-10-31 22:05:14,997 INFO L277 CegarLoopForPetriNet]: 280 programPoint places, -6 predicate places. [2024-10-31 22:05:14,998 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 279 transitions, 692 flow [2024-10-31 22:05:14,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:14,998 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:14,999 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:14,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:05:14,999 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-31 22:05:14,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:15,000 INFO L85 PathProgramCache]: Analyzing trace with hash -291442231, now seen corresponding path program 1 times [2024-10-31 22:05:15,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:15,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553110828] [2024-10-31 22:05:15,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:15,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:15,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:15,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:15,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553110828] [2024-10-31 22:05:15,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553110828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:15,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:15,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:05:15,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063508491] [2024-10-31 22:05:15,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:15,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:05:15,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:15,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:05:15,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:05:15,164 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 296 [2024-10-31 22:05:15,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 279 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 272.6666666666667) internal successors, (818), 3 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:15,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:15,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 296 [2024-10-31 22:05:15,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:15,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([803] L746-4-->L753-2: Formula: (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0))) (= |v_t2Thread1of1ForFork1_#t~ret22#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret22#1=|v_t2Thread1of1ForFork1_#t~ret22#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret22#1][123], [322#(= |#race~buffer_size~0| 0), Black: 320#true, 288#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), 348#true, Black: 296#true, 343#true, 54#L764-4true, Black: 333#true, 324#true, Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 96#L753-2true, Black: 312#(= |#race~send~0| 0), Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 46#L736-2true, Black: 317#(= |#race~receive~0| 0)]) [2024-10-31 22:05:15,932 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2024-10-31 22:05:15,932 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-10-31 22:05:15,932 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-10-31 22:05:15,932 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-10-31 22:05:16,018 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([803] L746-4-->L753-2: Formula: (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0))) (= |v_t2Thread1of1ForFork1_#t~ret22#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret22#1=|v_t2Thread1of1ForFork1_#t~ret22#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret22#1][123], [322#(= |#race~buffer_size~0| 0), Black: 320#true, 288#true, Black: 324#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), 348#true, Black: 296#true, 343#true, 54#L764-4true, Black: 333#true, Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 96#L753-2true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 312#(= |#race~send~0| 0), 46#L736-2true, Black: 317#(= |#race~receive~0| 0)]) [2024-10-31 22:05:16,018 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2024-10-31 22:05:16,018 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-10-31 22:05:16,018 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-31 22:05:16,018 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-10-31 22:05:16,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([803] L746-4-->L753-2: Formula: (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0))) (= |v_t2Thread1of1ForFork1_#t~ret22#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret22#1=|v_t2Thread1of1ForFork1_#t~ret22#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret22#1][123], [322#(= |#race~buffer_size~0| 0), Black: 320#true, 288#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), 348#true, Black: 296#true, 343#true, 54#L764-4true, Black: 333#true, 324#true, 147#L727-3true, Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 96#L753-2true, Black: 312#(= |#race~send~0| 0), Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 317#(= |#race~receive~0| 0)]) [2024-10-31 22:05:16,033 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-10-31 22:05:16,034 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-10-31 22:05:16,034 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-10-31 22:05:16,034 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2024-10-31 22:05:16,107 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([803] L746-4-->L753-2: Formula: (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0))) (= |v_t2Thread1of1ForFork1_#t~ret22#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret22#1=|v_t2Thread1of1ForFork1_#t~ret22#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret22#1][123], [322#(= |#race~buffer_size~0| 0), Black: 320#true, 288#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), 348#true, Black: 296#true, 343#true, Black: 333#true, 324#true, Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 96#L753-2true, Black: 312#(= |#race~send~0| 0), Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 228#L765-1true, Black: 317#(= |#race~receive~0| 0)]) [2024-10-31 22:05:16,107 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2024-10-31 22:05:16,107 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2024-10-31 22:05:16,107 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2024-10-31 22:05:16,107 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-10-31 22:05:16,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([803] L746-4-->L753-2: Formula: (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0))) (= |v_t2Thread1of1ForFork1_#t~ret22#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret22#1=|v_t2Thread1of1ForFork1_#t~ret22#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret22#1][123], [322#(= |#race~buffer_size~0| 0), Black: 320#true, 288#true, Black: 324#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), 348#true, Black: 296#true, 343#true, 54#L764-4true, Black: 333#true, 147#L727-3true, Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 96#L753-2true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 312#(= |#race~send~0| 0), Black: 317#(= |#race~receive~0| 0)]) [2024-10-31 22:05:16,126 INFO L294 olderBase$Statistics]: this new event has 184 ancestors and is cut-off event [2024-10-31 22:05:16,126 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-10-31 22:05:16,126 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-31 22:05:16,126 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-31 22:05:16,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([803] L746-4-->L753-2: Formula: (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0))) (= |v_t2Thread1of1ForFork1_#t~ret22#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret22#1=|v_t2Thread1of1ForFork1_#t~ret22#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret22#1][123], [322#(= |#race~buffer_size~0| 0), Black: 320#true, 288#true, Black: 324#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), 348#true, Black: 296#true, 343#true, Black: 333#true, Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 96#L753-2true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 312#(= |#race~send~0| 0), 228#L765-1true, Black: 317#(= |#race~receive~0| 0)]) [2024-10-31 22:05:16,205 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2024-10-31 22:05:16,205 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-10-31 22:05:16,205 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-31 22:05:16,205 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:05:16,747 INFO L124 PetriNetUnfolderBase]: 1104/9738 cut-off events. [2024-10-31 22:05:16,747 INFO L125 PetriNetUnfolderBase]: For 372/390 co-relation queries the response was YES. [2024-10-31 22:05:16,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13354 conditions, 9738 events. 1104/9738 cut-off events. For 372/390 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 107258 event pairs, 313 based on Foata normal form. 2/8683 useless extension candidates. Maximal degree in co-relation 13050. Up to 1087 conditions per place. [2024-10-31 22:05:16,807 INFO L140 encePairwiseOnDemand]: 291/296 looper letters, 16 selfloop transitions, 6 changer transitions 0/286 dead transitions. [2024-10-31 22:05:16,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 286 transitions, 756 flow [2024-10-31 22:05:16,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:05:16,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:05:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 833 transitions. [2024-10-31 22:05:16,811 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9380630630630631 [2024-10-31 22:05:16,811 INFO L175 Difference]: Start difference. First operand has 274 places, 279 transitions, 692 flow. Second operand 3 states and 833 transitions. [2024-10-31 22:05:16,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 286 transitions, 756 flow [2024-10-31 22:05:16,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 286 transitions, 748 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:05:16,822 INFO L231 Difference]: Finished difference. Result has 276 places, 283 transitions, 730 flow [2024-10-31 22:05:16,823 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=276, PETRI_TRANSITIONS=283} [2024-10-31 22:05:16,824 INFO L277 CegarLoopForPetriNet]: 280 programPoint places, -4 predicate places. [2024-10-31 22:05:16,824 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 283 transitions, 730 flow [2024-10-31 22:05:16,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.6666666666667) internal successors, (818), 3 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:16,825 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:16,825 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:16,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:05:16,825 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-31 22:05:16,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:16,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1735236766, now seen corresponding path program 1 times [2024-10-31 22:05:16,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:16,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878029761] [2024-10-31 22:05:16,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:16,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:16,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:16,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878029761] [2024-10-31 22:05:16,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878029761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:16,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:16,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:05:16,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402707558] [2024-10-31 22:05:16,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:16,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:05:16,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:16,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:05:16,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:05:16,936 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 296 [2024-10-31 22:05:16,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 283 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:16,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:16,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 296 [2024-10-31 22:05:16,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:18,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([803] L746-4-->L753-2: Formula: (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0))) (= |v_t2Thread1of1ForFork1_#t~ret22#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret22#1=|v_t2Thread1of1ForFork1_#t~ret22#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret22#1][123], [322#(= |#race~buffer_size~0| 0), Black: 320#true, 288#true, Black: 324#true, Black: 296#true, 348#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), 54#L764-4true, 353#true, Black: 333#true, 147#L727-3true, Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 96#L753-2true, Black: 312#(= |#race~send~0| 0), Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 317#(= |#race~receive~0| 0), Black: 350#(= |#race~value~0| |t1Thread1of1ForFork0_#t~nondet13#1|)]) [2024-10-31 22:05:18,228 INFO L294 olderBase$Statistics]: this new event has 184 ancestors and is cut-off event [2024-10-31 22:05:18,228 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-31 22:05:18,228 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-31 22:05:18,229 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-10-31 22:05:18,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([803] L746-4-->L753-2: Formula: (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0))) (= |v_t2Thread1of1ForFork1_#t~ret22#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret22#1=|v_t2Thread1of1ForFork1_#t~ret22#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret22#1][123], [322#(= |#race~buffer_size~0| 0), Black: 320#true, 288#true, Black: 324#true, Black: 296#true, 348#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), 353#true, Black: 333#true, Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 96#L753-2true, Black: 312#(= |#race~send~0| 0), Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 228#L765-1true, Black: 317#(= |#race~receive~0| 0), Black: 350#(= |#race~value~0| |t1Thread1of1ForFork0_#t~nondet13#1|)]) [2024-10-31 22:05:18,337 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2024-10-31 22:05:18,337 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:05:18,337 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-31 22:05:18,337 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-10-31 22:05:19,237 INFO L124 PetriNetUnfolderBase]: 1320/11076 cut-off events. [2024-10-31 22:05:19,237 INFO L125 PetriNetUnfolderBase]: For 723/750 co-relation queries the response was YES. [2024-10-31 22:05:19,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15696 conditions, 11076 events. 1320/11076 cut-off events. For 723/750 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 126049 event pairs, 477 based on Foata normal form. 3/10011 useless extension candidates. Maximal degree in co-relation 15407. Up to 1540 conditions per place. [2024-10-31 22:05:19,290 INFO L140 encePairwiseOnDemand]: 293/296 looper letters, 19 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2024-10-31 22:05:19,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 285 transitions, 777 flow [2024-10-31 22:05:19,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:05:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:05:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 819 transitions. [2024-10-31 22:05:19,293 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9222972972972973 [2024-10-31 22:05:19,293 INFO L175 Difference]: Start difference. First operand has 276 places, 283 transitions, 730 flow. Second operand 3 states and 819 transitions. [2024-10-31 22:05:19,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 285 transitions, 777 flow [2024-10-31 22:05:19,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 285 transitions, 765 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:05:19,304 INFO L231 Difference]: Finished difference. Result has 275 places, 282 transitions, 720 flow [2024-10-31 22:05:19,305 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=275, PETRI_TRANSITIONS=282} [2024-10-31 22:05:19,306 INFO L277 CegarLoopForPetriNet]: 280 programPoint places, -5 predicate places. [2024-10-31 22:05:19,306 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 282 transitions, 720 flow [2024-10-31 22:05:19,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:19,307 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:19,307 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:19,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 22:05:19,307 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-31 22:05:19,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:19,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1681246986, now seen corresponding path program 1 times [2024-10-31 22:05:19,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:19,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011675126] [2024-10-31 22:05:19,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:19,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:19,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:19,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:19,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011675126] [2024-10-31 22:05:19,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011675126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:19,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:19,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:05:19,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744852725] [2024-10-31 22:05:19,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:19,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:05:19,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:19,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:05:19,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:05:19,482 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 296 [2024-10-31 22:05:19,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 282 transitions, 720 flow. Second operand has 5 states, 5 states have (on average 268.8) internal successors, (1344), 5 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:19,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:19,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 296 [2024-10-31 22:05:19,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:21,357 INFO L124 PetriNetUnfolderBase]: 1805/14636 cut-off events. [2024-10-31 22:05:21,357 INFO L125 PetriNetUnfolderBase]: For 592/624 co-relation queries the response was YES. [2024-10-31 22:05:21,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20857 conditions, 14636 events. 1805/14636 cut-off events. For 592/624 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 174805 event pairs, 585 based on Foata normal form. 3/13114 useless extension candidates. Maximal degree in co-relation 20504. Up to 1947 conditions per place. [2024-10-31 22:05:21,458 INFO L140 encePairwiseOnDemand]: 289/296 looper letters, 35 selfloop transitions, 10 changer transitions 2/312 dead transitions. [2024-10-31 22:05:21,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 312 transitions, 880 flow [2024-10-31 22:05:21,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:05:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:05:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1650 transitions. [2024-10-31 22:05:21,462 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9290540540540541 [2024-10-31 22:05:21,462 INFO L175 Difference]: Start difference. First operand has 275 places, 282 transitions, 720 flow. Second operand 6 states and 1650 transitions. [2024-10-31 22:05:21,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 312 transitions, 880 flow [2024-10-31 22:05:21,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 312 transitions, 876 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:05:21,478 INFO L231 Difference]: Finished difference. Result has 281 places, 291 transitions, 778 flow [2024-10-31 22:05:21,479 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=778, PETRI_PLACES=281, PETRI_TRANSITIONS=291} [2024-10-31 22:05:21,479 INFO L277 CegarLoopForPetriNet]: 280 programPoint places, 1 predicate places. [2024-10-31 22:05:21,479 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 291 transitions, 778 flow [2024-10-31 22:05:21,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 268.8) internal successors, (1344), 5 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:21,480 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:21,481 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:21,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 22:05:21,481 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-31 22:05:21,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:21,481 INFO L85 PathProgramCache]: Analyzing trace with hash -119211124, now seen corresponding path program 1 times [2024-10-31 22:05:21,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:21,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682060645] [2024-10-31 22:05:21,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:21,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:21,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:21,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682060645] [2024-10-31 22:05:21,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682060645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:21,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:21,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:05:21,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488299869] [2024-10-31 22:05:21,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:21,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:05:21,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:21,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:05:21,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:05:21,553 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 296 [2024-10-31 22:05:21,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 291 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:21,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:21,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 296 [2024-10-31 22:05:21,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:22,876 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([745] L732-1-->L732-2: Formula: (= |v_#race~value~0_1| |v_t1Thread1of1ForFork0_#t~nondet13#1_3|) InVars {t1Thread1of1ForFork0_#t~nondet13#1=|v_t1Thread1of1ForFork0_#t~nondet13#1_3|} OutVars{t1Thread1of1ForFork0_#t~nondet13#1=|v_t1Thread1of1ForFork0_#t~nondet13#1_3|, #race~value~0=|v_#race~value~0_1|} AuxVars[] AssignedVars[#race~value~0][262], [Black: 348#true, 322#(= |#race~buffer_size~0| 0), Black: 320#true, 288#true, Black: 324#true, 366#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 296#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 358#(= ~value~0 0), 54#L764-4true, Black: 335#(= |#race~value~0| 0), 260#L748-6true, Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 250#L732-2true, Black: 310#true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 356#true, Black: 317#(= |#race~receive~0| 0)]) [2024-10-31 22:05:22,876 INFO L294 olderBase$Statistics]: this new event has 223 ancestors and is cut-off event [2024-10-31 22:05:22,876 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:05:22,876 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2024-10-31 22:05:22,876 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:05:22,889 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([846] L748-9-->L749: Formula: true InVars {} OutVars{t2Thread1of1ForFork1_#t~ret19#1=|v_t2Thread1of1ForFork1_#t~ret19#1_11|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~ret19#1][257], [322#(= |#race~buffer_size~0| 0), 154#L732true, Black: 320#true, 288#true, Black: 324#true, 366#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 296#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 358#(= ~value~0 0), 54#L764-4true, Black: 333#true, Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 310#true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 356#true, Black: 317#(= |#race~receive~0| 0), 163#L749true, Black: 350#(= |#race~value~0| |t1Thread1of1ForFork0_#t~nondet13#1|)]) [2024-10-31 22:05:22,889 INFO L294 olderBase$Statistics]: this new event has 223 ancestors and is cut-off event [2024-10-31 22:05:22,889 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:05:22,889 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2024-10-31 22:05:22,889 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:05:22,899 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] L730-10-->L732: Formula: (= v_~value~0_2 |v_t1Thread1of1ForFork0_~i~0#1_19|) InVars {t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_19|} OutVars{t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_19|, ~value~0=v_~value~0_2} AuxVars[] AssignedVars[~value~0][289], [322#(= |#race~buffer_size~0| 0), 154#L732true, Black: 320#true, 288#true, Black: 324#true, 366#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 296#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 358#(= ~value~0 0), 54#L764-4true, Black: 333#true, Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 310#true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 356#true, 163#L749true, Black: 317#(= |#race~receive~0| 0), Black: 350#(= |#race~value~0| |t1Thread1of1ForFork0_#t~nondet13#1|)]) [2024-10-31 22:05:22,899 INFO L294 olderBase$Statistics]: this new event has 223 ancestors and is cut-off event [2024-10-31 22:05:22,899 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:05:22,899 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:05:22,899 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2024-10-31 22:05:23,161 INFO L124 PetriNetUnfolderBase]: 1241/12165 cut-off events. [2024-10-31 22:05:23,161 INFO L125 PetriNetUnfolderBase]: For 619/706 co-relation queries the response was YES. [2024-10-31 22:05:23,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17356 conditions, 12165 events. 1241/12165 cut-off events. For 619/706 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 141126 event pairs, 328 based on Foata normal form. 8/11054 useless extension candidates. Maximal degree in co-relation 16971. Up to 1240 conditions per place. [2024-10-31 22:05:23,275 INFO L140 encePairwiseOnDemand]: 291/296 looper letters, 19 selfloop transitions, 5 changer transitions 0/297 dead transitions. [2024-10-31 22:05:23,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 297 transitions, 842 flow [2024-10-31 22:05:23,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:05:23,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:05:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 829 transitions. [2024-10-31 22:05:23,279 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9335585585585585 [2024-10-31 22:05:23,279 INFO L175 Difference]: Start difference. First operand has 281 places, 291 transitions, 778 flow. Second operand 3 states and 829 transitions. [2024-10-31 22:05:23,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 297 transitions, 842 flow [2024-10-31 22:05:23,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 297 transitions, 842 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:05:23,296 INFO L231 Difference]: Finished difference. Result has 285 places, 294 transitions, 814 flow [2024-10-31 22:05:23,296 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=814, PETRI_PLACES=285, PETRI_TRANSITIONS=294} [2024-10-31 22:05:23,297 INFO L277 CegarLoopForPetriNet]: 280 programPoint places, 5 predicate places. [2024-10-31 22:05:23,297 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 294 transitions, 814 flow [2024-10-31 22:05:23,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:23,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:23,298 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:23,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-31 22:05:23,299 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-31 22:05:23,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:23,299 INFO L85 PathProgramCache]: Analyzing trace with hash -444750330, now seen corresponding path program 1 times [2024-10-31 22:05:23,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:23,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834046910] [2024-10-31 22:05:23,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:23,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:23,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:23,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:23,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834046910] [2024-10-31 22:05:23,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834046910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:23,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:23,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:05:23,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005969749] [2024-10-31 22:05:23,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:23,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:05:23,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:23,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:05:23,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:05:23,455 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 296 [2024-10-31 22:05:23,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 294 transitions, 814 flow. Second operand has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:23,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:23,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 296 [2024-10-31 22:05:23,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:26,982 INFO L124 PetriNetUnfolderBase]: 2175/18378 cut-off events. [2024-10-31 22:05:26,982 INFO L125 PetriNetUnfolderBase]: For 1120/1220 co-relation queries the response was YES. [2024-10-31 22:05:27,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27594 conditions, 18378 events. 2175/18378 cut-off events. For 1120/1220 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 232237 event pairs, 800 based on Foata normal form. 9/16925 useless extension candidates. Maximal degree in co-relation 27135. Up to 2485 conditions per place. [2024-10-31 22:05:27,095 INFO L140 encePairwiseOnDemand]: 291/296 looper letters, 25 selfloop transitions, 5 changer transitions 0/301 dead transitions. [2024-10-31 22:05:27,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 301 transitions, 894 flow [2024-10-31 22:05:27,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:05:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:05:27,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 817 transitions. [2024-10-31 22:05:27,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.920045045045045 [2024-10-31 22:05:27,098 INFO L175 Difference]: Start difference. First operand has 285 places, 294 transitions, 814 flow. Second operand 3 states and 817 transitions. [2024-10-31 22:05:27,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 301 transitions, 894 flow [2024-10-31 22:05:27,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 301 transitions, 882 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-31 22:05:27,125 INFO L231 Difference]: Finished difference. Result has 287 places, 298 transitions, 844 flow [2024-10-31 22:05:27,125 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=844, PETRI_PLACES=287, PETRI_TRANSITIONS=298} [2024-10-31 22:05:27,126 INFO L277 CegarLoopForPetriNet]: 280 programPoint places, 7 predicate places. [2024-10-31 22:05:27,126 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 298 transitions, 844 flow [2024-10-31 22:05:27,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:27,127 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:05:27,127 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:05:27,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-31 22:05:27,127 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-31 22:05:27,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:27,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2086428594, now seen corresponding path program 1 times [2024-10-31 22:05:27,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:27,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572148809] [2024-10-31 22:05:27,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:27,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:27,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:05:27,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:27,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572148809] [2024-10-31 22:05:27,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572148809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:27,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:27,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:05:27,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213468777] [2024-10-31 22:05:27,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:27,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:05:27,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:27,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:05:27,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:05:27,385 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 296 [2024-10-31 22:05:27,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 298 transitions, 844 flow. Second operand has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:05:27,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:05:27,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 296 [2024-10-31 22:05:27,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:05:29,020 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([745] L732-1-->L732-2: Formula: (= |v_#race~value~0_1| |v_t1Thread1of1ForFork0_#t~nondet13#1_3|) InVars {t1Thread1of1ForFork0_#t~nondet13#1=|v_t1Thread1of1ForFork0_#t~nondet13#1_3|} OutVars{t1Thread1of1ForFork0_#t~nondet13#1=|v_t1Thread1of1ForFork0_#t~nondet13#1_3|, #race~value~0=|v_#race~value~0_1|} AuxVars[] AssignedVars[#race~value~0][261], [Black: 348#true, 322#(= |#race~buffer_size~0| 0), Black: 320#true, 378#(or (and (<= 2147483648 (mod (+ ~first~0 4294967295) 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (- 1) ~first~0 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0)) (and (<= (mod (+ ~first~0 4294967295) 4294967296) 2147483647) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| ~first~0 4294967295 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0))), 288#true, Black: 324#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 296#true, Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 358#(= ~value~0 0), 54#L764-4true, 260#L748-6true, Black: 335#(= |#race~value~0| 0), Black: 368#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~send~0|), Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 373#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), 250#L732-2true, Black: 310#true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 371#true, 356#true, Black: 315#true]) [2024-10-31 22:05:29,021 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2024-10-31 22:05:29,021 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-31 22:05:29,021 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-10-31 22:05:29,021 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2024-10-31 22:05:29,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([745] L732-1-->L732-2: Formula: (= |v_#race~value~0_1| |v_t1Thread1of1ForFork0_#t~nondet13#1_3|) InVars {t1Thread1of1ForFork0_#t~nondet13#1=|v_t1Thread1of1ForFork0_#t~nondet13#1_3|} OutVars{t1Thread1of1ForFork0_#t~nondet13#1=|v_t1Thread1of1ForFork0_#t~nondet13#1_3|, #race~value~0=|v_#race~value~0_1|} AuxVars[] AssignedVars[#race~value~0][261], [Black: 348#true, 322#(= |#race~buffer_size~0| 0), Black: 320#true, 378#(or (and (<= 2147483648 (mod (+ ~first~0 4294967295) 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (- 1) ~first~0 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0)) (and (<= (mod (+ ~first~0 4294967295) 4294967296) 2147483647) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| ~first~0 4294967295 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0))), 288#true, Black: 324#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 296#true, Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 358#(= ~value~0 0), 54#L764-4true, Black: 335#(= |#race~value~0| 0), Black: 368#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~send~0|), Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 373#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), 250#L732-2true, Black: 310#true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 198#L748-5true, 371#true, 356#true, Black: 315#true]) [2024-10-31 22:05:29,022 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is cut-off event [2024-10-31 22:05:29,022 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2024-10-31 22:05:29,022 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-31 22:05:29,022 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2024-10-31 22:05:29,092 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([836] L748-4-->L748-5: Formula: (= |v_#race~value~0_4| 0) InVars {} OutVars{#race~value~0=|v_#race~value~0_4|} AuxVars[] AssignedVars[#race~value~0][263], [322#(= |#race~buffer_size~0| 0), Black: 320#true, 378#(or (and (<= 2147483648 (mod (+ ~first~0 4294967295) 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (- 1) ~first~0 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0)) (and (<= (mod (+ ~first~0 4294967295) 4294967296) 2147483647) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| ~first~0 4294967295 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0))), 288#true, Black: 324#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 296#true, Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 358#(= ~value~0 0), 54#L764-4true, Black: 333#true, Black: 368#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~send~0|), Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 373#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), 250#L732-2true, Black: 310#true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 198#L748-5true, 371#true, 356#true, Black: 350#(= |#race~value~0| |t1Thread1of1ForFork0_#t~nondet13#1|), Black: 315#true]) [2024-10-31 22:05:29,092 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is cut-off event [2024-10-31 22:05:29,093 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2024-10-31 22:05:29,093 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-31 22:05:29,093 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2024-10-31 22:05:29,164 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([836] L748-4-->L748-5: Formula: (= |v_#race~value~0_4| 0) InVars {} OutVars{#race~value~0=|v_#race~value~0_4|} AuxVars[] AssignedVars[#race~value~0][263], [322#(= |#race~buffer_size~0| 0), Black: 320#true, 378#(or (and (<= 2147483648 (mod (+ ~first~0 4294967295) 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (- 1) ~first~0 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0)) (and (<= (mod (+ ~first~0 4294967295) 4294967296) 2147483647) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| ~first~0 4294967295 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0))), 288#true, Black: 324#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 296#true, Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 358#(= ~value~0 0), 54#L764-4true, Black: 368#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~send~0|), Black: 333#true, Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 373#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 310#true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 198#L748-5true, 371#true, 356#true, 89#L732-3true, Black: 315#true, Black: 350#(= |#race~value~0| |t1Thread1of1ForFork0_#t~nondet13#1|)]) [2024-10-31 22:05:29,164 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2024-10-31 22:05:29,165 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-31 22:05:29,165 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2024-10-31 22:05:29,165 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-10-31 22:05:29,241 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([836] L748-4-->L748-5: Formula: (= |v_#race~value~0_4| 0) InVars {} OutVars{#race~value~0=|v_#race~value~0_4|} AuxVars[] AssignedVars[#race~value~0][175], [322#(= |#race~buffer_size~0| 0), Black: 320#true, 378#(or (and (<= 2147483648 (mod (+ ~first~0 4294967295) 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (- 1) ~first~0 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0)) (and (<= (mod (+ ~first~0 4294967295) 4294967296) 2147483647) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| ~first~0 4294967295 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0))), 288#true, Black: 324#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 296#true, Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 358#(= ~value~0 0), 54#L764-4true, Black: 333#true, Black: 368#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~send~0|), Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 373#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 310#true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 198#L748-5true, 11#L733true, 371#true, 356#true, Black: 350#(= |#race~value~0| |t1Thread1of1ForFork0_#t~nondet13#1|), Black: 315#true]) [2024-10-31 22:05:29,241 INFO L294 olderBase$Statistics]: this new event has 194 ancestors and is cut-off event [2024-10-31 22:05:29,241 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2024-10-31 22:05:29,241 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-10-31 22:05:29,242 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2024-10-31 22:05:30,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([745] L732-1-->L732-2: Formula: (= |v_#race~value~0_1| |v_t1Thread1of1ForFork0_#t~nondet13#1_3|) InVars {t1Thread1of1ForFork0_#t~nondet13#1=|v_t1Thread1of1ForFork0_#t~nondet13#1_3|} OutVars{t1Thread1of1ForFork0_#t~nondet13#1=|v_t1Thread1of1ForFork0_#t~nondet13#1_3|, #race~value~0=|v_#race~value~0_1|} AuxVars[] AssignedVars[#race~value~0][261], [Black: 348#true, 322#(= |#race~buffer_size~0| 0), Black: 320#true, 288#true, 376#true, Black: 324#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 296#true, Black: 358#(= ~value~0 0), 54#L764-4true, 260#L748-6true, Black: 335#(= |#race~value~0| 0), Black: 368#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~send~0|), Black: 373#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 250#L732-2true, Black: 310#true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 356#true, 371#true, Black: 317#(= |#race~receive~0| 0)]) [2024-10-31 22:05:30,337 INFO L294 olderBase$Statistics]: this new event has 223 ancestors and is cut-off event [2024-10-31 22:05:30,337 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:05:30,337 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2024-10-31 22:05:30,337 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:05:30,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([846] L748-9-->L749: Formula: true InVars {} OutVars{t2Thread1of1ForFork1_#t~ret19#1=|v_t2Thread1of1ForFork1_#t~ret19#1_11|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~ret19#1][256], [322#(= |#race~buffer_size~0| 0), 154#L732true, Black: 320#true, 288#true, 376#true, Black: 324#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 296#true, Black: 358#(= ~value~0 0), 54#L764-4true, Black: 368#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~send~0|), Black: 333#true, Black: 373#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 310#true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 371#true, 356#true, Black: 317#(= |#race~receive~0| 0), 163#L749true, Black: 350#(= |#race~value~0| |t1Thread1of1ForFork0_#t~nondet13#1|)]) [2024-10-31 22:05:30,380 INFO L294 olderBase$Statistics]: this new event has 223 ancestors and is cut-off event [2024-10-31 22:05:30,380 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:05:30,380 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:05:30,380 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2024-10-31 22:05:30,416 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] L730-10-->L732: Formula: (= v_~value~0_2 |v_t1Thread1of1ForFork0_~i~0#1_19|) InVars {t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_19|} OutVars{t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_19|, ~value~0=v_~value~0_2} AuxVars[] AssignedVars[~value~0][297], [322#(= |#race~buffer_size~0| 0), Black: 320#true, 154#L732true, 288#true, 376#true, Black: 324#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 296#true, Black: 358#(= ~value~0 0), 54#L764-4true, Black: 368#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~send~0|), Black: 333#true, Black: 373#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 310#true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 371#true, 356#true, Black: 317#(= |#race~receive~0| 0), 163#L749true, Black: 350#(= |#race~value~0| |t1Thread1of1ForFork0_#t~nondet13#1|)]) [2024-10-31 22:05:30,416 INFO L294 olderBase$Statistics]: this new event has 223 ancestors and is cut-off event [2024-10-31 22:05:30,416 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:05:30,416 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2024-10-31 22:05:30,416 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:05:30,435 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([761] L733-2-->L733-3: Formula: (= |v_#race~send~0_7| |v_t1Thread1of1ForFork0_#t~nondet14#1_3|) InVars {t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} OutVars{#race~send~0=|v_#race~send~0_7|, t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} AuxVars[] AssignedVars[#race~send~0][290], [322#(= |#race~buffer_size~0| 0), Black: 320#true, 378#(or (and (<= 2147483648 (mod (+ ~first~0 4294967295) 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (- 1) ~first~0 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0)) (and (<= (mod (+ ~first~0 4294967295) 4294967296) 2147483647) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| ~first~0 4294967295 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0))), 288#true, 59#L751-3true, Black: 324#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 296#true, Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 358#(= ~value~0 0), 54#L764-4true, Black: 335#(= |#race~value~0| 0), Black: 366#true, 124#L733-3true, Black: 373#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 312#(= |#race~send~0| 0), 356#true, 371#true, Black: 317#(= |#race~receive~0| 0), Black: 350#(= |#race~value~0| |t1Thread1of1ForFork0_#t~nondet13#1|)]) [2024-10-31 22:05:30,435 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2024-10-31 22:05:30,435 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2024-10-31 22:05:30,435 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2024-10-31 22:05:30,435 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-10-31 22:05:30,469 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([836] L748-4-->L748-5: Formula: (= |v_#race~value~0_4| 0) InVars {} OutVars{#race~value~0=|v_#race~value~0_4|} AuxVars[] AssignedVars[#race~value~0][175], [322#(= |#race~buffer_size~0| 0), Black: 320#true, 378#(or (and (<= 2147483648 (mod (+ ~first~0 4294967295) 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (- 1) ~first~0 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0)) (and (<= (mod (+ ~first~0 4294967295) 4294967296) 2147483647) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| ~first~0 4294967295 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0))), 288#true, Black: 324#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 296#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 358#(= ~value~0 0), 54#L764-4true, Black: 333#true, Black: 368#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~send~0|), Black: 373#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 310#true, 198#L748-5true, 11#L733true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 371#true, 356#true, Black: 350#(= |#race~value~0| |t1Thread1of1ForFork0_#t~nondet13#1|), Black: 315#true]) [2024-10-31 22:05:30,469 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2024-10-31 22:05:30,469 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2024-10-31 22:05:30,469 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-10-31 22:05:30,469 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2024-10-31 22:05:30,469 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2024-10-31 22:05:30,469 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([836] L748-4-->L748-5: Formula: (= |v_#race~value~0_4| 0) InVars {} OutVars{#race~value~0=|v_#race~value~0_4|} AuxVars[] AssignedVars[#race~value~0][263], [322#(= |#race~buffer_size~0| 0), Black: 320#true, 378#(or (and (<= 2147483648 (mod (+ ~first~0 4294967295) 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (- 1) ~first~0 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0)) (and (<= (mod (+ ~first~0 4294967295) 4294967296) 2147483647) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| ~first~0 4294967295 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0))), 288#true, Black: 324#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 296#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 358#(= ~value~0 0), 54#L764-4true, Black: 333#true, Black: 368#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~send~0|), Black: 373#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 250#L732-2true, Black: 310#true, 198#L748-5true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 371#true, 356#true, Black: 350#(= |#race~value~0| |t1Thread1of1ForFork0_#t~nondet13#1|), Black: 315#true]) [2024-10-31 22:05:30,470 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2024-10-31 22:05:30,470 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2024-10-31 22:05:30,470 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-31 22:05:30,470 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2024-10-31 22:05:30,470 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2024-10-31 22:05:30,470 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([836] L748-4-->L748-5: Formula: (= |v_#race~value~0_4| 0) InVars {} OutVars{#race~value~0=|v_#race~value~0_4|} AuxVars[] AssignedVars[#race~value~0][263], [322#(= |#race~buffer_size~0| 0), Black: 320#true, 378#(or (and (<= 2147483648 (mod (+ ~first~0 4294967295) 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (- 1) ~first~0 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0)) (and (<= (mod (+ ~first~0 4294967295) 4294967296) 2147483647) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| ~first~0 4294967295 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0))), 288#true, Black: 324#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 296#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 358#(= ~value~0 0), 54#L764-4true, Black: 333#true, Black: 368#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~send~0|), Black: 373#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 310#true, 198#L748-5true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 371#true, 356#true, 89#L732-3true, Black: 350#(= |#race~value~0| |t1Thread1of1ForFork0_#t~nondet13#1|), Black: 315#true]) [2024-10-31 22:05:30,470 INFO L294 olderBase$Statistics]: this new event has 237 ancestors and is cut-off event [2024-10-31 22:05:30,470 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2024-10-31 22:05:30,471 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-31 22:05:30,471 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2024-10-31 22:05:30,471 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-10-31 22:05:30,472 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([846] L748-9-->L749: Formula: true InVars {} OutVars{t2Thread1of1ForFork1_#t~ret19#1=|v_t2Thread1of1ForFork1_#t~ret19#1_11|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~ret19#1][256], [322#(= |#race~buffer_size~0| 0), Black: 320#true, 154#L732true, 288#true, 376#true, Black: 324#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 296#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 358#(= ~value~0 0), 54#L764-4true, Black: 368#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~send~0|), Black: 333#true, Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 373#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 310#true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 356#true, 371#true, 163#L749true, Black: 350#(= |#race~value~0| |t1Thread1of1ForFork0_#t~nondet13#1|), Black: 315#true]) [2024-10-31 22:05:30,472 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2024-10-31 22:05:30,472 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:05:30,472 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-10-31 22:05:30,472 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2024-10-31 22:05:30,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([745] L732-1-->L732-2: Formula: (= |v_#race~value~0_1| |v_t1Thread1of1ForFork0_#t~nondet13#1_3|) InVars {t1Thread1of1ForFork0_#t~nondet13#1=|v_t1Thread1of1ForFork0_#t~nondet13#1_3|} OutVars{t1Thread1of1ForFork0_#t~nondet13#1=|v_t1Thread1of1ForFork0_#t~nondet13#1_3|, #race~value~0=|v_#race~value~0_1|} AuxVars[] AssignedVars[#race~value~0][261], [Black: 348#true, 322#(= |#race~buffer_size~0| 0), Black: 320#true, 288#true, 376#true, Black: 324#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 296#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), 54#L764-4true, Black: 358#(= ~value~0 0), Black: 335#(= |#race~value~0| 0), Black: 368#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~send~0|), Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 373#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), 250#L732-2true, Black: 310#true, 198#L748-5true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 356#true, 371#true, Black: 315#true]) [2024-10-31 22:05:30,501 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2024-10-31 22:05:30,501 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-10-31 22:05:30,501 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-31 22:05:30,502 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2024-10-31 22:05:30,502 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([745] L732-1-->L732-2: Formula: (= |v_#race~value~0_1| |v_t1Thread1of1ForFork0_#t~nondet13#1_3|) InVars {t1Thread1of1ForFork0_#t~nondet13#1=|v_t1Thread1of1ForFork0_#t~nondet13#1_3|} OutVars{t1Thread1of1ForFork0_#t~nondet13#1=|v_t1Thread1of1ForFork0_#t~nondet13#1_3|, #race~value~0=|v_#race~value~0_1|} AuxVars[] AssignedVars[#race~value~0][261], [Black: 348#true, 322#(= |#race~buffer_size~0| 0), Black: 320#true, 288#true, 376#true, Black: 324#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 296#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), 54#L764-4true, Black: 358#(= ~value~0 0), Black: 335#(= |#race~value~0| 0), 260#L748-6true, Black: 368#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~send~0|), Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 373#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), 250#L732-2true, Black: 310#true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 356#true, 371#true, Black: 315#true]) [2024-10-31 22:05:30,502 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2024-10-31 22:05:30,502 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:05:30,502 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-10-31 22:05:30,502 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2024-10-31 22:05:30,587 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([737] L730-10-->L732: Formula: (= v_~value~0_2 |v_t1Thread1of1ForFork0_~i~0#1_19|) InVars {t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_19|} OutVars{t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_19|, ~value~0=v_~value~0_2} AuxVars[] AssignedVars[~value~0][297], [322#(= |#race~buffer_size~0| 0), Black: 320#true, 154#L732true, 288#true, 376#true, Black: 324#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 296#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 358#(= ~value~0 0), 54#L764-4true, Black: 333#true, Black: 368#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~send~0|), Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 373#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 310#true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 356#true, 371#true, 163#L749true, Black: 317#(= |#race~receive~0| 0), Black: 350#(= |#race~value~0| |t1Thread1of1ForFork0_#t~nondet13#1|)]) [2024-10-31 22:05:30,587 INFO L294 olderBase$Statistics]: this new event has 225 ancestors and is cut-off event [2024-10-31 22:05:30,587 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:05:30,587 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2024-10-31 22:05:30,587 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:05:30,587 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2024-10-31 22:05:30,618 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([846] L748-9-->L749: Formula: true InVars {} OutVars{t2Thread1of1ForFork1_#t~ret19#1=|v_t2Thread1of1ForFork1_#t~ret19#1_11|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~ret19#1][256], [322#(= |#race~buffer_size~0| 0), Black: 320#true, 154#L732true, 288#true, 376#true, Black: 324#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 296#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 358#(= ~value~0 0), 54#L764-4true, Black: 333#true, Black: 368#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~send~0|), Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 373#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 310#true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 356#true, 371#true, Black: 317#(= |#race~receive~0| 0), 163#L749true, Black: 350#(= |#race~value~0| |t1Thread1of1ForFork0_#t~nondet13#1|)]) [2024-10-31 22:05:30,619 INFO L294 olderBase$Statistics]: this new event has 225 ancestors and is cut-off event [2024-10-31 22:05:30,619 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:05:30,619 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2024-10-31 22:05:30,619 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:05:30,619 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2024-10-31 22:05:30,655 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([745] L732-1-->L732-2: Formula: (= |v_#race~value~0_1| |v_t1Thread1of1ForFork0_#t~nondet13#1_3|) InVars {t1Thread1of1ForFork0_#t~nondet13#1=|v_t1Thread1of1ForFork0_#t~nondet13#1_3|} OutVars{t1Thread1of1ForFork0_#t~nondet13#1=|v_t1Thread1of1ForFork0_#t~nondet13#1_3|, #race~value~0=|v_#race~value~0_1|} AuxVars[] AssignedVars[#race~value~0][261], [Black: 348#true, 322#(= |#race~buffer_size~0| 0), Black: 320#true, 288#true, 376#true, Black: 324#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 296#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 358#(= ~value~0 0), 54#L764-4true, 260#L748-6true, Black: 335#(= |#race~value~0| 0), Black: 368#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~send~0|), Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 373#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), 250#L732-2true, Black: 310#true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 356#true, 371#true, Black: 317#(= |#race~receive~0| 0)]) [2024-10-31 22:05:30,656 INFO L294 olderBase$Statistics]: this new event has 225 ancestors and is cut-off event [2024-10-31 22:05:30,656 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:05:30,656 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2024-10-31 22:05:30,656 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:05:30,656 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2024-10-31 22:05:30,656 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([745] L732-1-->L732-2: Formula: (= |v_#race~value~0_1| |v_t1Thread1of1ForFork0_#t~nondet13#1_3|) InVars {t1Thread1of1ForFork0_#t~nondet13#1=|v_t1Thread1of1ForFork0_#t~nondet13#1_3|} OutVars{t1Thread1of1ForFork0_#t~nondet13#1=|v_t1Thread1of1ForFork0_#t~nondet13#1_3|, #race~value~0=|v_#race~value~0_1|} AuxVars[] AssignedVars[#race~value~0][261], [Black: 348#true, 322#(= |#race~buffer_size~0| 0), Black: 320#true, 288#true, 376#true, Black: 324#true, Black: 359#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (= ~value~0 0)), Black: 362#(and (<= (+ |t2Thread1of1ForFork1_removeLogElement_#res#1| 1) 0) (not (= |t2Thread1of1ForFork1_#t~ret19#1| 0)) (= ~value~0 0)), Black: 296#true, Black: 330#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 358#(= ~value~0 0), 54#L764-4true, Black: 335#(= |#race~value~0| 0), Black: 368#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~send~0|), Black: 340#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 373#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), 250#L732-2true, Black: 310#true, Black: 345#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 198#L748-5true, 356#true, 371#true, Black: 317#(= |#race~receive~0| 0)]) [2024-10-31 22:05:30,657 INFO L294 olderBase$Statistics]: this new event has 224 ancestors and is cut-off event [2024-10-31 22:05:30,657 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-10-31 22:05:30,657 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-10-31 22:05:30,657 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event